Generalized Oblivious Transfer Protocols Based on Noisy Channels

  • Valeri Korjik
  • Kirill Morozov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2052)


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”.


Error Probability Cryptographic Protocol Noisy Channel Base Protocol Oblivious Transfer 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Crepeau, C.: Efficient Cryptographic Protocols Based on Noisy Channels. Proc. Eurocrypt’97. Lecture Notes in Computer Science. 1233, 306–317Google Scholar
  2. 2.
    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–78Google Scholar
  3. 3.
    Schneier, B.: Applied Cryptography. John Wiley (1996)Google Scholar
  4. 4.
    Stinson, D.R.: Universal hashing and authentication codes. Advances in Cryptology, Proc. of Crypto’ 91. Lecture Notes in Computer Science, Vol. 576. (1999) 74–85Google Scholar
  5. 5.
    Feinstein, A.: Foundations of information theory. New-York, McGraw Hill (1958)zbMATHGoogle Scholar
  6. 6.
    Bennett, C., Brassard, G., Crepeau, C. and Maurer, U. M.: Generalized privacy amplification. IEEE Trans. on IT, Vol. 41.6 (Nov. 1995) 1915–1923zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Korjik, V., Yakovlev, V.: Capacity of communication channel with inner random coding. Problems of Information Transmission, Vol. 28.4 (1992) 317–325MathSciNetGoogle Scholar
  8. 8.
    Klove, T., Korjik, V.: Error Detecting Codes. Kluwer (1995)Google Scholar
  9. 9.
    Mac Williams, F.J. and Sloan, N.J.A.: The theory of error-correcting codes. New-York: North-Holland (1977)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Valeri Korjik
    • 1
  • Kirill Morozov
    • 2
  1. 1.Section of TelecommunicationsIPN CINVESTAV, AV. IPN No. 2508 ESQ TicomanMexico D.F.Mexico
  2. 2.Telecommunications Security DepartmentState University of TelecommunicationsSt. PetersburgRussia

Personalised recommendations