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

Amos Fiat, Adi Shamir

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationAdvances in Cryptology — CRYPTO 1986 - Proceedings
EditorsAndrew M. Odlyzko
PublisherSpringer Verlag
Number of pages9
ISBN (Print)9783540180470
StatePublished - 1987
Externally publishedYes
EventAnnual International Cryptology Conference, CRYPTO 1986 - Santa Barbara, United States
Duration: 11 Aug 198615 Aug 1986

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume263 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceAnnual International Cryptology Conference, CRYPTO 1986
Country/TerritoryUnited States
CitySanta Barbara


Dive into the research topics of 'How to prove yourself: Practical solutions to identification and signature problems'. Together they form a unique fingerprint.

Cite this