|
DOI: 10.14489/vkit.2020.11.pp.047-054
Остроумов О. А., Синюк А. Д.
ОЦЕНКА КЛЮЧЕВОЙ ПРОПУСКНОЙ СПОСОБНОСТИ СЕТИ СВЯЗИ
(pp. 47-54)
Аннотация. Определены граничные значения и выполнен доказательный поиск потенциальных оценок информационной эффективности открытого ключевого согласования сети связи, основанной на информационном обмене по двоичному широковещательному каналу связи с составляющими каналами, описываемыми моделями дискретных симметричных каналов. Исследовано влияние энтропийной функции исследуемого канала на полученные асимптотические теоретико-информационные оценки. Выявлена новая закономерность, определяющая условия формирования сетевого ключа. Установлена взаимосвязь и непротиворечивость представленных результатов с известными исследованиями, которые вносят существенный вклад в развитие теории открытого ключевого согласования. Определены направления дальнейших исследований по поиску новых путей увеличения информационной эффективности. Приведенные результаты могут быть полезны специалистам в области проектирования и построения подсистем управления ключами современных криптографических систем защиты информации.
Ключевые слова: сеть связи; законные абоненты; нарушитель; сетевой ключ; широковещательный канал связи; канал перехвата; совместная информация; энтропийная функция широковещательного канала; оценка ключевой пропускной способности сети; закономерность формирования сетевого ключа.
Ostroumov O. A., Sinyuk A. D.
KEY NETWORK BANDWIDTH ESTIMATE
(pp. 47-54)
Abstract. The tasks of secure generating, distributing, and delivering keys to telecommunications systems correspondents that use cryptographic methods to protect information, along with accounting tasks, use order, and keys destruction are fundamental to the key life cycle task list. Traditionally, they are solved using secure communication channels, which is not economical, not always timely and in certain conditions impossible. The alternatives are key negotiation methods by transmitting information over open communication channels. The information efficiency accurate estimates are represented for some methods of open key agreement between two legitimate correspondents. They are not known for the network key formation conditions. The study purpose: an evidence-based search for potential evaluations of the open network key generation information effectiveness. The results: based on a set of represented results (including problem statement, intruder models development, channel connectivity, coder, decoder, system of quality indicators and key forming method requirements, key generation method, the network key generation asymptotic information efficiency index, proof key capacity theorem), an asymptotic information efficiency index estimate of a network key forming was made, which the key network bandwidth measurement based on the information exchange on a binary broadcast channel of communication with the component channels described by discrete symmetric channels models is proposed. Besides, Broadcast channel entropy function influence on the estimate is investigated. The pattern determining the network key forming possibility that meets the requirements is identified. The connection of the results with known scientific research is identified. The areas for further research are identified. The practical significance: the obtained results develop the wellknown scientific results in the field of the open key agreement theory and can be useful to specialists in the design and construction field of promising key management subsystems of modern cryptographic information protection systems that provide a closed telecommunication systems information exchange.
Keywords: Communication network; Legal correspondents; Intruder; Network key; Broadcast communication channel; Broadcast channel entropy function; Interception channel; Joint information; Key net bandwidth estimate; Network key forming pattern.
О. А. Остроумов, А. Д. Синюк (Военная академия связи имени Маршала Советского Союза С. М. Буденного, Санкт-Петербург, Россия) E-mail:
Этот e-mail адрес защищен от спам-ботов, для его просмотра у Вас должен быть включен Javascript
,
Этот e-mail адрес защищен от спам-ботов, для его просмотра у Вас должен быть включен Javascript
O. A. Ostroumov, A. D. Sinyuk (Military Telecommunications Academy Named After the Soviet Union Marshal Budienny S. M., Saint-Petersburg, Russia) E-mail:
Этот e-mail адрес защищен от спам-ботов, для его просмотра у Вас должен быть включен Javascript
,
Этот e-mail адрес защищен от спам-ботов, для его просмотра у Вас должен быть включен Javascript
1. An Efficient Authentication and Key Agreement Protocol for 4G (LTE) Networks / K. A. Alezabi, F. Hashim, Sh. J. Hashim, B. M. Ali // IEEE Region 10 Symposium. 2014. P. 502 – 507.
2. Design of Lightweight Authentication and Key Agreement Protocol for Vehicular ad Hocnet Works / M. Wazid, A. K. Das, N. Kumar et al. // IEEE Access 5. 2017. P. 14966 – 14980.
3. No-key Protocol for Deniable Encryption / N. H. Nguyen , H. M. Nguyen , D. T. Nguyen et al. // Advances in Intelligent Systems and Computing. 2018. V. 672. P. 96 – 104.
4. Ahmed S. Mansour, Rafael F. Schaefer, Holger Boche. On the Individual Secrecy Capacity Regions of the General, Degraded, and Gaussian Multi-Receiver Wiretap Broadcast Channel // IEEE Transactions on Information Forensics and Security. 2016. V. 11, Is. 9. P. 2107 – 2122
5. Sinjuk A. D., Ostroumov O. A. Theorem about Key Capacity of a Communication Network // Informatsionno-upravliaiushchie Sistemy. 2018. No. 5. P. 79 – 87. DOI: 10.31799/1684-8853-2018-5-79-87
6. Key Generation Protocol Executing Through Non-reciprocal Fading Channels / V. Starostin, V. Korzhik, M. Kabardov et al. // International Journal of Computer Science and Applications. 2019. V. 16, Is. 1. P. 1 – 16.
7. Outdoor Secret Key Agreement Scenarios Using Wireless MIMO Fading Channel / V. Yakovlev, V. Korzhik, P. Mylnikov, G. Morales-Luna // Journal of Computer Science and Applications. 2017. V. 14, Is. 1. P. 1 – 25.
8. Остроумов О. А., Синюк А. Д. Пропускная способность широковещательного канала связи // Вестник компьютерных и информационных технологий. 2019. № 9(183). С. 33 – 42. DOI: 10.14489/vkit. 2019.09.pp.033-042
9. Остроумов О. А., Синюк А. Д. Исследование совместной информации // Информация и космос. 2017. № 3. С. 55 – 58.
10. Kim H., Gamal A. Capacity Theorems for Broadcast Channels with Two Channel State Components Know Nat the Receivers // IEEE Transactions on Information Theory. 2016. V. 62, Is. 12. P. 6917 –6930.
11. Reza K. Farsani. On the Capacity Region of the Broadcast, the Interference, and the Cognitive Radio Channels // IEEE Transactions on Information Theory. 2015. V. 61, Is. 5. P. 2600 – 2623.
12. Naveen Goela, Emmanuel Abbe, Michael Gastpar Polar. Codes for Broadcast Channels // IEEE Transactions on Information Theory. 2015. V. 61, Is. 2. P. 758 – 782.
13. Csiszar I., Korner J. Information Theory: Coding Theorems for Discrete Memoryless Systems. Cambridge University Press, 2011. 523 p. DOI: 10.1017/СВО9780511921889
14. Energy–efficient Group Key Agreement for Wireless Networks / T. R. Halford, T. A. Courtade, K. M. Chugg et al. // IEEE Transactions on Wireless Communications. 2015. V. 14, Is. 10. P. 5552 – 5564.
15. Maurer U. Secret Key Agreement by Public Discussion Based on Common Information // IEEE Transactions on Information Theory. 1993. V. 39, Is. 3. P. 733 – 742.
16. Остроумов О. А., Синюк А. Д. Информационная емкость и неопределенность дискретного широковещательного канала связи // Вестник компьютерных информационных технологий. 2018. № 8(170). С. 36 – 45. DOI: 10.14489/vkit.2018.08.pp.036-045
17. Hon-Fah Chong, Ying-Chang Liang. On the Capacity Region of the Parallel Degraded Broadcast Channel With Three Receivers and Three-Degraded Message Sets. // IEEE Transactions on Information Theory. 2018. V. 64, Is. 7. P. 5017 – 5041.
18. Uzi Pereg, Yossef Steinberg. The Arbitrarily Varying Degraded Broadcast Channel with Causal Side Information at the Encoder // IEEE International Symposium on Information Theory (ISIT). 2017. P. 1033 – 1037.
19. Yasutada Oohama. Strong Converse Theorems for Degraded Broadcast Channels with Feedback // IEEE International Symposium on Information Theory (ISIT). 2015. P. 2510 – 2514.
20. Somayeh Salimi, Eduard A. Jorswieck, Mikael Skoglund, Panos Papadimitratos. Key Agreement over an Interference Channel with Noiseless Feedback: Achievable Region & Distributed Allocation // IEEE Conference on Communications and Network Security (CNS). 2015. P. 59 – 64.
1. Alezabi K. A., Hashim F., Hashim Sh. J., Ali B. M. (2014). An efficient authentication and key agreement protocol for 4G (LTE) networks. IEEE region 10 symposium, pp. 502 – 507.
2. Wazid M., Das A. K., Kumar N. et al. (2017). Design of lightweight authentication and key agreement protocol for vehicular ad hocnet works. IEEE Access, (5), pp. 14966 – 14980.
3. Nguyen N. H., Nguyen H. M., Nguyen D. T. et al. (2018). No-key protocol for deniable encryption. Advances in Intelligent Systems and Computing, Vol. 672, pp. 96 – 104.
4. Ahmed S. Mansour, Rafael F. Schaefer, Holger Boche (2016). On the Individual Secrecy Capacity Regions of the General, Degraded, and Gaussian Multi-Receiver Wiretap Broadcast Channel. IEEE Transactions on Information Forensics and Security, Vol. 11, (9), pp. 2107 – 2122.
5. Sinjuk A. D., Ostroumov O. A. (2018). Theorem about key capacity of a communication network. Informatsionno-upravliaiushchie sistemy, (5), pp. 79 – 87. DOI:10.31799/1684-8853-2018-5-79-87.
6. Starostin V., Korzhik V., Kabardov M. et al. (2019). Key generation protocol executing through non-reciprocal fading channels. International Journal of Computer Science and Applications, Vol. 16, (1), pp. 1 – 16.
7. Yakovlev V., Korzhik V., Mylnikov P., Morales-Luna G. (2017). Outdoor secret key agreement scenarios using wireless MIMO fading channel. Journal of Computer Science and Applications, Vol. 14, (1), pp. 1 – 25.
8. Ostroumov O. A., Sinyuk A. D. (2019). Broadcast communication channel bandwidth. Vestnik komp'yuternyh i informatsionnyh tekhnologiy, (9), pp. 33 – 42. [in Russian language] DOI: 10.14489/vkit. 2019.09.pp.033-042
9. Ostroumov O. A., Sinyuk A. D. (2017). Researching collaborative information. Informatsiya i kosmos, (3), pp. 55 – 58. [in Russian language]
10. Kim H., Gamal A. (2016). Capacity theorems for broadcast channels with two channel state components know nat the receivers. IEEE Transactionson Information Theory, 62(12), pp. 6917 – 6930.
11. Reza K. Farsani (2015). On the Capacity Region of the Broadcast, the Interference, and the Cognitive Radio Channels. IEEE Transactions on Information Theory, 61(5), pp. 2600 – 2623.
12. Naveen Goela, Emmanuel Abbe, Michael Gastpar Polar (2015). Codes for Broadcast Channels. IEEE Transactionson Information Theory, 61(2), pp. 758 – 782.
13. Csiszar I., Korner J. (2011). Information theory: coding theorems for discrete memoryless systems. Cambridge University Press.
14. Halford T. R., Courtade T. A., Chugg K. M. et al. (2015). Energy–efficient group key agreement for wireless networks. IEEE Transactionson Wireless Communications, 14(10), pp. 5552 – 5564.
15. Maurer U. (1993). Secret key agreement by public discussion based on common information. IEEE Transactions on Information Theory, 39, pp. 733 – 742.
16. Ostroumov O. A., Sinyuk A. D. (2018). Information capacity and uncertainty of a discrete broadcast communication channel. Vestnik komp'yuternyh informatsionnyh tekhnologiy, 170(8), pp. 36 – 45. [in Russian language] DOI: 10.14489/vkit.2018.08.pp.036-045
17. Hon-Fah Chong, Ying-Chang Liang (2018). On the Capacity Region of the Parallel Degraded Broadcast Channel With Three Receivers and Three-Degraded Message Sets. IEEE Transactions on Information Theory, 64(7), pp. 5017 – 5041.
18. Uzi Pereg, Yossef Steinberg (2017). The arbitrarily varying degraded broadcast channel with causal side information at the encoder. IEEE International Symposium on Information Theory (ISIT), pp. 1033 – 1037.
19. Yasutada Oohama (2015). Strong converse theorems for degraded broadcast channels with feedback. IEEE International Symposium on Information Theory (ISIT), pp. 2510 – 2514.
20. Somayeh Salimi, Eduard A. Jorswieck, Mikael Skoglund, Panos Papadimitratos (2015). Key agreement over an interference channel with noiseless feedback: Achievable region & distributed allocation. IEEE Conference on Communications and Network Security (CNS), pp. 59 – 64.
Статью можно приобрести в электронном виде (PDF формат).
Стоимость статьи 350 руб. (в том числе НДС 18%). После оформления заказа, в течение нескольких дней, на указанный вами e-mail придут счет и квитанция для оплаты в банке.
После поступления денег на счет издательства, вам будет выслан электронный вариант статьи.
Для заказа скопируйте doi статьи:
10.14489/vkit.2020.11.pp.047-054
и заполните форму
Отправляя форму вы даете согласие на обработку персональных данных.
.
This article is available in electronic format (PDF).
The cost of a single article is 350 rubles. (including VAT 18%). After you place an order within a few days, you will receive following documents to your specified e-mail: account on payment and receipt to pay in the bank.
After depositing your payment on our bank account we send you file of the article by e-mail.
To order articles please copy the article doi:
10.14489/vkit.2020.11.pp.047-054
and fill out the form
.
|
Архив номеров
Разработка концепции и создание сайта - ООО «Издательский дом «СПЕКТР»