How To Prove Yourself: Practical Solutions to Identification and Signature Problems
In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack if factoring is difficult, and typical implementations require only 1% to 4% of the number of modular multiplications required by the RSA scheme. Due to their simplicity, security and speed, these schemes are ideally suited for microprocessor-based devices such as smart cards, personal computers, and remote control systems.
- 1.Fischer, Micali and Rackoff : A Secure Protocol for the Oblivious Transfer, presented at Eurocrypt, April 1984.Google Scholar
- 2.Goldreich, Goldwasser and Micali : How to Construct Random Functions, 25th Symposium on Foundations of Computer Science, October 1984.Google Scholar
- 3.Goldreich, Micali and Wigderson : 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.Google Scholar
- 4.Goldwasser, Micali and Rackoff : The Knowledge Complexity of Interactive Proof Systems, 17th ACM Symposium on Theory of Computation, May 1985.Google Scholar
- 5.Shamir : Identity-Based Cryptosystems and Signature Schemes, Proceedings of Crypto’ 84, Lecture Notes in Computer Science no. 196, Springer Verlag 1985.Google Scholar