Non-asymptotic estimates for the probability of correct messages recovering in the binary erasure wiretap channel
DOI:
https://doi.org/10.18372/2410-7840.18.11093Keywords:
cryptographic information security, wiretap channel, erasure channel, random coding, probability of correct messages recovering, provable securityAbstract
We consider an information transmission system which consists of an irredundant source of binary messages, an ideal main channel between the sender and the legitimate receiver, and an erasure wiretap channel between the sender and the adversary. A known method of random messages coding by binary linear codes is used to ensure reliable information security in the wiretap channel. We obtain the exact expression and non-asymptotic estimates for the probability of correct messages recovering in the wiretap channel. This parameter characterizes practical security of the above mentioned systems. Obtained estimates are applicable to a wide class of binary linear codes with known values of length, dimension and minimal (or dual) distance. They allow us to formulate criteria for choosing codes to construct practically secure and effective systems with ran-dom coding in the binary erasure channel and to set suffi-cient condition of asymptotic perfectness of such systems. The results can be applied for cryptographic applications based on the use of the wiretap channel model.References
Алексейчук А.Н. Условия “практической эффек-тивности” и “асимптотической совершенности” кодовой защиты случайных равновероятных сооб-щений / А.Н. Алексейчук // Защита информации: сборник научных трудов. – Київ: НАУ, 2002. – Вып. 2(9). – С. 48 – 54.
Алексейчук А.Н. Нелинейное случайное кодиро-вание в системах передачи информации по каналу связи с отводом / А.Н. Алексейчук, С.В. Гришаков // Правове, нормативне та метрологічне забезпе-чення системи захисту інформації в Україні. – Вип. 8. – Київ: 2004. – С. 133 – 140.
Горицький В.М. Спосіб запису двійкової інформа-ції на магнітний носій / В.М. Горицький, Ю.В. Сергієнко // Деклараційний патент на винахід. – UA 98126913 від 28. 12. 1998 р.
Дискретная математика и математические воп-росы кибернетики / Васильев Ю.Л., Ветухновский Ф.Я., Глаголев В.В. и др. – Т. 1. – М.: Наука, 1974. – 311 с.
Мак-Вильямс Ф.Дж., Слоэн Н.Дж.А. Теория кодов, исправляющих ошибки: Пер. с англ. − М.: Связь, 1979. − 743 с.
Bellare M. A cryptographic treatment of the wiretap channel / M. Bellare, S. Tesarro, A. Vardy / http://eprint.iacr.org/2012/015.
Osarov L.H. Wire-tap channel II / L.H. Osarov, A.D. Wyner // Bell Syst. Techn. J. – 1984. – Vol. 63. – P. 2135 – 2157.
Thangaraj A. On the application of LDPC codes to a novel wire-tap channel inspired by quantum key distri-bution / A. Thangaraj, S. Dihidar, A.R. Calderbank, S. McLaughlin, J.-M. Merolla / http://eprint. arXiv:cs.IT/0411003v2. – 24 Okt., 2005.
Wyner A.D. The wire-tap channel / A.D. Wyner // Bell Syst. Techn. J. – 1975. – Vol. 54. – P. 1355 – 1388.
Downloads
Issue
Section
License
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).