Instance-dependent verifiable random functions and their application to simultaneous resettability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4515 LNCS, Issue , 2007, Pages 148-168

  Yi, Deng ^a   Dongdai, Lin ^a  

^a INSTITUTE OF SOFTWARE   (China)

Author keywords

Instance dependent verifiable random functions; Simultaneous resettability; Zero knowledge

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL MODELS; PUBLIC KEY CRYPTOGRAPHY; THEOREM PROVING; VERIFICATION;

INSTANCE DEPENDENT VERIFIABLE RANDOM FUNCTIONS; SIMULTANEOUS RESETTABILITY; ZERO KNOWLEDGE;

RANDOM PROCESSES;

EID: 38049110283     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (25)

1. B. Barak. How to go beyond the black-box simulation barrier. In Proc. of IEEE FOCS 2001, pp.106-115.
2. B. Barak, O. Goldreich, S. Goldwasser, Y. Lindell. Resettably sound Zero Knowledge and its Applications. In Proc. of IEEE FOCS 2001, pp. 116-125.
3. B. Barak, O. Goldreich. Universal Arguments and Their Applications. In Proc. of IEEE CCC 2002, pp. 194-203.
4. M. Blum. How to Prove a Theorem so No One Else can Claim It. In Proc. of ICM'86, pp. 1444-1451, 1986.
5. B. Barak, Y. Lindell, S. Vadhan. Lower Bounds for Non-Black-Box Zero Knowledge. In Proc. of IEEE FOCS 2003, pp.384-393
6. M. Blum, S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo Random Bits. In Proc. of IEEE FOCS 1982, pp. 112-117
7. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In Proc. of IEEE FOCS 2001, pp.136-145
8. R. Canetti, O. Goldreich, S. Goldwasser, S. Micali. Resettable Zero Knowledge. In Proc. of ACM STOC 2000, pp.235-244
9. R. Canetti, J. Kilian, E. Petrank and A. Rosen. Concurrent Zero-Knowledge requires Ω{logn) rounds. In Proc. of ACM STOC 2001, pp.570-579.
10. C. Dwork, M. Naor. Zaps and Their Applications. In Proc. of IEEE FOCS 2000, pp.283-293
11. C. Dwork, M. Naor and A. Sahai. Concurrent Zero-Knowledge. In Proc. of ACM STOC 1998, pp.409-418.
12. U.Feige and A. Shamir. Witness Indistinguishability and Witness Hiding Protocols. In Proc. of ACM STOC 1990, pp.416-426.
13. O. Goldreich. Foundation of Cryptography-Basic Tools. Cambridge University Press, 2001.
14. O. Goldreich, S. Goldwasser, S. Micali. How to construct random functions. J. ACM 33(4), pp.792-807
15. O. Goldreich, S. Micali and A. Wigderson. Proofs that yield nothing but their validity or All languages in NP have zero-knowledge proof systems. J. ACM, 38(3), pp.691-729, 1991.
16. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM. J. Computing, 18(1):186-208, February 1989.
17. J. Groth, R. Ostrovsky and A. Sahai. Non-interactive Zaps and New Techniques for NIZK. In Advances in Cryptology-Crypto'o6, LNCS 4117, pp.97-111.
18. J. Hastad, R. Impagliazzo, L. A. Levin, M. Luby. A Pseudorandom Generator from Any One-Way Functions. SIAM Journal on Computing 28(4):1364-1396, 1999.
19. T. Itoh, Y. Ohta. A language-dependent cryptographic primitive. Journal of Cryptology 10(1) pp.37-49, 1997
20. Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan. Concurrent Zero Knowledge Without Complexity Assumptions. TCC 2006, LNCS3876, pp. 1-20
21. S. Micali, L. Reyzin. Soundness in the public-key model. In Advances in Cryptology-Crypto'o2, LNCS2139, pp.542C565, 2001.
22. S. Micali, R. Rivest. Micropayments revisited. In CT-RSA, pp,149C163, 2002.
23. S. Micali, M. Rabin, and S. Vadhan. Verifiable random functions. In Proc. of IEEE FOCS, pp. 120C130, 1999.
24. M. Naor. Bit Commitment using Pseudorandomness. Journal of Cryptology 4(2): 151-158, 1991.
25. A. Yao. Theory and Applications of Trapdoor Functions. In Proc. of IEEE FOCS 1982, pp.80-91