{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:28:00Z","timestamp":1740140880591,"version":"3.37.3"},"reference-count":17,"publisher":"IOP Publishing","issue":"1","license":[{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/iopscience.iop.org\/info\/page\/text-and-data-mining"}],"content-domain":{"domain":["iopscience.iop.org"],"crossmark-restriction":false},"short-container-title":["J. Phys.: Conf. Ser."],"published-print":{"date-parts":[[2021,2,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Recently, the emergence and increasingly widespread of wireless networks has generated considerable interest in the information-theoretical approach to ensuring secure communications. The basic principle of information-theoretic security requires a combination of cryptographic methods with channel coding techniques that use the randomness of communication channels to ensure that messages sent cannot be intercepted or decrypted by a third party maliciously eavesdropping on the wireless medium. This paper discusses the information-entropy method for assessing security. We show that information-theoretical security means that any algorithm has a negligible probability of violating the security property. This is the same as unconditional security: it does not rely on any computational assumptions and is not limited to probabilistic violators.<\/jats:p>","DOI":"10.1088\/1742-6596\/1783\/1\/012042","type":"journal-article","created":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T04:19:43Z","timestamp":1613276383000},"page":"012042","update-policy":"https:\/\/doi.org\/10.1088\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Evaluating the effectiveness of information security based on the calculation of information entropy"],"prefix":"10.1088","volume":"1783","author":[{"given":"Akmaral","family":"Imanbayeva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yerlan","family":"Tursynbek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rabiga","family":"Syzdykova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aigerim","family":"Mukhamedova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"266","reference":[{"key":"JPCS_1783_1_012042bib1","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","article-title":"The wire-tap channel","volume":"54","author":"Wyner","year":"1975","journal-title":"Bell System Technical Journal."},{"key":"JPCS_1783_1_012042bib2","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1109\/TIT.1978.1055892","article-title":"Broadcast channels with con_dential messages","volume":"24","author":"Csiszar","year":"1978","journal-title":"IEEE Transactions on Information Theory"},{"article-title":"Provably secure key distribution based on independent channels","year":"1990","author":"Maurer","key":"JPCS_1783_1_012042bib3"},{"key":"JPCS_1783_1_012042bib4","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/18.256484","article-title":"Secret-key agreement by public discussion based on common information","volume":"39","author":"Maurer","year":"1993","journal-title":"IEEE Transactions on Information Theory"},{"key":"JPCS_1783_1_012042bib5","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1109\/18.243431","article-title":"Common randomness in information theory and cryptography. Part I: Secret sharing","volume":"39","author":"Ahlswede","year":"1993","journal-title":"IEEE Transactions on Information Theory"},{"key":"JPCS_1783_1_012042bib6","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New directions in cryptography","volume":"IT-22","author":"Diffie","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"year":"1995","author":"Salomaa","key":"JPCS_1783_1_012042bib7"},{"key":"JPCS_1783_1_012042bib8","doi-asserted-by":"crossref","first-page":"1627","DOI":"10.1016\/S0140-3664(00)00249-8","article-title":"Key-agreement in ad hoc networks","volume":"23","author":"Asokan","year":"2000","journal-title":"Computer Communications"},{"key":"JPCS_1783_1_012042bib9","article-title":"Secret key cryptographic algorithm","volume":"1","author":"N. Satish","year":"2012","journal-title":"Intern. J. of Computer Science"},{"first-page":"66","year":"2002","author":"Pietro","key":"JPCS_1783_1_012042bib10"},{"key":"JPCS_1783_1_012042bib11","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.comnet.2004.11.023","article-title":"Efficient and robust key management for large mobile ad hoc networks","volume":"48","author":"Zhu","year":"2005","journal-title":"Comp. Networks"},{"key":"JPCS_1783_1_012042bib12","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1561\/0100000036","article-title":"Information Theoretic Security","volume":"5","author":"Liang","year":"2008","journal-title":"Foundations and Trends R in Communications and Information Theory"},{"key":"JPCS_1783_1_012042bib13","first-page":"121","article-title":"Otsenka informatsionnoy bezopasnosti v oblachnykh vychisleniyakh na osnove bayyesovskogo podkhoda","volume":"80","author":"Zikratov","year":"2012","journal-title":"Nauchno-tekhnicheskiy vestnik informatsionnykh tekhnologiy, mekhaniki i optiki"},{"key":"JPCS_1783_1_012042bib14","first-page":"58","article-title":"Kriterii samopodobiya i samoaffinnosti dinamicheskogo khaosa","volume":"44","author":"Zhanabayev","year":"2013","journal-title":"Recent Contributions to Physics"},{"key":"JPCS_1783_1_012042bib15","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1023\/A:1012919612047","article-title":"Information criteria for the degree of turbulence self-organization","volume":"44","author":"Zhanabaev","year":"2001","journal-title":"Russian Physics Journal"},{"key":"JPCS_1783_1_012042bib16","article-title":"Concept formulation and university teaching methodology for dynamic chaos","volume":"1136","author":"Imanbayeva","year":"2018","journal-title":"Journal of Physics: Conference Series"},{"key":"JPCS_1783_1_012042bib17","first-page":"9919","article-title":"Practical experience of using problem training in the formation of a knowledge system for students in the field of information security","author":"Imanbayeva","year":"2018","journal-title":"EDULEARN18Proc. Palma, Spain"}],"container-title":["Journal of Physics: Conference Series"],"original-title":[],"link":[{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/1742-6596\/1783\/1\/012042","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/1742-6596\/1783\/1\/012042\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/1742-6596\/1783\/1\/012042\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/1742-6596\/1783\/1\/012042","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/1742-6596\/1783\/1\/012042\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/1742-6596\/1783\/1\/012042\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/1742-6596\/1783\/1\/012042\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/1742-6596\/1783\/1\/012042","content-type":"text\/html","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T01:49:06Z","timestamp":1644630546000},"score":1,"resource":{"primary":{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/1742-6596\/1783\/1\/012042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2,1]]}},"URL":"https:\/\/doi.org\/10.1088\/1742-6596\/1783\/1\/012042","relation":{},"ISSN":["1742-6588","1742-6596"],"issn-type":[{"type":"print","value":"1742-6588"},{"type":"electronic","value":"1742-6596"}],"subject":[],"published":{"date-parts":[[2021,2,1]]},"assertion":[{"value":"Evaluating the effectiveness of information security based on the calculation of information entropy","name":"article_title","label":"Article Title"},{"value":"Journal of Physics: Conference Series","name":"journal_title","label":"Journal Title"},{"value":"paper","name":"article_type","label":"Article Type"},{"value":"Published under licence by IOP Publishing Ltd","name":"copyright_information","label":"Copyright Information"},{"name":"date_received","label":"Date Received","group":{"name":"publication_dates","label":"Publication dates"}},{"name":"date_accepted","label":"Date Accepted","group":{"name":"publication_dates","label":"Publication dates"}},{"name":"date_epub","label":"Online publication date","group":{"name":"publication_dates","label":"Publication dates"}}]}}