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 efficient computationally.
Part of this work was done while visiting Stanford University and IBM Almaden Research Center. Partly supported by DOD Muri grant administered by ONR and DARPA contract F30602-99-1-0530. Most of this work was done while the author was at the Weizmann Institute of Science and the Hebrew University of Jerusalem, and was supported by an Eshkol grant of the Israeli Ministry of Science.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aho A., Hopcroft J. and Ullman J., The design and analysis of computer algorithms, Addison-Wesley, 1974.
D. Beaver, Foundation of Secure Interactive Computation, Advances in Cryptology-Crypto’ 91, pp. 377–391, 1991.
D. Beaver, “Commodity-Based Cryptography”, STOC 1997, pp. 446–455.
D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. “Locally Random Reductions: Improvements and Applications”, Journal of Cryptology 10(1): 17–36 (1997).
M. Bellare and S. Micali, Non-interactive oblivious transfer and applications, Advances in Cryptology-Crypto’ 89, pp. 547–557, 1990.
G. Brassard, C. Crépeau and J.-M. Robert Information Theoretic Reduction Among Disclosure Problems, 27th FOCS, pp. 168–173, 1986.
G. Brassard, C. Crépeau and J.-M. Robert, All-or-Nothing Disclosure of Secrets, Advances in Cryptology-Crypto’ 86, LNCS 263, Springer, pp. 234–238, 1987.
G. Brassard, C. Crépeau and M. Santha, Oblivious Transfer and Intersecting Codes, IEEE Trans. on Inform. Theory, Vol. 42(6), pp. 1769–1780, 1996.
C. Cachin, On the foundations of oblivious transfer, Advances in Cryptology-Eurocrypt’ 98, LNCS 1403, pp. 361–374. Springer, 1998.
B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan, Private Information Retrieval, J. of ACM 45(6), 1998, pp. 965–981.
C. Crépeau, Equivalence between two flavors of oblivious transfers, Advances in Cryptology-Crypto’ 87, LNCS 293, pp. 350–354, 1988.
C. Crépeau and J. Kilian, Achieving oblivious transfer using weakened security assumptions, FOCS’ 88, pp. 42–52, 1988.
S. Even, O. Goldreich and A. Lempel, A Randomized Protocol for Signing Contracts, Communications of the ACM 28, pp. 637–647, 1985.
Y. Gertner, S. Goldwasser, T. Malkin, A Random Server Model for Private Information Retrieval or How to Achieve Information Theoretic PIR Avoiding Database Replication,. RANDOM 1998, LNCS 1518, Springer, pp. 200–217.
Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin, Protecting Data Privacy in Private Information Retrieval Schemes, Proc. 30th STOC 1998, pp. 151–160.
O. Goldreich, Secure Multi-Party Computation (working draft) Version 1.1, 1998.
O. Goldreich and R. Vainish, How to Solve any Protocol Problem-An Efficiency Improvement, Advances in Cryptology-Crypto’ 87, LNCS 293, 1988, pp. 73–86.
R. Impagliazzo and S. Rudich, Limits on the Provable Consequences of One-Way Permutations, STOC’ 89, pp. 44–61, 1989.
J. Kilian, Use of Randomness in Algorithms and Protocols, MIT Press, Cambridge, Massachusetts, 1990.
M. Naor and B. Pinkas, Oblivious Transfer and Polynomial Evaluation, Proc. of the 31st ACM Symp. on Theory of Computer Science, 1999, pp. 245–254.
M. Naor, B. Pinkas and R. Sumner, Privacy Preserving Auctions and Mechanism Design, Proc. of the 1st ACM conf. on Electronic Commerce, November 1999, pp. 129–139.
M. Naor and A. Wool, Access Control and Signatures via Quorum Secret Sharing, IEEE Transactions on Parallel and Distributed Systems 9(9), 1998, pp. 909–922.
M. O. Rabin, How to exchange secrets by oblivious transfer, Tech. Memo TR-81, Aiken Computation Laboratory, 1981.
R. Rivest, Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a Trusted Initializer, manuscript. Available: http://theory.lcs.mit.edu/~rivest/publications.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Naor, M., Pinkas, B. (2000). Distributed Oblivious Transfer. In: Okamoto, T. (eds) Advances in Cryptology — ASIACRYPT 2000. ASIACRYPT 2000. Lecture Notes in Computer Science, vol 1976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44448-3_16
Download citation
DOI: https://doi.org/10.1007/3-540-44448-3_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41404-9
Online ISBN: 978-3-540-44448-0
eBook Packages: Springer Book Archive