Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(3)
Provable Security
Zero Knowledge
Zero Knowledge Proof
Related Publications
(75)
How to Prove Yourself: Practical Solutions to Identification and Signature Problems
A Practical ZeroKnowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory
The knowledge complexity of interactive proof systems
GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks
Proofs that yield nothing but their validity or all languages in NP have zeroknowledge proof systems
Subscribe
Academic
Publications
Zero knowledge proofs of identity
Zero knowledge proofs of identity,10.1145/28395.28419,U. Fiege,Amos Fiat,Adi Shamir
Edit
Zero knowledge proofs of identity
(
Citations: 458
)
BibTex

RIS

RefWorks
Download
U. Fiege
,
Amos Fiat
,
Adi Shamir
In this paper we extend the notion of
zero knowledge
proofs of membership (which reveal one bit of information) to
zero knowledge
proofs of knowledge (which reveal no information whatsoever). After formally defining this notion, we show its relevance to identification schemes, in which parties prove their identity by demonstrating their knowledge rather than by proving the validity of assertions. We describe a novel scheme which is provably secure if factoring is difficult and whose practical implementations are about two orders of magnitude faster than RSAbased identification schemes. In the last part of the paper we consider the question of sequential versus parallel executions of
zero knowledge
protocols, define a new notion of “transferable information”, and prove that the parallel version of our identification scheme (which is not known to be zero knowledge) is secure since it reveals no transferable information.
Conference:
ACM Symposium on Theory of Computing  STOC
, pp. 210217, 1987
DOI:
10.1145/28395.28419
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
portal.acm.org
)
(
portal.acm.org
)
(
portal.acm.org
)
(
www.fi.muni.cz
)
(
www.fi.muni.cz
)
(
www.informatik.unitrier.de
)
More »
Citation Context
(180)
...There are classical ZKPbased protocols constructed on computationally hard problems such as factorization (
Fiat & Sharmir, 1986
;
Feige, Fiat, & Sharmir, 1988
) and discrete logarithm (
Chaum, Evertse, Van De Graff, & Peralta, 1987
)...
U. Thiruvaazhi
,
et al.
Web Authentication Protocol Using Zero Knowledge Proof
...FiatShamir idea [
2
] involving repeating several times a threepass challengeresponse step (to avoid predicting, by the adversary, the challenge with nonnegligible probability)...
Dima Grigoriev
,
et al.
Authentication from matrix conjugation
...A proof is created so that only the individual to whom the proof is bound can properly use it. Proofs of identity attributes are built using zero knowledge proof of knowledge (ZKPK for brevity) techniques [6,
18
]...
...Bypassing the cryptographic ZKPK protocol is computationally hard [
18
, 5]. Additionally, the cryptographic ZKPK protocol prevents replay attacks: the attacker cannot use the proofs created during a given biometric verification process in any another verification process...
Abhilasha BhargavSpantzel
,
et al.
Biometricsbased identifiers for digital identity management
...Any language in NP has an interactive zero knowledge proof system [
11
,12]...
Jinguang Han
,
et al.
A Generic Construction of Dynamic Single Signon with Strong Security
...(2) At the anonymizing phase, the agent makes a “noninteractive proof of knowledge” [
FFS87
, GMR85] σi which proves that he or she knows a valid signature r of the signer i on the message m. (3) To anonymize the proof σi, the agent chooses an appropriate ring and simulates the proof of knowledge with respect to other members in the ring...
Fumitaka Hoshino
,
et al.
Anonymizable Signature and Its Construction from Pairings
References
(13)
Knowledge and common knowledge in a distributed environment
(
Citations: 644
)
Joseph Y. Halpern
,
Yoram Moses
Conference:
Symposium on Principles of Distributed Computing  PODC
, pp. 5061, 1984
Private coins versus public coins in interactive proof systems
(
Citations: 238
)
Shafi Goldwasser
,
Michael Sipser
Conference:
ACM Symposium on Theory of Computing  STOC
, pp. 5968, 1986
The Knowledge Complexity of Interactive ProofSystems (Extended Abstract)
(
Citations: 108
)
Shafi Goldwasser
,
Silvio Micali
,
Charles Rackoff
Conference:
ACM Symposium on Theory of Computing  STOC
, pp. 291304, 1985
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
(
Citations: 222
)
Oded Goldreich
,
Silvio Micali
,
Avi Wigderson
Conference:
IEEE Symposium on Foundations of Computer Science  FOCS
, pp. 174187, 1986
Demonstrating That a Public Predicate Can Be Satisfied Without Revealing Any Information About How
(
Citations: 28
)
David Chaum
,
Norman Shapiro
,
Michael Rabin
Conference:
International Crytology Conference  CRYPTO
, pp. 195199, 1986
Sort by:
Citations
(458)
Cryptographic Protocols under Quantum Attacks
(
Citations: 1
)
Carolin Lunemann
Journal:
Computing Research Repository  CORR
, vol. abs/1102.0, 2011
Programmable Hash Functions and Their Applications
(
Citations: 1
)
Dennis Hofheinz
,
Eike Kiltz
Journal:
Journal of Cryptology  JOC
, pp. 144, 2011
Enforcing physically restricted access control for remote data
(
Citations: 1
)
Michael S. Kirkpatrick
,
Sam Kerr
Published in 2011.
FaultBased Attack on Montgomery's Ladder Algorithm
Agustin DominguezOviedo
,
M. Anwar Hasan
,
Bijan Ansari
Journal:
Journal of Cryptology  JOC
, vol. 24, no. 2, pp. 346374, 2011
Automated Proofs for Asymmetric Encryption
Judicaël Courant
,
Marion Daubignard
,
Cristian Ene
,
Pascal Lafourcade
,
Yassine Lakhnech
Journal:
Journal of Automated Reasoning  JAR
, vol. 46, no. 34, pp. 261291, 2011