Abstract. This work describes distributed protocols for oblivious transfer, in which the role of the sender is divided between several servers, and a chooser (receiver) must contact a threshold of these servers in order to run the oblivious transfer protocol. These distributed oblivious transfer protocols provide information theoretic security, and do not require the parties to compute exponentiations or any other kind of public key operations. Consequently, the protocols are very ecient computationally. 1
|
2005
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
341
|
A simple protocol for signing contracts
– Goldreich
|
|
225
|
Private information retrieval
– Chor, Goldreich, et al.
- 1998
|
|
140
|
Oblivious transfer and polynomial evaluation
– Noar, Pinkas
- 1999
|
|
117
|
Privacy preserving auctions and mechanism design
– Naor, Pinkas, et al.
- 1999
|
|
112
|
Foundations of Secure Interactive Computing
– Beaver
|
|
85
|
Secure multi-party computation, working draft, version 1.3
– Goldreich
- 2001
|
|
83
|
Achieving oblivious transfer using weakened security assumptions
– Cr'epeau, Kilian
- 1988
|
|
82
|
Non-interactive oblivious transfer and applications
– Bellare, Micali
- 1990
|
|
69
|
All-or-nothing disclosure of secrets
– Brassard, Crépeau, et al.
- 1987
|
|
44
|
A random server model for private information retrieval
– Gertner, Goldwasser, et al.
- 1998
|
|
34
|
Locally random reductions: improvements and applications
– Beaver, Feigenbaum, et al.
- 1997
|
|
34
|
Uses of Randomness in Algorithms and Protocols
– Kilian
- 1990
|
|
33
|
Transfer and Intersecting Codes
– Brassard, Cr'epeau, et al.
- 1997
|
|
30
|
Equivalence between two flavors of oblivious transfer
– Cr'epeau
- 1988
|
|
28
|
Access control and signatures via quorum secret sharing
– Naor, Wool
- 1996
|
|
25
|
How to Solve Any Protocol problem - an Efficiency Improvement
– Goldreich, Vainish
- 1988
|
|
17
|
Efficient Oblivious Transfer
– Naor, Pinkas
- 2001
|
|
16
|
On the Foundations of Oblivious Transfer
– Cachin
- 1998
|
|
10
|
Equivalence between two of oblivious transfers
– Crepeau
- 1988
|
|
7
|
How to Solve Any Protocol problem - an Eciency Improvement
– Goldreich, Vainish
- 1988
|
|
3
|
Information Theoretic Reduction Among
– Brassard, Crepeau, et al.
- 1986
|
|
1
|
Commodity-Based Cryptography", STOC
– Beaver
- 1997
|
|
1
|
Commodity-Based Cryptography”, STOC
– Beaver
- 1997
|
|
1
|
Crépeau and J.-M. Robert Information Theoretic Reduction Among
– Brassard, C
- 1986
|
|
1
|
All-or-Nothing Disclosure of Secrets, Advances in Cryptology - Crypto ’86, LNCS 263
– Brassard, Crépeau, et al.
- 1987
|
|
1
|
Distributed Oblivious Transfer 217
– Brassard, Crépeau, et al.
- 1996
|
