Abstract
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives. We introduce a general model for describing such primitives, called Weak Generic Transfer (WGT). This model includes as important special cases Weak Oblivious Transfer (WOT), where both the sender and receiver may learn too much about the other party’s input, and a new, more realistic model of noisy channels, called unfair noisy channels. An unfair noisy channel has a known range of possible noise levels; protocols must work for any level within this range against adversaries who know the actual noise level.
We give a precise characterization for when one can base OT on WOT. When the deviation of the WOT from the ideal is above a certain threshold, we show that no information-theoretic reductions from OT (even against passive adversaries) and BC exist; when the deviation is below this threshold, we give a reduction from OT (and hence BC) that is information-theoretically secure against active adversaries.
For unfair noisy channels we show a similar threshold phenomenon for bit commitment. If the upper bound on the noise is above a threshold (given as a function of the lower bound) then no information-theoretic reduction from OT (even against passive adversaries) or BC exist; when it is below this threshold we give a reduction from BC. As a partial result, we give a reduction from OT to UNC for smaller noise intervals.
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
C. H. Bennett, G. Brassard, C. CrÉpeau, and U. M. Maurer. “Generalized privacy amplification”. IEEE Trans. Info. Theory, vol. 41, no.6, pp. 1915–1923, 1995.
G. Brassard and C. CrÉpeau. “Oblivious transfers and privacy ampliflication”. EUROCRYPT’ 97, LNCS series, vol. 1223, pp. 334–347, 1997.
G. Brassard, C. CrÉpeau, and M. SÁntha. “Oblivious Transfer and Intersecting Codes”. IEEE Trans. Info. Theory, vol. 42, No. 6, pp. 1769–1780, 1996.
C. Cachin. “On the Foundations of Oblivious Transfer”, EUROCRYPT’ 98, LNCS series, vol. 1403, pp. 361–374.
C. CrÉPeau. “Verifiable disclosure of secrets and applications”. EUROCRYPT’ 89, LNCS series, vol. 434, pp. 150–154, 1998.
C. CrÉpeau. “Efficient Cryptographic Protocols based on Noisy Channels”, EUROCRYPT’ 97, LNCS series, vol.1233, pp. 306–317.
C. CrÉpeau. Private communication, 1998.
C. Crépeau, “Equivalence between two flavours of oblivious transfer”, CRYPTO’ 87, LNCS series, pp. 350–354, 1987.
C. CrÉpeau and J. Kilian, “Achieving Oblivious Transfer using Weakened Security Assumptions”, FOCS 88, pp. 42–52, 1988.
L. Carter and M. Wegman. “Universal Classes of Hash Functions”. JCSS, 18, pp. 143–154, 1979.
I. DamgÅrd, J. Kilian, and L. Salvail, “On the (Im)possibility of basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions”, BRICS report available from http://www.brics.dk/Publications/, 1998.
O. Goldreich, S. Micali, and A. Wigderson, “Proofs That Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems”, J. Assoc. Comput. Mach., vol. 38, pp. 691–729, 1991.
J. HÅstad, R. Impagliazzo, L. A. Levin, and M. Luby. “Construction of a pseudo-random generator from any one-way function”. Technical Report TR-91-068, International Computer Science Institute, Berkeley, CA, 1991.
J. Kilian. “A general completeness theorems for 2-party games”. STOC’ 91, pp. 553–560, 1991.
U.M. Maurer, “Secret Key Agreement by Public Discussion from Common Information”, IEEE Trans. Info. Theory, vol. 39, p. 733–742, 1993.
M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. “Perfect zero-knowledge arguments for NP using any one-way permutation”. Journal of Cryptology, vol. 11, 1998.
J. Rompel. Techniques for Computing with Low-Independence Randomness. PhD-thesis, MIT, 1990.
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
Damgård, I., Kilian, J., Salvail, L. (1999). On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions. 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_5
Download citation
DOI: https://doi.org/10.1007/3-540-48910-X_5
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