Abstract
We analyze and enhance Oblivious Transfer (OT) protocols to accommodate security against adaptive attacks. Previous analysis has been static in nature, treating the security of Alice and the security of Bob as separate cases, determined in advance. It remains unclear whether existing protocols are provably secure against adaptive attacks, but we provide enhancements to make them provably secure against attacks by adaptive 1-adversaries, who can choose at any time whether to corrupt Alice or Bob. We determine circumstances under which OT can be ex- ecuted “in the open,” without encrypting the messages, thereby giving simple alternatives to encrypting an entire interaction. We isolate equivocation properties that provide enough flexibility for a simulator to handle adaptive attacks. These properties also provide a means for classifying OT protocols and understanding the subtle demands of security against adaptive adversaries, as well as designing protocols that can be proven secure against adaptive attacks.
Chapter PDF
References
D. Beaver. “How to Break a’ secure’ Oblivious Transfer Protocol.” Advances in Cryptology — Eurocrypt’ 92 Proceedings, Springer-Verlag LNCS 658, 1993, 285–296.
D. Beaver. “Adaptively Secure Encryption.” Penn State Univ. Tech Report PSU-CSE-96-031, February 7, 1996.
D. Beaver, S. Haber. “Cryptographic Protocols Provably Secure Against Dynamic Adversaries.” Advances in Cryptology — Eurocrypt’ 92 Proceedings, Springer-Verlag LNCS 658, 1993, 307–323.
M. Bellare, S. Micali. “Non-Interactive Oblivious Transfer and Applications.” Advances in Cryptology — Crypto’ 89 Proceedings, Springer-Verlag LNCS 435, 1990, 547–557.
G. Brassard, C. Crépeau, J. Robert. “All or Nothing Disclosure of Secrets.” Advances in Cryptology — Crypto’ 86 Proceedings, Springer-Verlag LNCS 263, 1987, 234–238.
G. Brassard, C. Crépeau, J. Robert. “Information Theoretic Reductions among Disclosure Problems.” Proceedings of the 27 th FOCS, IEEE, 1986, 168–173.
G. Brassard, D. Chaum, C. Crépeau. “Minimum Disclosure Proofs of Knowledge.” J. Comput. Systems Sci. 37, 1988, 156–189.
R. Canetti, U. Feige, O. Goldreich, M. Naor. “Adaptively Secure Multiparty Computation.” To appear, Proceedings of the 28 th STOC, ACM, 1996.
C. Crépeau. “Equivalence Between Two Flavours of Oblivious Transfers.” Advances in Cryptology — Crypto’ 87 Proceedings, Springer-Verlag LNCS 293, 1988, 350–354.
B. den Boer. “Oblivious Transfer Protecting Secrecy.” Advances in Cryptology — Eurocrypt’ 91 Proceedings, Springer-Verlag LNCS 547, 1991, 31–45.
W. Diffie, M. Hellman. “New Directions in Cryptography.” IEEE Transactions on Information Theory IT-22, November 1976, 644–654.
S. Even, O. Goldreich, A. Lempel. “A Randomized Protocol for Signing Contracts.” Comm. of the ACM 28:6, 1985, 637–647. (Early version: Proceedings of Crypto 1982, Springer-Verlag, 1983, 205–210.)
S. Goldwasser, S. Micali. “Probabilistic Encryption.” J. Comput. Systems Sci. 28, 1984, 270–299.
S. Goldwasser, S. Micali, C. Rackoff. “The Knowledge Complexity of Interactive Proof Systems.” SIAM J. on Computing 18:1, 1989, 186–208.
L. Harn, H. Lin. “Noninteractive Oblivious Transfer.” Electronics Letters 26:10, May 1990, 635–636.
J. Kilian, S. Micali, R. Ostrovsky. “Minimum Resource Zero-Knowledge Proofs.” Proceedings of the 30 th FOCS, IEEE, 1989, 1989, 474–479.
M.O. Rabin. “How to Exchange Secrets by Oblivious Transfer.” TR-81, Harvard, 1981.
R. Rivest, A. Shamir, L. Adleman. “A Method for Obtaining Digital Signatures and Public Key Cryptosystems.” Communications of the ACM 21:2, 1978, 120–126.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beaver, D. (1996). Equivocable Oblivious Transfer. In: Maurer, U. (eds) Advances in Cryptology — EUROCRYPT ’96. EUROCRYPT 1996. Lecture Notes in Computer Science, vol 1070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68339-9_11
Download citation
DOI: https://doi.org/10.1007/3-540-68339-9_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61186-8
Online ISBN: 978-3-540-68339-1
eBook Packages: Springer Book Archive