|
893
|
The knowledge complexity of interactive proof systems
– Shafi Goldwasser, Silvio Micali, Charles Rackoff
- 1989
|
|
601
|
Pseudo-Random Generation from One-Way Functions
– Johan Håstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby
- 1988
|
|
168
|
On the Composition of Zero-Knowledge Proof Systems
– Oded Goldreich, Hugo Krawczyk
- 1990
|
|
80
|
The Complexity of Perfect Zero-Knowledge
– Lance Fortnow
- 1987
|
|
1001
|
Probabilistic encryption
– S Goldwasser, S Micali
- 1984
|
|
268
|
Algebraic Methods for Interactive Proof Systems
– Carsten Lund, Lance Fortnow, Howard Karloff, Noam Nisan
- 1990
|
|
79
|
The knowledge complexity of interactive proofs
– Shafi Goldwasser, Silvio Micali, Charles Rackoff
- 1989
|
|
327
|
Proofs that Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems
– Silvio Micali
- 1991
|
|
99
|
Definitions And Properties Of Zero-Knowledge Proof Systems
– Oded Goldreich, Yair Oren
- 1994
|
|
38
|
Direct minimum-knowledge computations
– Russell Impagliazzo, Moti Yung
- 1988
|
|
30
|
On the Cunning Power of Cheating Verifiers: Some Observations about ZeroKnowledge Proofs
– Y Oren
- 1987
|
|
49
|
Pseudorandom Generation under Uniform Assumptions
– J H˚astad
- 1990
|
|
150
|
Witness indistinguishable and witness hiding protocols
– Uriel Feige, Adi Shamir
- 1990
|
|
533
|
How to generate cryptographically strong sequences of pseudorandom bits
– M Blum, S Micali
- 1984
|
|
453
|
Theory and applications of trapdoor functions
– A C Yao
- 1982
|
|
27
|
One-Way Functions are Essential for Complexity-Based Cryptography
– R Impagliazzo, M Luby
- 1989
|
|
41
|
Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)
– Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung
- 1998
|
|
72
|
Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information
– M Tompa, H Woll
- 1987
|
|
264
|
Minimum Disclosure Proofs of Knowledge
– G Brassard, D Chaum, C Crépeau
- 1988
|
