Abstract
The Wire-Tap Channel of Wyner [19] shows that a Binary Symmetric Channel may be used as a basis for exchanging a secret key, in a cryptographic scenario of two honest people facing an eavesdropper. Later Crépeau and Kilian [9] showed how a BSC may be used to implement Oblivious Transfer in a cryptographic scenario of two possibly dishonest people facing each other. Unfortunately this result is rather impractical as it requires Ω(n 11) bits to be transmitted through the BSC to accomplish a single OT. The current paper provides efficient protocols to achieve the cryptographic primitives of Bit Commitment and Oblivious Transfer based on the existence of a Binary Symmetric Channel. Our protocols respectively require sending O(n) and O(n 3) bits through the BSC. These results are based on a technique known as Generalized Privacy Amplification [1] that allow two people to extract secret information from partially compromised data.
Supported in part by Québec’s FCAR and Canada’s NSERC.
Chapter PDF
References
C.H. Bennett, G. Brassard, C. Crépeau, and U.M. Maurer. Generalized Privacy Amplification. IEEE Transaction on Information Theory, Volume 41, Number 6, November 1995, pp. 1915–1923.
C. H. Bennett, G. Brassard, C. Crépeau, and M.-H. Skubiszewska. Practical quantum oblivious transfer. In Advances in Cryptology: Proceedings of Crypto’ 91, Lecture Notes in Computer Science, Vol. 576, pages 351–366. Springer-Verlag, 1992.
M. Blum. Coin flipping by telephone. In Proceedings of IEEE Spring Computer Conference, pages 133–137. IEEE, 1982.
G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37:156–189, 1988.
G. Brassard, C. Crépeau, R. Jozsa and D. Langlois, “A quantum bit commitment scheme provably unbreakable by both parties,” Proceedings of 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 362–371.
J. L. Carter and M. N. Wegman, “Universal classes of hash functions”, Journal of Computer and System Sciences, Vol. 18, 1979, pp. 143–154.
C. Crépeau. Equivalence between two flavours of oblivious transfers (abstract). In C. Pomerance, editor, Advances in Cryptology: Proceedings of Crypto’ 87, pages 350–354, Springer-Verlag, 1988.
C. Crépeau, J. van de Graaf and A. Tapp. Committed Oblivious Transfer and Private Multi-Party Computations. Advances in Cryptology: Proceedings of Crypto’ 95, August 1995, pp. 110–123.
C. Crépeau and J. Kilian. Achieving oblivious transfer using weakened security assumptions. In 29 th Symposium on Foundations of Computer Science, pages 42–52. IEEE, 1988.
S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. In R. L. Rivest, A. Sherman, and D. Chaum, editors, Proceedings CRYPTO 82, pages 205–210, Plenum Press, New York, 1983.
Forney, G. D., Concatenated Codes, The M.I.T. Press, 1966.
O. Goldreich, S. Micali and A. Wigderson, How to play any mental game, or: A completeness theorem for protocols with honest majority In Proc. 19th ACM Symposium on Theory of Computing, pages 218–229, ACM, 1987.
O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity, or All languages in \( \mathcal{N}\mathcal{P} \) have zero-knowledge proof systems. Journal of the ACM, 38:691–729, 1991.
J. Kilian, Founding cryptography on Oblivious transfer, 20th ACM Symposium on Theory of Computation, 1988, pp. 20–31.
F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North-Holland, 1977.
M.O. Rabin, How to exchange secrets by oblivious transfer. Technical Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
A. Rényi, Probability Theory, North Holland, 1970.
S. Wiesner. Conjugate coding. SIGACT News, 15(1):78–88, 1983. Manuscript written circa 1970, unpublished until it appeared in SIGACT News.
A. D. Wyner, “The wire-tap channel”, Bell System Technical Journal, Vol. 54, no. 8, 1975, pp. 1355–1387.
Yao, A. C.-C., “Protocols for secure computations”, In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, November 1982, pp. 160–164.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crépeau, C. (1997). Efficient Cryptographic Protocols Based on Noisy Channels. In: Fumy, W. (eds) Advances in Cryptology — EUROCRYPT ’97. EUROCRYPT 1997. Lecture Notes in Computer Science, vol 1233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69053-0_21
Download citation
DOI: https://doi.org/10.1007/3-540-69053-0_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62975-7
Online ISBN: 978-3-540-69053-5
eBook Packages: Springer Book Archive