|
34
|
Zaps and Their Applications
– Cynthia Dwork, Moni Naor
- 2000
|
|
62
|
Resettable Zero-Knowledge
– Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali
- 1999
|
|
140
|
Concurrent Zero-Knowledge
– Cynthia Dwork , Moni Naor, Amit Sahai
- 1999
|
|
893
|
The knowledge complexity of interactive proof systems
– Shafi Goldwasser, Silvio Micali, Charles Rackoff
- 1989
|
|
104
|
Non-Interactive Zero-Knowledge and its Applications
– M Blum, P Feldman, S Micali
- 1988
|
|
143
|
Multiple non-interactive zero knowledge proofs based on a single random string
– U Feige, D Lapidot, A Shamir
- 1990
|
|
29
|
Simulation in quasi-polynomial time, and its application to protocol composition
– Rafael Pass
- 2003
|
|
215
|
Foundations of Cryptography — Basic Tools
– Oded Goldreich
- 2001
|
|
264
|
Minimum Disclosure Proofs of Knowledge
– G Brassard, D Chaum, C Crépeau
- 1988
|
|
13
|
Derandomization in Cryptography
– Boaz Barak, Salil Vadhan, Shien Jin Ong
- 2005
|
|
25
|
Lower bounds for non-black-box zero knowledge
– Boaz Barak, Yehuda Lindell, Salil Vadhan
- 2003
|
|
292
|
A hard-core predicate for all one-way functions
– Oded Goldreich, Leonid A. Levint
- 1989
|
|
99
|
Definitions And Properties Of Zero-Knowledge Proof Systems
– Oded Goldreich, Yair Oren
- 1994
|
|
1001
|
Probabilistic encryption
– S Goldwasser, S Micali
- 1984
|
|
25
|
An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions
– Joe Kilian, Erez Petrank
- 1995
|
|
98
|
On the Concurrent Composition of Zero-Knowledge Proofs
– Ransom Richardson, Joe Kilian
- 1999
|
|
39
|
Concurrent and Resettable Zero-Knowledge in Poly-logarithmic Rounds (Extended Abstract)
– Joe Kilian, Erez Petrank
- 2001
|
|
127
|
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
– Amit Sahai
- 1999
|
|
71
|
Black-Box Concurrent Zero-Knowledge Requires (almost) Logarithmically Many Rounds
– Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
- 2002
|
