224 search results - page 5 / 45 » Isolated Proofs of Knowledge and Isolated Zero Knowledge |
USS
2010
13 years 5 months ago
2010
In recent years, many advances have been made in cryptography, as well as in the performance of communication networks and processors. As a result, many advanced cryptographic pro...
ECCC
2007
13 years 7 months ago
2007
We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then ¯L ∈ MA. Assuming the polynomial hierarch...
COCO
1991
Springer
13 years 11 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 ...
TCC
2010
Springer
13 years 5 months ago
2010
Springer
We revisit the composability of different forms of zero-knowledge proofs when the honest prover strategy is restricted to be polynomial time (given an appropriate auxiliary input)...
TCC
2010
Springer
14 years 4 months ago
2010
Springer
We present a variant of Regev’s cryptosystem first presented in [Reg05], but with a new choice of parameters. By a recent classical reduction by Peikert we prove the scheme sema...