Sciweavers

14 search results - page 1 / 3
» An Unconditional Study of Computational Zero Knowledge
Sort
View
ECCC
2006
96views more  ECCC 2006»
13 years 3 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
CRYPTO
2005
Springer
72views Cryptology» more  CRYPTO 2005»
13 years 9 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
EUROCRYPT
2007
Springer
13 years 9 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
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 4 months ago
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
Yehuda Lindell, Hila Zarosim
COCO
1991
Springer
130views Algorithms» more  COCO 1991»
13 years 7 months ago
One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs
Abstract Rafail Ostrovskyy MIT Laboratory for Computer Science 545 Technology Square, Cambridge, MA 02139 In this paper, we study connections among one-way functions, hard on the ...
Rafail Ostrovsky