How to prove yourself: Practical solutions to identification and signature problems

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

Volumn 263 LNCS, Issue , 1987, Pages 186-194

  Fiat, Amos ^a   Shamir, Adi ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; PERSONAL COMPUTERS; REMOTE CONTROL; SMART CARDS;

CHOSEN MESSAGE ATTACKS; MICROPROCESSOR-BASED DEVICES; MODULAR MULTIPLICATION; PRACTICAL SOLUTIONS; PROVABLY SECURE; PUBLIC KEYS; SIGNATURE SCHEME;

AUTHENTICATION;

EID: 84990731886     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47721-7_12     Document Type: Conference Paper

References (5)

1. Fischer, Micali and Rackoff [1984]: A Secure Protocol for the Oblivious Transfer, presented at Eurocrypt, April 1984.
2. Goldreich, Goldwasser and Micali [1984]: How to Construct Random Functions, 25th Symposium on Foundations of Computer Science, October 1984.
3. Goldreich, Micali and Wigderson [1986]: Proofs that Yield Nothing But the Validity of the Assertion and the Methodology of Cryptographic Protocol Design, submitted to 27th Symposium on Foundations of Computer Science, November 1986.
4. Goldwasser, Micali and Rackoff [1985]: The Knowledge Complexity of Interactive Proof Systems, 17th ACM Symposium on Theory of Computation, May 1985.
5. Shamir [1984]: Identity-Based Cryptosystems and Signature Schemes, Proceedings of Crypto’ 84, Lecture Notes in Computer Science no. 196, Springer Verlag 1985.