Abstract
Oblivious Transfer (OT) is a ubiquitous cryptographic tool that is of fundamental importance in secure protocol design. Despite extensive research into the design and verification of secure and efficient solutions, existing OT protocols enjoy “provable” security only against static attacks, in which an adversary must choose in advance whom it will corrupt.
This model severely limits the applicability of OT, since it provides no verifiable security against attackers who choose their victims adaptively (anytime during or after the protocol) or may even corrupt both players (which is not a moot point in a larger network protocol). This issue arises even if the communication model provides absolutely secure channels. Recent attention has been given to accomplishing adaptive security for encryption, multiparty protocols (for n > 3 participants, with faulty minority), and zero-knowledge proofs.
Our workfills the remaining gap by demonstrating the first (provably) adaptively secure protocol for OT, and consequently for fully general two-party interactive computations. Based on the intractability of discrete logarithms, or more generally on a minimally restricted type of one-way trapdoor permutation, our protocols provably withstand attacks that may compromise Alice or Bob, or both, at any time.
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. “Foundations of Secure Interactive Computing.„ Advances in Cryptology-Crypto’ 91 Proceedings, Springer-Verlag LNCS 576, 1992, 377–391.
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. “Adaptive Zero Knowledge and Computational Equivocation.„ Proceedings of the 28 STOC th, ACM, 1996, 629–638.
D. Beaver. “Precomputing Oblivious Transfer.„ Advances in Cryptology-Crypto’ 95 Proceedings, Springer-Verlag LNCS 963, 1995, 97–109.
D. Beaver. “Equivocable Oblivious Transfer.„ Advances in Cryptology-Eurocrypt’ 96 Proceedings, Springer-Verlag LNCS 1070, 1996, 1996, 119–130.
D. Beaver. “Fair and Adaptively Secure Computation with Faulty Majority.„ Manuscript, 1996, to be submitted.
D. Beaver. “Plug-And-Play Encryption.„ Advances in Cryptology-Crypto’ 97 Proceedings, Springer-Verlag LNCS 1294, 1997, 1997.
D. Beaver, S. Goldwasser. “Multiparty Computation with Faulty Majority.„ Proceedings of the 30 FOCS th, IEEE, 1989, 468–473.
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. Ben-Or, S. Goldwasser, A. Wigderson. “Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation.„ Proceedings of the 20th STOC, ACM, 1988, 1–10.
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 FOCS th, 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.„ Proceedings of the 28 STOC th, ACM, 1996, 639–648.
D. Chaum, C. Crépeau, I. Damgrd. “Multiparty Unconditionally Secure Protocols.„ Proceedings of the 20 STOC th, ACM, 1988, 11–19.
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.
A. DeSantis, G. Persiano. “dZero-Knowledge Proofs of Knowledge Without Interaction.„ Proceedings of the 33 FOCS rd, IEEE, 1992, 427–436.
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.)
P. Feldman. Manuscript, 1988. (Personal communication, Cynthia Dwork.)
U. Feige, A. Shamir. “Witness Indistinguishable and Witness Hiding Proofs.„ Proceedings of the 22 STOC nd, ACM, 1990, 416–426.
U. Feige, A. Shamir. “Zero Knowledge Proofs of Knowledge in Two Rounds.„ Advances in Cryptology-Crypto’ 89 Proceedings, Springer-Verlag LNCS 435, 1990, 1990, 526–544.
O. Goldreich, S. Micali, A. Wigderson. “Proofs that Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design.„ Proceedings of the 27th FOCS, IEEE, 1986, 174–187.
O. Goldreich, S. Micali, A. Wigderson. “How to Play Any Mental Game, or A Completeness Theorem for Protocols with Honest Majority.„ Proceedings of the 19th STOC, ACM, 1987, 218–229.
S. Goldwasser, L. Levin. “Fair Computation of General Functions in Presence of Immoral Majority.„ Proceedings of Crypto 1990.
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. “Founding Cryptography on Oblivious Transfer.„ Proceedings of the 20th STOC, ACM, 1988, 20–29.
J. Kilian, S. Micali, R. Ostrovsky. “Minimum Resource Zero-Knowledge Proofs.„ Proceedings of the 30th FOCS, IEEE, 1989, 1989, 474–479.
S. Micali, P. Rogaway. “Secure Computation.„ Advances in Cryptology-Crypto’ 91 Proceedings, Springer-Verlag LNCS 576, 1992, 392–404.
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.
M. Tompa, H. Woll. “Random Self-Reducibility and Zero-Knowledge Proofs of Possession of Information.„ Proceedings of the 28th FOCS, IEEE, 1987, 472–482.
A. Yao. “Protocols for Secure Computations.„ Proceedings of the FOCS23rd, IEEE, 1982, 160–164.
A. Yao. “Theory and Applications of Trapdoor Functions.„ Proceedings of the 23 FOCS rd, IEEE, 1982, 80–91.
A. Yao. “How to Generate and Exchange Secrets.„ Proceedings of the 27 FOCS th, IEEE, 1986, 162–167.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beaver, D. (1998). Adaptively Secure Oblivious Transfer. In: Ohta, K., Pei, D. (eds) Advances in Cryptology — ASIACRYPT’98. ASIACRYPT 1998. Lecture Notes in Computer Science, vol 1514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49649-1_24
Download citation
DOI: https://doi.org/10.1007/3-540-49649-1_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65109-3
Online ISBN: 978-3-540-49649-6
eBook Packages: Springer Book Archive