14 search results - page 1 / 3 » An Unconditional Study of Computational Zero Knowledge |
ECCC
2006
13 years 11 months ago
2006
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...
CRYPTO
2005
Springer
14 years 4 months ago
2005
Springer
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...
EUROCRYPT
2007
Springer
14 years 5 months ago
2007
Springer
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...
TCC
2009
Springer
14 years 11 months ago
2009
Springer
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...
COCO
1991
Springer
14 years 2 months ago
1991
Springer
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 ...