Sciweavers

Share
TCC
2010
Springer
141views Cryptology» more  TCC 2010»
9 years 3 months ago
Composition of Zero-Knowledge Proofs with Efficient Provers
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)...
Eleanor Birrell, Salil P. Vadhan
CCS
2008
ACM
9 years 7 months ago
Type-checking zero-knowledge
This paper presents the first type system for statically analyzing security protocols that are based on zero-knowledge proofs. We show how several properties offered by zero-knowl...
Michael Backes, Catalin Hritcu, Matteo Maffei
ASIACRYPT
2007
Springer
9 years 10 months ago
A Non-interactive Shuffle with Pairing Based Verifiability
A shuffle is a permutation and re-encryption of a set of ciphertexts. Shuffles are for instance used in mix-nets for anonymous broadcast and voting. One way to make a shuffle verif...
Jens Groth, Steve Lu
STOC
1990
ACM
93views Algorithms» more  STOC 1990»
9 years 10 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
EUROCRYPT
1999
Springer
9 years 10 months ago
On the Concurrent Composition of Zero-Knowledge Proofs
We examine the concurrent composition of zero-knowledge proofs. By concurrent composition, we indicate a single prover that is involved in multiple, simultaneous zero-knowledge pro...
Ransom Richardson, Joe Kilian
PKC
2009
Springer
129views Cryptology» more  PKC 2009»
9 years 10 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
FOCS
2002
IEEE
9 years 11 months ago
Zero-Knowledge
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
Oded Goldreich
PODC
2003
ACM
9 years 11 months ago
Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures
Applications such as e-commerce payment protocols, electronic contract signing, and certified e-mail delivery require that fair exchange be assured. A fair-exchange protocol allo...
Jung Min Park, Edwin K. P. Chong, Howard Jay Siege...
FOCS
2003
IEEE
9 years 11 months ago
Lower Bounds for Non-Black-Box Zero Knowledge
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
Boaz Barak, Yehuda Lindell, Salil P. Vadhan
TCC
2004
Springer
835views Cryptology» more  TCC 2004»
9 years 11 months ago
On the Possibility of One-Message Weak Zero-Knowledge
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 ...
Boaz Barak, Rafael Pass
books