Live briefing
Everything about Zero-knowledge proof
Proving validity without revealing other data
In cryptography, a zero-knowledge proof is a protocol in which one party can convince another party that some given statement is true, without conveying to the verifier any information beyond the mere fact of that statement's truth. The intuition behind the nontriviality of zero-knowledge proofs is that it is trivial to prove possession of the relevant information simply by revealing it; the hard part is to prove this possession without revealing this information. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Zero-knowledge proofA 5-minute orientation
- Skim a recent paper: Improvements on Non-Interactive Zero-Knowledge Proof Systems Related to Quadratic Residuosity LanguagesInfluential work since 2022
- Pick up a classic book: The Conspirators HierarchyThe most-reprinted book on the subject
- Read the landmark paper: Preserving Privacy in Mobile Health Systems Using Non-Interactive Zero-Knowledge Proof and BlockchainCited 79 times
- Go sideways: Fiat–Shamir heuristicA closely related topic
- Go sideways: Non-interactive zero-knowledge proofA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Preserving Privacy in Mobile Health Systems Using Non-Interactive Zero-Knowledge Proof and Blockchain
Privacy preserving authentication system based on non-interactive zero knowledge proof suitable for Internet of Things
Enhancing Unmanned Aerial Vehicle Security: A Zero-Knowledge Proof Approach with Zero-Knowledge Succinct Non-Interactive Arguments of Knowledge for Authentication and Location Proof
DPS-IIoT: Non-interactive zero-knowledge proof-inspired access control towards information-centric Industrial Internet of Things
Toward Non-interactive Zero-Knowledge Proofs for NP from LWE
PoneglyphDB: Efficient Non-interactive Zero-Knowledge Proofs for Arbitrary SQL-Query Verification
The electronic cash system based on non-interactive zero-knowledge proofs
An efficient quantum non-interactive zero knowledge proof for confidential transaction and quantum range proof
🆕 Influential since 2022
Improvements on Non-Interactive Zero-Knowledge Proof Systems Related to Quadratic Residuosity Languages
Research on security access authentication mechanism of intelligent sensor based on non-interactive zero-knowledge proof method
Efficient non-interactive zero-knowledge proofs for quantum range verification in blockchain
Confidential Transaction Balance Verification by the Net Using Non-Interactive Zero-Knowledge Proofs
zkMaP: Zero-Knowledge Succinct Non-Interactive Matrix Multiplication Proofs
đź“š Books worth reading
The Conspirators HierarchyJohn Coleman · 1992
Information and Communications SecurityTat Wing Chim · 2012
Public-Key Cryptography – PKC 2013Kaoru Kurosawa · 2013
Mathematical Proof of the Existence of GodIamwe · 2014
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Fiat–Shamir heuristic In cryptography, the Fiat–Shamir heuristic, or Fiat–Shamir transformation, is a technique for taking an interactive proof of knowledge and creating a digital…
- Non-interactive zero-knowledge proof Non-interactive zero-knowledge proofs are cryptographic primitives, where information between a prover and a verifier can be authenticated by the prover…
- Feige–Fiat–Shamir identification scheme In cryptography, the Feige–Fiat–Shamir identification scheme is a type of parallel zero-knowledge proof developed by Uriel Feige, Amos Fiat, and Adi Shamir…
- Commitment scheme A commitment scheme is a cryptographic primitive that allows one to commit to a chosen value (or chosen statement) while keeping it hidden to others, with…
- Proof of knowledge In cryptography, a proof of knowledge is an interactive proof in which the prover succeeds in 'convincing' a verifier that the prover knows something.…
- Verifiable random function In cryptography, a verifiable random function (VRF) is a public-key pseudorandom function that provides proofs that its outputs were calculated correctly…
- Undeniable signature An undeniable signature is a digital signature scheme which allows the signer to be selective to whom they allow to verify signatures. The scheme adds…
- Silvio Micali Silvio Micali (born October 13, 1954) is an Italian computer scientist, professor at the Massachusetts Institute of Technology and the founder of Algorand…