Results 251 to 260 of about 9,266,244 (284)

Zero-knowledge proofs of identity

Journal of Cryptology, 1987
In this paper we extend the notion of interactive proofs of assertions to interactive proofs of knowledge. This leads to the definition of unrestricted input zero-knowledge proofs of knowledge in which the prover demonstrates possession of knowledge without revealing any computational information whatsover (not even the one bit revealed in zero ...
Uriel Feige, Amos Fiat, Adi Shamir
openaire   +3 more sources

Zero-Knowledge and Code Obfuscation [PDF]

Lecture Notes in Computer Science, 2000
In this paper, we investigate the gap between auxiliary-input zero-knowledge (AIZK) and blackbox-simulation zero-knowledge (BSZK). It is an interesting open problem whether or not there exists a protocol which achieves AIZK, but not BSZK. We show that the existence of such a protocol is closely related to the existence of secure code obfuscators.
exaly   +3 more sources

Updatable Zero-Knowledge Databases [PDF]

Lecture Notes in Computer Science, 2005
Micali, Rabin, and Kilian [9] recently introduced zero- knowledge sets and databases, in which a prover sets up a database by publishing a commitment, and then gives proofs about particular values. While an elegant and useful primitive, zero-knowledge databases do not offer any good way to perform updates.
Moses Liskov
exaly   +2 more sources

Zero-Knowledge

2006
-
openaire   +2 more sources

The Complexity of Perfect Zero-Knowledge

Proceeding Structure in Complexity Theory, 1987
A Perfect Zero-Knowledge interactive proof system convinces a verifier that a string is in a language without revealing any additional knowledge in an information-theoretic sense. We show that for any language that has a perfect zero-knowledge proof system, its complement has a short interactive protocol.
openaire   +3 more sources

The Complexity of Zero Knowledge

2007
We give an informal introduction to zero-knowledge proofs, and survey their role both in the interface between complexity theory and cryptography and as objects of complexity-theoretic study in their own right.
openaire   +2 more sources

Games with Zero-knowledge Signaling

Studia Logica, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Zero knowledge with efficient provers

Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, 2006
We prove that every problem in NP that has a zero-knowledge proof also has a zero-knowledge proof where the prover can be implemented in probabilistic polynomial time given an NP witness. Moreover, if the original proof system is statistical zero knowledge, so is the resulting efficient-prover proof system.
Minh-Huyen Nguyen, Salil P. Vadhan
openaire   +2 more sources

Cluster Computing in Zero Knowledge

2015
Large computations, when amenable to distributed parallel execution, are often executed on computer clusters, for scalability and cost reasons. Such computations are used in many applications, including, to name but a few, machine learning, webgraph mining, and statistical machine translation.
Alessandro Chiesa, Eran Tromer, Madars Virza   +2 more
openaire   +3 more sources

Zero-Knowledge in EasyCrypt

2023 IEEE 36th Computer Security Foundations Symposium (CSF), 2023
Denis Firsov, Dominique Unruh
openaire   +2 more sources