Sciweavers

62 search results - page 2 / 13
» Zero-Knowledge Sets with Short Proofs
Sort
View
PKC
2009
Springer
129views Cryptology» more  PKC 2009»
14 years 3 months ago
Zero-Knowledge Proofs with Witness Elimination
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
Aggelos Kiayias, Hong-Sheng Zhou
EUROCRYPT
2008
Springer
14 years 15 days ago
Isolated Proofs of Knowledge and Isolated Zero Knowledge
We introduce a new notion called -isolated proofs of knowledge ( -IPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to bits of communication wi...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 11 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
SCN
2004
Springer
14 years 4 months ago
Identity-Based Zero Knowledge
Abstract. We introduce and define the notion of identity-based zeroknowledge, concentrating on the non-interactive setting. In this setting, our notion allows any prover to widely...
Jonathan Katz, Rafail Ostrovsky, Michael O. Rabin
STOC
1990
ACM
93views Algorithms» more  STOC 1990»
14 years 2 months ago
Perfect Zero-Knowledge in Constant Rounds
Quadratic residuosity and graph isomorphism are classic problems and the canonical examples of zero-knowledge languages. However, despite much research e ort, all previous zerokno...
Mihir Bellare, Silvio Micali, Rafail Ostrovsky