Statistically-hiding commitment from any one-way function
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Zero Knowledge and Soundness Are Symmetric
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Interactive Hashing: An Information Theoretic Tool (Invited Talk)
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Probabilistic Proof Systems: A Primer
Foundations and Trends® in Theoretical Computer Science
Proceedings of the forty-first annual ACM symposium on Theory of computing
Non-malleable Statistically Hiding Commitment from Any One-Way Function
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
One-way permutations, interactive hashing and statistically hiding commitments
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Concurrent statistical zero-knowledge arguments for NP from one way functions
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Semi-honest to malicious oblivious transfer: the black-box way
TCC'08 Proceedings of the 5th conference on Theory of cryptography
A linear lower bound on the communication complexity of single-server private information retrieval
TCC'08 Proceedings of the 5th conference on Theory of cryptography
An equivalence between zero knowledge and commitments
TCC'08 Proceedings of the 5th conference on Theory of cryptography
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
General hardness amplification of predicates and puzzles
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Statistically-Hiding quantum bit commitment from approximable-preimage-size quantum one-way function
TQC'09 Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography
Hi-index | 0.00 |
We show that every language in NP has a statistical zero-knowledge argument system under the (minimal) complexity assumption that one-way functions exist. In such protocols, even a computationally unbounded verifier cannot learn anything other than the fact that the assertion being proven is true, whereas a polynomial-time prover cannot convince the verifier to accept a false assertion except with negligible probability. This resolves an open question posed by Naor, Ostrovsky, Venkatesan, and Yung (CRYPTO '92, J. Cryptology '98). Departing from previous works on this problem, we do not construct standard statistically hiding commitments from any one-way function. Instead, we construct a relaxed variant of commitment schemes called "1-out-of-2-binding commitments," recently introduced by Nguyen and Vadhan (STOC '06).