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.
2010
2010
Constant-Round Zero-Knowledge Proofs of Knowledge
In this note, we show the existence of constant-round computational zero-knowledge proofs of knowledge for all N P. The existence… 
Highly Cited
2007
Highly Cited
2007
Universally composable zero-knowledge arguments and commitments from signature cards
htmlabstractIn the Universal Composability framework many cryptographic tasks cannot be built from scratch. Additional \helping… 
Highly Cited
2006
Highly Cited
2006
“Bamboozled by Our Own Words”: Semantic Blindness and Some Arguments Against Contextualism*
The best grounds for accepting contextualism concerning knowledge attributions are to be found in how knowledge-attributing (and… 
Highly Cited
2006
Highly Cited
2006
Network System Challenges in Selective Sharing and Verification for Personal, Social, and Urban-Scale Sensing Applications
Author(s): Srivastava, Mani B; Burke, Jeffrey A; Hansen, Mark; Parker, Andrew; Reddy, Sasank; Schmid, Thomas; Chang, Kevin… 
Review
2004
Review
2004
Toward Identifying Pedagogical Knowledge for Mentoring in Primary Science Teaching
Final year preservice teachers' perceptions of their mentoring in primary science teaching were gathered through surveys from… 
2003
2003
Guiding knowledge discovery through interactive data mining
Knowledge discovery is the process of eliciting interesting knowledge from data repositories. Due to the inability of computers… 
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… 
1993
1993
On the communication complexity of zero-knowledge proofs
The fact that there are zero-knowledge proofs for all languages in NP (see [15], [6], and [5]) has, potentially, enormous… 
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… 
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)