16 search results - page 2 / 4 » Perfect Zero-Knowledge in Constant Rounds |
95
Voted
EUROCRYPT
2001
Springer
15 years 4 months ago
2001
Springer
In STOC 2000, Canetti, Goldreich, Goldwasser, and Micali put forward the strongest notion of zero-knowledge to date, resettable zero-knowledge (RZK) and implemented it in constant ...
ASIACRYPT
2010
Springer
14 years 9 months ago
2010
Springer
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
105
click to vote
ASIACRYPT
2010
Springer
14 years 9 months ago
2010
Springer
We design cryptographic protocols that recognize best case (optimistic) situations and exploit them. As a case study, we present a new concurrent zeroknowledge protocol that is exp...
108
Voted
CORR
2006
Springer
14 years 11 months ago
2006
Springer
In this paper we resolve an open problem regarding resettable zero knowledge in the bare public-key (BPK for short) model: Does there exist constant round resettable zero knowledg...
CRYPTO
2001
Springer
15 years 4 months ago
2001
Springer
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...