Resettable zero-knowledge in the weak public-key model

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

Volumn 2656, Issue , 2003, Pages 123-139

  Zhao, Yunlei ^a   Deng, Xiaotie ^b   Lee, C H ^b   Zhu, Hong ^a  

^a FUDAN UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; SMART CARDS;

COMPLEXITY LEVERAGING; ERROR PROBABILITIES; PARALLEL REPETITION; POLYNOMIAL-TIME; PUBLIC-KEY MODEL; SUBEXPONENTIAL TIME; VERIFIABLE RANDOM FUNCTION; ZERO KNOWLEDGE;

GOLD;

EID: 26444487820     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39200-9_8     Document Type: Article

References (28)

1. B. Barak. How to Go Beyond the Black-Box Simulation Barrier. In IEEE Symposium on Foundations of Computer Science, pages 106-115, 2001.
2. M. Blum, A. D. Santis, S. Micali and G. Persiano. Non-interactive Zero-Knowledge. SIAM Journal on Computing, 20(6): 1084-1118, 1991.
3. M. Bellare, M. Fischlin, S. Goldwasser and S. Micali. Identification protocols secure against reset attacks. In B. Pfitzmann (Ed.): Advances in Cryptology-Proceedings of EUROCRYPT 2001, LNCS 2045, pages 495-511. Springer-Verlag, 2001.
4. M. Blum, P. Feldman and S. Micali. Non-interactive Zero-Knowledge and Its Applications. In ACM Symposium on Theory of Computing, pages 103-112, 1988.
5. M. Bellare, R. Impagliazzo and M. Naor. Does Parallel Repetition Lower the Error in Computationally Sound Protocols. In IEEE Symposium on Foundations of Computer Science, pages 374-383, 1997.
6. B. Barak and Y. Lindell. Strict Polynomial-Time in Simulation and Extraction. In ACM Symposium on Theory of Computing, pages 484-493, 2002.
7. R. Cramer and I. Damgard. Linear Zero-knowledge: A Note on Efficient Zero-Knowledge Proofs and Arguments. In ACM Symposium on Theory of Computing, pages 436-445, 1997.
8. R. Canetti, O. Goldreich, S. Goldwasser and S. Micali. Resettable Zero-Knowledge. In ACM Symposium on Theory of Computing, pages 235-244, 2000.
9. R. Canetti, J. Kilian, E. Petrank and A. Rosen. Black-Box Concurrent Zero-Knowledge Requires Ω̄Rounds. In ACM Symposium on Theory of Computing, pages 570-579, 2001.
10. A. D. Santis, G. D. Crescenzo, R. Ostrovsky, G. Persiano and A. Sahai. Robust Non-Interactive Zero-Knowledge. In J. Kilian (Ed.): Advances in Cryptology-Proceedings of CRYPTO 2001, LNCS 2139, pages 566-598. Springer-Verlag, 2001.
11. C. Dwork and M. Naor. Zaps and Their Applications. In IEEE Symposium on Foundations of Computer Science, pages 283-293, 2000.
12. C. Dwork, M. Naor and A. Sahai. Concurrent Zero-Knowledge. In ACM Symposium on Theory of Computing, pages 409-418, 1998.
13. C. Dwork and L. Stockmeyer. 2-Round Zero-Knowledge and Proof Auditors. In ACM Symposium on Theory of Computing, pages 322-331, 2002.
14. U. Feige, A. Fiat and A. Shamir. Zero-knowledge Proof of Identity. Journal of Cryptology, 1(2): 77-94, 1988.
15. U.Feige, D. Lapidot and A. Shamir. Multiple Non-Interactive Zero-Knowledge Proofs Under General Assumptions. SIAM Journal on Computing, 29(1): 1-28, 1999.
16. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In A. Odlyzko (Ed.): Advances in Cryptology-Proceedings of CRYPTO'86, LNCS 263, pages 186-194. Springer-Verlag, 1986.
17. O. Goldreich. Foundation of Cryptography-Basic Tools. Cambridge University Press, 2001.
18. S. Goldwasser and M. Bellare. Lecture Notes on Cryptography. 2001.
19. O. Goldreich, S. Goldwasser and S. Micali. How to Construct Random Functions. Journal of the Association for Computing Machinery, 33(4):792-807, 1986.
20. O. Goldreich and H. Krawczky. On the Composition of Zero-Knowledge Proof Systems. SIAM Journal on Computing, 25(1): 169-192, 1996.
21. J. Kilian, E. Petrank. An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions. Journal of Cryptology, 11(2): 24, 1998.
22. J. Kilian, E. Petrank, R. Richardson. Concurrent and Resettable Zero-Knowledge in Poly-Logarithmic Rounds. In ACM Symposium on Theory of Computing, pages 560-569, 2001.
23. A. Lysyanskaya. Unique Signatures and Verifiable Random Functions from the DH-DDH Separation. In M. Yung (Ed.): Advances in Cryptology-Proceedings of CRYPTO 2002, LNCS 2442 , pages 597-612. Springer-Verlag, 2002.
24. S. Micali and L. Reyzin. Soundness in the Public-Key Model. In J. Kilian (Ed.): Advances in Cryptology-Proceedings of CRYPTO 2001, LNCS 2139, pages 542-565. Springer-Verlag, 2001.
25. S. Micali and L. Reyzin. Min-Round Resettable Zero-Knowledge in the Public-Key Model. In B. Pfitzmann (Ed.): Advances in Cryptology-Proceedings of EUROCRYPT 2001, LNCS 2045, pages 373-393. Springer-Verlag, 2001.
26. S. Micali, M. Rabin and S. Vadhan. Verifiable Random Functions. In IEEE Symposium on Foundations of Computer Science, pages 120-130, 1999.
27. L. Reyzin. Zero-Knowledge with Public Keys. Ph. D Thesis, MIT, 2001.
28. R. Richardson and J. Killian. On the Concurrent Composition of Zero-Knowledge Proofs. In J. Stern (Ed.): Advances in Cryptology-Proceedings of EUROCRYPT 1999, LNCS 1592, pages 415-423. Springer-Verlag, 1999.