Skip to main content
Download book PDF
View expanded cover

Conference on the Theory and Application of Cryptographic Techniques

CRYPTO 1986: Advances in Cryptology — CRYPTO’ 86 pp 186–194Cite as

How To Prove Yourself: Practical Solutions to Identification and Signature Problems

Part of the Lecture Notes in Computer Science book series (LNCS,volume 263)

Abstract

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.

Keywords

  • Credit Card
  • Smart Card
  • Signature Scheme
  • Authentication Scheme
  • Security Level

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download conference paper PDF

6. Bibliography

  1. Fischer, Micali and Rackoff [1984]: A Secure Protocol for the Oblivious Transfer, presented at Eurocrypt, April 1984.

    Google Scholar 

  2. Goldreich, Goldwasser and Micali [1984]: How to Construct Random Functions, 25th Symposium on Foundations of Computer Science, October 1984.

    Google Scholar 

  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.

    Google Scholar 

  4. Goldwasser, Micali and Rackoff [1985]: The Knowledge Complexity of Interactive Proof Systems, 17th ACM Symposium on Theory of Computation, May 1985.

    Google Scholar 

  5. Shamir [1984]: Identity-Based Cryptosystems and Signature Schemes, Proceedings of Crypto’ 84, Lecture Notes in Computer Science no. 196, Springer Verlag 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, The Weizmann Institute of Science, Rehovot, 76100, Israel

    Amos Fiat & Adi Shamir

Authors
  1. Amos Fiat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adi Shamir
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. AT&T Bell Laboratories, Murray Hill, NJ, 07974-2070, USA

    Andrew M. Odlyzko

Rights and permissions

Reprints and Permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fiat, A., Shamir, A. (1987). How To Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (eds) Advances in Cryptology — CRYPTO’ 86. CRYPTO 1986. Lecture Notes in Computer Science, vol 263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47721-7_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-47721-7_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18047-0

  • Online ISBN: 978-3-540-47721-1

  • eBook Packages: Springer Book Archive