Results 231 to 240 of about 514,807 (258)

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   +1 more source

Subversion-Zero-Knowledge SNARKs

2018
Subversion 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

Concurrent zero-knowledge with timing, revisited

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02, 2002
Following 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

Zero-Knowledge in EasyCrypt

2023 IEEE 36th Computer Security Foundations Symposium (CSF), 2023
Denis Firsov, Dominique Unruh
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   +2 more sources

Zero Knowledge LTCs and Their Applications

2013
Locally 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, Amit Sahai, Michael Viderman, Mor Weiss   +3 more
openaire   +1 more source

Frontiers in zero knowledge.

2000
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000. ; Includes bibliographical references (p. 133-140). ; by Amit Sahai. ; Ph.D.
openaire   +1 more source

A Survey on Zero-Knowledge Authentication for Internet of Things

Electronics (Switzerland), 2023
Zhigang Chen, Xia Song
exaly  

Zero-knowledge Proofs

XRDS: Crossroads, The ACM Magazine for Students, 2013
openaire   +1 more source

IoT security system with modified Zero Knowledge Proof algorithm for authentication

Egyptian Informatics Journal, 2021
Benfano Soewito
exaly