Results 21 to 30 of about 8,896,164 (281)
Zero-Knowledge Proof Systems for QMA [PDF]
SIAM Journal on Computing, 2016 Prior work has established that all problems in NP admit classical zero-knowledge proof systems, and under reasonable hardness assumptions for quantum computations, these proof systems can be made secure against quantum attacks. We prove a result representing a further quantum generalization of this fact, which is that every problem in the complexity ...
Anne Broadbent +3 more
openaire +4 more sources
Zero-Knowledge Sets With Short Proofs [PDF]
IEEE Transactions on Information Theory, 2011 Zero knowledge sets (ZKS), introduced by Micali, Rabin, and Kilian in 2003, allow a prover to commit to a secret set S in a way such that it can later prove, non interactively, statements of the form x ∈ S (or x ∉ S), without revealing any further information (on top of what explicitly revealed by the inclusion/exclusion statements above) on S, not ...
Catalano, Dario +3 more
openaire +3 more sources
Proofs, Arguments, and Zero-Knowledge
Foundations and Trends® in Privacy and Security, 2022 Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted prover to provide a guarantee that it performed a requested computation correctly. Introduced in the 1980s, IPs and arguments represented a major conceptual expansion of what constitutes a “proof” that a statement is true.
openaire +1 more source
Veritas Gateway: A Framework for Zero-Knowledge Proofs on Database Queries with a Model Context Protocol Interface [PDF]
Journal of Universal Computer ScienceVeritas Gateway is a zero-knowledge verification layer that acts as an intermediary between AI agents and diverse data stores through the Model Context Protocol (MCP).
Ziyi Xu
doaj +3 more sources
The 5 W’s of Zero-Knowledge Proof Development [PDF]
Journal of Universal Computer ScienceIn the rapidly evolving realm of blockchain technology, the pursuit of enhanced privacy, security, and scalability has propelled the exploration of cryptographic innovations.
Nadia van Niekerk +2 more
doaj +3 more sources
Computational soundness of symbolic zero-knowledge proofs [PDF]
, 2009 The abstraction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols.
Michael Backes, Dominique Unruh
core +2 more sources
Doubly adaptive zero-knowledge proofs
, 2023 In [TCC 2009 and JoC 2011] Lindell and Zarosim defined adaptive-corruption zero knowledge giving to the environment the power to perform post-execution corruption only.
Botta V., Visconti I.
core +1 more source
Zero-Knowledge Proofs for Puzzles [PDF]
, 2016 This thesis will demonstrate zero-knowledge proofs for the puzzle games Kakuro and Rush- Hour. For Kakuro we will provide a classic zero-knowledge proof similar to the zero- knowledge proof for Sudoku.
Ripsom-Gardiner, Hunter
core +1 more source
A Note on Constant-Round Zero-Knowledge Proofs of Knowledge [PDF]
, 2012 In this note, we show the existence of \emph{constant-round} computational zero-knowledge \emph{proofs of knowledge} for all $\NP$. The existence of constant-round zero-knowledge proofs was proven by Goldreich and Kahan (Journal of Cryptology, 1996), and
Yehuda Lindell
core +1 more source
Zero Knowledge Proofs and Applications to Financial Regulation
, 2019 We consider zero-knowledge proofs, a class of cryptographic protocols by which an agent (a Prover) can prove to another agent (a Verifier) that a statement is true without revealing any additional information.
Gowravaram, Nihal R.
core +4 more sources