Skip to search formSkip to main contentSkip to account menu

Zero-knowledge proof

Known as: Zero knowledge proof, Zero knowledge proofs, Zero-knowledge protocol 
In cryptography, a zero-knowledge proof or zero-knowledge protocol is a method by which one party (the prover) can prove to another party (the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Alice and BobAnonymous veto networkAuthenticationBlind signature

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2014
Review
2014
Foundations of Security Analysis and Design VII
With testing, a system is executed with a set of selected stimuli, and observed to determine whether its behavior conforms to the… 
Highly Cited
2013
Highly Cited
2013
Homing spread: Community home-based multi-copy routing in mobile social networks
A mobile social network (MSN) is a special delay tolerant network (DTN) composed of mobile nodes with social characteristics… 
Review
2008
Review
2008
The Contrast‐sensitivity of Knowledge Ascriptions
Knowledge ascriptions are contrast‐sensitive. One natural explanation for this is that the knowledge relation is contrastive (s… 
2008
2008
Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers
The abstraction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported… 
Highly Cited
2004
Highly Cited
2004
Secure implementation of identification systems
In this paper we demonstrate that widely known identification systems, such as the public-file-based Feige-Fiat-Shamir scheme… 
Highly Cited
2004
Highly Cited
2004
Control and performance evaluation of a clutch servo system with hydraulic actuation
Highly Cited
2002
Highly Cited
2002
Technology Adoption, Human Capital, and Growth Theory
The paper explores a model in which growth is determined by a combination of human capital and technology adoption. At the heart… 
Highly Cited
1991
Highly Cited
1991
Fully parallelized multi prover protocols for NEXP-time
A major open problem in the theory of multiprover protocols is to characterize the languages which can be accepted by fully… 
1990
1990
How to Utilize the Randomness of Zero-Knowledge Proofs
In zero-knowledge interactive proofs, a lot of randomized information is exchanged between the prover and the verifier, and the… 
Highly Cited
1984
Highly Cited
1984
A study of the "value" systems of behavioral scientists.
This article reports the results of an investigation of the "value" systems of two groups of psychologists: (a) a behavioral… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)