|
80
|
Towards realizing random oracles: Hash functions that hide all partial information
– Ran Canetti
- 1997
|
|
1001
|
Probabilistic encryption
– S Goldwasser, S Micali
- 1984
|
|
1130
|
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols
– Mihir Bellare, Phillip Rogaway
- 1995
|
|
601
|
Pseudo-Random Generation from One-Way Functions
– Johan Håstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby
- 1988
|
|
544
|
How to construct random functions
– O Goldreich, S Goldwasser, S Micali
- 1986
|
|
143
|
On the (im)possibility of obfuscating programs
– Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, Ke Yang
- 2001
|
|
292
|
A hard-core predicate for all one-way functions
– Oded Goldreich, Leonid A. Levint
- 1989
|
|
284
|
Universal One-Way Hash Functions and their Cryptographic Applications
– Moni Naor, Moti Yung
- 1989
|
|
296
|
A Concrete Security Treatment of Symmetric Encryption
– M. Bellare, A. Desai, E. Jokipii, P. Rogaway
- 1997
|
|
14
|
Entropic security and the encryption of high entropy messages
– Yevgeniy Dodis
- 2005
|
|
30
|
On Obfuscating Point Functions
– Hoeteck Wee
- 2005
|
|
711
|
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
– Shafi Goldwasser, Silvio Micali, Ronald L. Rivest
- 1995
|
|
68
|
A Uniform-Complexity Treatment of Encryption and Zero-Knowledge
– Oded Goldreich
- 1993
|
|
13
|
Zero-Knowledge and Code Obfuscation
– S Hada
- 2000
|
|
99
|
Definitions And Properties Of Zero-Knowledge Proof Systems
– Oded Goldreich, Yair Oren
- 1994
|
|
244
|
How to construct pseudorandom permutations from pseudorandom functions
– M Luby, C Rackoff
- 1988
|
|
168
|
On the Composition of Zero-Knowledge Proof Systems
– Oded Goldreich, Hugo Krawczyk
- 1990
|
|
410
|
Non-Malleable Cryptography
– Danny Dolev, Cynthia Dwork, Moni Naor
- 2000
|
|
147
|
Foundations of Cryptography
– O Goldreich
- 2001
|
