|
83
|
Upper Bound on the Communication Complexity of Private Information Retrieval
– Andris Ambainis
- 1996
|
|
407
|
A randomized protocol for signing contracts
– S Even, O Goldreich, A Lempel
- 1985
|
|
258
|
How to exchange secrets by oblivious transfer
– M Rabin
- 1981
|
|
443
|
How to generate and exchange secrets
– Andrew C Yao
- 1986
|
|
187
|
Computationally private information retrieval with polylogarithmic communication
– Christian Cachin, Silvio Micali, Markus Stadler
- 1999
|
|
174
|
Oblivious transfer and polynomial evaluation
– M Naor, B Pinkas
- 1999
|
|
170
|
Replication Is Not Needed: Single Database, Computationally-Private Information Retrieval (Extended Abstract)
– Eyal Kushilevitz, Rafail Ostrovsky
- 1997
|
|
96
|
Protecting Data Privacy in Private Information Retrieval Schemes
– Yael Gertner, Yuval Ishai, Eyal Kushilevitz, Tal Malkin
|
|
574
|
A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation
– M Ben-Or, S Goldwasser, Wigderson
- 1988
|
|
350
|
How to play any mental game
– O Goldreich, S Micali, A Wigderson
- 1987
|
|
30
|
Private Information Storage
– R Ostrovsky, V Shoup
- 1997
|
|
111
|
Software Protection and Simulation on Oblivious RAMs
– Oded Goldreich, Rafail Ostrovsky
- 1993
|
|
366
|
I.: Multiparty unconditionally secure protocols
– D Chaum, C Crépeau, Damg˚ard
- 1988
|
|
331
|
Security and Composition of Multi-party Cryptographic Protocols
– Ran Canetti
- 1998
|
|
536
|
Multiparty Communication Complexity
– Danny Dolev, Tomás Feder
- 1989
|
|
149
|
Hiding instances in multi-oracle queries
– Donald Beaver, Joan Feigenbaum
- 1990
|
|
121
|
Foundations of secure interactive computing
– Donald Beaver
- 1991
|
|
198
|
Founding Cryptography on Oblivious Transfer
– J Kilian
- 1988
|
|
26
|
Improved Upper Bounds on Information-Theoretic Private Information Retrieval (Extended Abstract)
– Yuval Ishai, Eyal Kushilevitz
- 1999
|