ASIACRYPT
2010
Springer
14 years 4 months ago
2010
Springer
We show that probabilistically checkable proofs can be used to shorten non-interactive zero-knowledge proofs. We obtain publicly verifiable non-interactive zero-knowledge proofs fo...
CRYPTO
2007
Springer
15 years 18 days ago
2007
Springer
Abstract. This paper introduces simulatable verifiable random functions (sVRF). VRFs are similar to pseudorandom functions, except that they are also verifiable: corresponding to...