Sciweavers

Share
4 search results - page 1 / 1
» Unconditional Characterizations of Non-interactive Zero-Know...
Sort
View
CRYPTO
2005
Springer
72views Cryptology» more  CRYPTO 2005»
11 years 7 months ago
Unconditional Characterizations of Non-interactive Zero-Knowledge
Abstract. Non-interactive zero-knowledge (NIZK) proofs have been investigated in two models: the Public Parameter model and the Secret Parameter model. In the former, a public stri...
Rafael Pass, Abhi Shelat
ECCC
2006
96views more  ECCC 2006»
11 years 1 months ago
An Unconditional Study of Computational Zero Knowledge
We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs. Our results are unconditional, in contrast to most previous...
Salil P. Vadhan
STOC
2006
ACM
115views Algorithms» more  STOC 2006»
12 years 1 months ago
Zero knowledge with efficient provers
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 ...
Minh-Huyen Nguyen, Salil P. Vadhan
EUROCRYPT
2007
Springer
11 years 7 months ago
Zero Knowledge and Soundness Are Symmetric
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...
Shien Jin Ong, Salil P. Vadhan
books