Abstract
The main cryptographic primitives (Bit Commitment (BC) and Oblivious Transfer (OT) protocols) based on noisy channels have been considered in F[1] for asymptotic case. Non-asymptotic behavior of BC protocol has been demonstrated in [2]. The current paper provides stricter asymptotic conditions on Binary Symmetric Channel (BSC) to be feasible OT protocol proposed in [1]. We also generalize this protocol using different encoding and decoding methods that require to regain formulas for Renyi entropy. Nonasymptotic case (finite length of blocks transmitted between parties) is also presented. Some examples are given to demonstrate that these protocols are in fact reliable and information-theoretically secure. We also discuss the problem — how to extend ( 1/2)-OT protocol to (1 L)-OT protocol and how to arrange BSC connecting parties. Both BC and OT protocols can be used as components of more complex and more important for practice protocols like “Digital cash”, “Secure election” or “Distance bounding”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Crepeau, C.: Efficient Cryptographic Protocols Based on Noisy Channels. Proc. Eurocrypt’97. Lecture Notes in Computer Science. 1233, 306–317
Korjik, V., Morozov, K.: Non-asymptotic bit commitment protocol based on noisy channels, 20 Biennal Symposium on Communications Department of Electrical and Computing Engineering Queen’s University, Proc. Kingston, Canada (2000) 74–78
Schneier, B.: Applied Cryptography. John Wiley (1996)
Stinson, D.R.: Universal hashing and authentication codes. Advances in Cryptology, Proc. of Crypto’ 91. Lecture Notes in Computer Science, Vol. 576. (1999) 74–85
Feinstein, A.: Foundations of information theory. New-York, McGraw Hill (1958)
Bennett, C., Brassard, G., Crepeau, C. and Maurer, U. M.: Generalized privacy amplification. IEEE Trans. on IT, Vol. 41.6 (Nov. 1995) 1915–1923
Korjik, V., Yakovlev, V.: Capacity of communication channel with inner random coding. Problems of Information Transmission, Vol. 28.4 (1992) 317–325
Klove, T., Korjik, V.: Error Detecting Codes. Kluwer (1995)
Mac Williams, F.J. and Sloan, N.J.A.: The theory of error-correcting codes. New-York: North-Holland (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Korjik, V., Morozov, K. (2001). Generalized Oblivious Transfer Protocols Based on Noisy Channels. In: Gorodetski, V.I., Skormin, V.A., Popyack, L.J. (eds) Information Assurance in Computer Networks. MMM-ACNS 2001. Lecture Notes in Computer Science, vol 2052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45116-1_22
Download citation
DOI: https://doi.org/10.1007/3-540-45116-1_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42103-0
Online ISBN: 978-3-540-45116-7
eBook Packages: Springer Book Archive