Non-interactive distributed-verifier proofs and proving relations among commitments

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

Volumn 2501, Issue , 2002, Pages 206-224

  Abe, Masayuki ^a   Cramer, Ronald ^b   Fehr, Serge ^b  

^a NTT CORPORATION   (Japan)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; EMPLOYMENT; INTERACTIVE COMPUTER SYSTEMS; SECURITY OF DATA;

CIRCUIT SATISFIABILITY; MULTIPARTY COMPUTATION; NON-INTERACTIVE PROOF; NON-INTERACTIVE ZERO-KNOWLEDGE PROOFS; ONE-WAY GROUP HOMOMORPHISMS; THRESHOLD CRYPTOGRAPHY; VERIFIABLE SECRET SHARING SCHEME; ZERO-KNOWLEDGE PROTOCOLS;

CRYPTOGRAPHY;

EID: 84958748475     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36178-2_13     Document Type: Conference Paper

References (17)

1. Masayuki Abe. Robust distributed multiplication without interaction. In Advances in Cryptology – CRYPTO’99, volume 1666 of Lecture Notes in Computer Science. Springer-Verlag, 1999.
2. Gilles Brassard, David Chaum, and Claude Crépeau. Minimum disclosure proofs ofkno wledge. Journal of Computer and System Sciences, 37(2), 1988.
3. Donald Beaver. Secure multiparty protocols and zero-knowledge proofsystems tolerating a faulty minority. Journal of Cryptology, 4(2), 1991.
4. Mihir Bellare, and Oded Goldreich. On Defining Proofs of Knowledge. In Advances in Cryptology – CRYPTO’92, volume 740 of Lecture Notes in Computer Science. Springer, 1998.
5. Joan F. Boyar, Mark W. Krentel, and Stuart A, Kurtz A discrete logarithm implementation ofzero-kno wledge blobs. Technical Report TR-87-02, Department ofComputer Science, University ofChicago, 1987.
6. Ronald Cramer and Ivan Damgard, L Linear zero-knowledge: A note on efficient zero-knowledge proofs and arguments. In 29th ACM Symposium on Theory of Computing. ACM Press, 1997.
7. Ronald Cramer and Ivan Damgard. Zero-knowledge proofs for finite field arithmetic or: Can zero-knowledge be for free? In Advances in Cryptology –CRYPTO’98, volume 1462 of Lecture Notes in Computer Science. Springer, 1998.
8. Ronald Cramer, Ivan Damgard, and Berry Schoenmakers. Proofs of partial knowledge and simplified design ofwitness hiding protocols. In Advances in Cryptology – CRYPTO’94, volume 839 of Lecture Notes in Computer Science. Springer, 1994.
9. Ronald Cramer and Serge Fehr. Optimal black-box secret sharing over arbitrary Abelian groups. In Advances in Cryptology – CRYPTO’02, volume 2442 of Lecture Notes in Computer Science. Springer, 2002.
10. Ronald Cramer, Matthew Franklin, Berry Schoenmakes, and Moti Yung. Multiauthority secret-ballot elections with linear work. In Advances in Cryptology –EUROCRYPT’96, volume 1070 of Lecture Notes in Computer Science. Springer, 1996.
11. Benny Chor, Shafi Goldwasser, Silvio Micali, and Baruch Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence off aults (extended abstract). In 26th Annual Symposium on Foundations of Computer Science. IEEE, 1985.
12. Rosario Gennaro, Michael O. Rabin, and Tal Rabin. Simplified VSS and fasttrack multiparty computations with applications to threshold cryptography. In 17th ACM Symposium on Principles of Distributed Computing, 1998.
13. Martin Hirt and Ueli Maurer Complete characterization ofadv ersaries tolerable in secure multi-party computation (extended abstract). In 16th ACM Symposium on Principles of Distributed Computing, 1997. Final version appeared in Journal ofCryptology 2000.
14. Maurizio Karchmer and Avi Wigderson. On span programs. In 8th Annual Conference on Structure in Complexity Theory. IEEE, 1993.
15. Pascal Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology – EUROCRYPT’99, Lecture Notes in Computer Science. Springer, 1999.
16. Torben P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology – CRYPTO’91, volume 576 of Lecture Notes in Computer Science. Springer, 1991.
17. Adi Shamir. How to share a secret. Communications of the Association for Computing Machinery, 22(11), 1979.