2576 search results - page 8 / 516 » The Complexity of Zero Knowledge |
147
click to vote
TCC
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We investigate whether it is possible to obtain any meaningful type of zero-knowledge proofs using a one-message (i.e., noninteractive) proof system. We show that, under ...
EUROCRYPT
2008
Springer
15 years 1 months ago
2008
Springer
Precise zero knowledge introduced by Micali and Pass (STOC'06) guarantees that the view of any verifier V can be simulated in time closely related to the actual (as opposed t...
ECCC
2000
14 years 11 months ago
2000
Abstract. We present the first complete problem for SZK, the class of promise problems possessing statistical zero-knowledge proofs (against an honest verifier). The problem, calle...
116
click to vote
STOC
1998
ACM
15 years 4 months ago
1998
ACM
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open ...
110
Voted
STOC
2003
ACM
16 years 1 days ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...