Efficient identification schemes using two prover interactive proofs

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

Volumn 435 LNCS, Issue , 1990, Pages 498-506

  Ben Or, Michael ^a   Goldwasser, Shafi ^b   Kilimt, Joe ^b   Wigderson, Avi ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CIRCUIT SATISFIABILITY; IDENTIFICATION CARDS; IDENTIFICATION SCHEME; INTERACTIVE PROOFS; PERFECT ZERO-KNOWLEDGE; SUBSET SUM PROBLEMS;

CRYPTOGRAPHY;

EID: 84990834089     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/0-387-34805-0_44     Document Type: Conference Paper

References (12)

1. Blum, “How to Prove a Theorem So No One Else Can Claim It”, Zero Knowledge Proofs, ICM 1986.
2. Ben-Or, Goldwasser, Kilian, and Wigderson, “Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions,” Proceedings of STOC 1988.
3. Brassard, Gilles, David Chaum, and Claude Cr’epeau, “Minimum Disclosure Proofs of Knowledge,” JCSS, Oct. 1988.
4. Fiat, and Shamir, “How to Prove Yourself: Practical Solutions to Identification and Signature Problems”, CRYPTO 86.
5. Guillou, and Quisquater, “A Paradoxical Identity Based Signature Scheme Resulting from Zero Knowledge”, CRYPTO 88.
6. Goldwasser, Micali, and Rackoff, “The Knowledge Complexity of Interactive Proofs”, SIAM J. of Comp., Feb. 1989.
7. Goldreich, Micali, and Wigderson, “Proofs that Yield Nothing But the Validity of the Assertion”, Proceedings of FOCS 1986.
8. Impagliazzo, Russell and Moti Yung, “Direct Minimum Knowledge Computations,” CRYPTO 87.
9. Kilian, Micali, and Ostrovsky, “Efficient Zero Knowledge Proofs with Bounded Interaction,” Proceedings of FOCS 89.
10. Lagarias, and Odlyzko, “Solving Low Density Subset Sum Problems”, Proceedings of FOCS 1983.
11. Micali and Shamir, “An Improvement of the Fiat-Shamir Identification and Signature Scheme”, CRYPTO 88.
12. A. Shamir, “A Zero-Knowledge Proof for Knapsacks”, presented at a workshop on Probabilistic Algorithms, Marseille (March 1986).