Results 231 to 240 of about 5,067,422 (261)
Some of the next articles are maybe not open access.
The Complexity of Perfect Zero-Knowledge
Proceeding Structure in Complexity Theory, 1987A 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 +2 more sources
Games with Zero-knowledge Signaling
Studia Logica, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The Complexity of Zero Knowledge
2007We 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 +1 more source
Subversion-Zero-Knowledge SNARKs
2018Subversion zero knowledge for non-interactive proof systems demands that zero knowledge (ZK) be maintained even when the common reference string (CRS) is chosen maliciously. SNARKs are proof systems with succinct proofs, which are at the core of the cryptocurrency Zcash, whose anonymity relies on ZK-SNARKs; they are also used for ZK contingent payments
openaire +3 more sources
Zero knowledge with efficient provers
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, 2006We 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 +1 more source
2023 IEEE 36th Computer Security Foundations Symposium (CSF), 2023
Denis Firsov, Dominique Unruh
openaire +2 more sources
Denis Firsov, Dominique Unruh
openaire +2 more sources
Concurrent zero-knowledge with timing, revisited
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02, 2002Following Dwork, Naor, and Sahai (30th STOC, 1998), we consider concurrent execution of protocols in a semi-synchronized network. Specifically, we assume that each party holds a local clock such that a constant bound on the relative rates of these clocks is a-priori known, and consider protocols that employ time-driven operations (i.e., time-out in ...
openaire +3 more sources
Cluster Computing in Zero Knowledge
2015Large 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 +2 more
openaire +2 more sources
Zero Knowledge LTCs and Their Applications
2013Locally testable codes (LTCs) are error-correcting codes for which membership in the code can be tested by probing few symbols of a purported codeword. Motivated by applications in cryptography, we initiate the study of zero knowledge locally testable codes (ZK-LTCs).
Yuval Ishai +3 more
openaire +1 more source