Abstract
We prove the first general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length l should be invoked so as to obtain, by an information-theoretically secure reduction, a 1-out-of-N Oblivious Transfer of strings of length L. Our bound is tight in many significant cases.
We also prove the first non-trivial lower bound for the number of random bits needed to implement such a reduction whenever the receiver sends no messages to the sender. This bound is also tight in many significant cases.
Chapter PDF
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
M. Bellare, S. Micali. Non-interactive Oblivious Transfer and Applications. In Advances in Cryptology: Proceedings of Crypto’ 90, pp. 547–559, Springer-Verlag, 1990.
M. Blum. How to Exchange (Secret) Keys. In ACM Transactions of Computer Systems, vol. 1, No. 2, pp. 175–193, May 1983.
G. Brassard, C. Crépeau. Oblivious Transfers and Privacy Amplification. In Advances in Cryptology: Proceedings of Eurocrypt’ 97, Springer-Verlag, pp. 334–347, 1997.
G. Brassard, C. Crépeau, J. Robert. Information theoretic reductions among disclosure problems. In 27th Symp. of Found. of Computer Sci., pp. 168–173, IEEE, 1986.
G. Brassard, C. Crépeau, M. Sántha. Oblivious Transfers and Intersecting Codes. In IEEE Transaction on Information Theory, special issue in coding and complexity, Volume 42, Number 6, pp. 1769–1780, 1996.
C. Crépeau. Equivalence between two flavors of oblivious transfers. In Advances in Cryptology: Proceedings of Crypto’ 87, volume 293 of Lecture Notes in Computer Science, pp. 350–354, Springer-Verlag, 1988.
C. Crépeau. A zero-knowledge poker protocol that achieves confidentiality of the players’ strategy or how to achieve an electronic poker face. In Advances in Cryptology: Proceedings of Crypto’ 86, pp. 239–247. Springer-Verlag, 1987.
C. Crépeau, J. Kilian. Weakening security assumptions and oblivious transfer. In Advances in Cryptology: Proceedings of Crypto’ 88, volume 403 of Lecture Notes in Computer Science, pp. 2–7, Springer-Verlag, 1990.
S. Even, O. Goldreich, A. Lempel. A Randomized Protocol for Signing Contracts. In Advances of Cryptology: Proceedings of Crypto’ 83, Plenum Press, New York, pp. 205–210, 1983.
M. Fisher, S. Micali, C. Rackoff. A Secure Protocol for the Oblivious Transfer. In Journal of Cryptology, vol. 9, No. 3 pp. 191–195, 1996.
O. Goldreich, S. Micali, A. Wigderson. How to play any mental game, or: A completeness theorem for protocols with honest majority. In Proceedings of 19th Annual Symp. on Theory of Computing, 218–229, 1987.
S. Goldwasser, S. Micali, C. Rackoff. The knowledge complexity of interactive proof-systems. In SIAM Journal on Computing, 18:186–208, 1989.
J. Kilian. Founding Cryptography on Oblivious Transfer. In Proceedings of 20th Annual Symp. on Theory of Computing, pp. 20–31, 1988.
J. Kilian, S. Micali, R. Ostrovsky. Minimum Resource Zero-Knowledge Proofs. In Proceedings of 30th Annual Symp. on Foundations of Computer Science, pp. 474–479, 1989.
S. Micali, P. Rogaway. Secure Computation. In Advances in Cryptology: Crypto’ 91 Proceedings, pp. 392–404, Springer-Verlag, 1992.
H. Nurmi, A. Salomaa, L. Santean. Secret ballot elections in computer networks. In Computer and Security, volume 10, No. 6, pp. 553–560, 1991.
M. Rabin. How to Exchange Secrets by Oblivious Transfer. In Technical Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dodis, Y., Micali, S. (1999). Lower Bounds for Oblivious Transfer Reductions. In: Stern, J. (eds) Advances in Cryptology — EUROCRYPT ’99. EUROCRYPT 1999. Lecture Notes in Computer Science, vol 1592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48910-X_4
Download citation
DOI: https://doi.org/10.1007/3-540-48910-X_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65889-4
Online ISBN: 978-3-540-48910-8
eBook Packages: Springer Book Archive