Abstract
We show how to break a protocol for Oblivious Transfer presented at Eurocrypt 90 [11]. Armed with a new set of definitions for proving the security of interactive computations, we found difficulties in proving the protocol secure. These difficulties led us to a simple attack that breaks the OT protocol in a subtle but fundamental way. The error that we found may be present in a wide variety of secure protocols. It reveals a fundamental flaw in the traditional definition of Oblivious Transfer itself.
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
D. Beaver. Security, Fault Tolerance, and Communication Complexity in Distributed Systems. PhD Thesis, Harvard University, Cambridge, 1990.
D. Beaver. “Formal Definitions for Secure Distributed Protocols.” Proceedings of the DIMACS Workshop on Distributed Computing and Cryptography, Princeton, NJ, October, 1989, J. Feigenbaum, M. Merritt (eds.).
D. Beaver. “Foundations of Secure Interactive Computing.” Proceedings of Crypto 1991, 377–391.
D. Beaver. “The Security of Protocols Executed in Parallel.” In preparation.
D. Beaver. “Efficient and Provably Secure Oblivious Transfer.” Manuscript, 1992.
D. Beaver, S. Goldwasser. “Multiparty Computation with Faulty Majority.” Proceedings of the 30 th FOCS, IEEE, 1989, 468–473.
D. Beaver, S. Haber. “Cryptographic Protocols Provably Secure Against Dynamic Adversaries.” Eurocrypt 1992.
D. Beaver, S. Micali, P. Rogaway. “The Round Complexity of Secure Protocols.” Proceedings of the 22 st STOC, ACM, 1990, 503–513.
C. Bennett, G. Brassard, C. Crépeau, M. Skubiszewska. “Practical Quantum Oblivious Transfer.” Proceedings of Crypto 1991, 351–366.
M. Blum. “How to Exchange (Secret) Keys.” ACM Trans. Comput. Sys. 1:2, May, 1983, 175–193.
B. den Boer. “Oblivious Transfer Protecting Secrecy.” Proc. of Eurocrypt 1991, 31–45.
G. Brassard, D. Chaum, C. Crépeau. “Minimum Disclosure Proofs of Knowledge.” J. Comput. System Sci. 37 (1988), 156–189.
G. Brassard, C. Crèpeau. “Non-Transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond.” Proceedings of the 27 th FOCS, IEEE, 1986, 188–195.
S. Goldwasser, S. Micali, C. Rackoff. “The Knowledge Complexity of Interactive Proof Systems.” SIAM J. Comput. 18:1 (1989), 186–208.
J. Kilian. “Founding Cryptography on Oblivious Transfer.” Proceedings of the 20 th STOC, ACM, 1988, 20–29.
S. Micali, P. Rogaway. “Secure Computation.” Proc. of Crypto 1991, page 9.8 [sic], and incomplete preliminary version distributed at conference.
M. Rabin. “How to Exchange Secrets by Oblivious Transfer.” TR-81, Harvard, 1981.
A. Yao. “Protocols for Secure Computations.” Proceedings of the 23 rd FOCS, IEEE, 1982, 160–164.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beaver, D. (1993). How to Break a “Secure” Oblivious Transfer Protocol. In: Rueppel, R.A. (eds) Advances in Cryptology — EUROCRYPT’ 92. EUROCRYPT 1992. Lecture Notes in Computer Science, vol 658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47555-9_24
Download citation
DOI: https://doi.org/10.1007/3-540-47555-9_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56413-3
Online ISBN: 978-3-540-47555-2
eBook Packages: Springer Book Archive