{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:50:22Z","timestamp":1760403022682,"version":"build-2065373602"},"reference-count":34,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T00:00:00Z","timestamp":1617926400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>With the emergence of wireless networks, cooperation for secrecy is recognized as an attractive way to establish secure communications. Departing from cryptographic techniques, secrecy can be provided by exploiting the wireless channel characteristics; that is, some error-correcting codes besides reliability have been shown to achieve information-theoretic security. In this paper, we propose a polar-coding-based technique for the primitive relay wiretap channel and show that this technique is suitable to provide information-theoretic security. Specifically, we integrate at the relay an additional functionality, which allows it to smartly decide whether it will cooperate or not based on the decoding detector result. In the case of cooperation, the relay operates in a decode-and-forward mode and assists the communication by transmitting a complementary message to the destination in order to correctly decode the initial source\u2019s message. Otherwise, the communication is completed with direct transmission from source to the destination. Finally, we first prove that the proposed encoding scheme achieves weak secrecy, then, in order to overcome the obstacle of misaligned bits, we implement a double-chaining construction, which achieves strong secrecy.<\/jats:p>","DOI":"10.3390\/e23040442","type":"journal-article","created":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T10:05:21Z","timestamp":1617962721000},"page":"442","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Secure Polar Coding for the Primitive Relay Wiretap Channel"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2549-9373","authenticated-orcid":false,"given":"Manos","family":"Athanasakos","sequence":"first","affiliation":[{"name":"Department of Informatics and Telecommunications, National and Kapodistrian University of Athens, 157 72 Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8810-0345","authenticated-orcid":false,"given":"George","family":"Karagiannidis","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Aristotle University of Thessaloniki, 541 24 Thessaloniki, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,4,9]]},"reference":[{"key":"ref_1","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 Syst. Tech. J."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"120","DOI":"10.2307\/1426331","article-title":"Three-terminal communication channels","volume":"3","year":"1971","journal-title":"Adv. Appl. Probab."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1109\/TIT.1979.1056084","article-title":"Capacity theorems for the relay channel","volume":"25","author":"Cover","year":"1979","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"4005","DOI":"10.1109\/TIT.2008.928272","article-title":"The Relay-Eavesdropper Channel: Cooperation for Secrecy","volume":"54","author":"Lai","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Yuksel, M., and Erkip, E. (2007, January 14\u201316). The relay channel with a wire-tapper. Proceedings of the 2007 41st Annual Conference on Information Sciences and Systems, Baltimore, MD, USA.","DOI":"10.1109\/CISS.2007.4298265"},{"key":"ref_6","unstructured":"Kim, Y.H. (2007, January 26\u201328). Coding techniques for primitive relay channels. Proceedings of the 2007 Allerton Conference on Communication, Control, Computing, Monticello, IL, USA."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Aggarwal, V., Sankar, L., Calderbank, A.R., and Poor, H.V. (2009, January 8\u201314). Secrecy capacity of a class of orthogonal relay eavesdropper channels. Proceedings of the 2009 Information Theory and Applications Workshop, San Diego, CA, USA.","DOI":"10.1109\/ITA.2009.5044960"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","article-title":"Channel Polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels","volume":"55","author":"Arikan","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"6428","DOI":"10.1109\/TIT.2011.2162275","article-title":"Achieving the secrecy capacity of wiretap channels using polar codes","volume":"57","author":"Mahdavifar","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Sasoglou, E., and Vardy, A. (2013, January 7\u201312). A New Polar Coding Scheme for Strong Security on Wiretap Channels. Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey.","DOI":"10.1109\/ISIT.2013.6620400"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1311","DOI":"10.1109\/TIT.2016.2631223","article-title":"Achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component","volume":"63","author":"Gulcu","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/JSAC.2015.2504275","article-title":"Polar Coding for the General Wiretap Channel With Extensions to Multiuser Scenarios","volume":"34","author":"Wei","year":"2016","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"2410","DOI":"10.1109\/TIT.2016.2539145","article-title":"Polar Coding for the Broadcast Channel With Confidential Messages: A Random Binning Analogy","volume":"62","author":"Chou","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"3263","DOI":"10.1109\/TCOMM.2012.081412.110266","article-title":"Polar codes for cooperative relaying","volume":"60","author":"Thobanen","year":"2012","journal-title":"IEEE Trans. Commun."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/WCL.2013.111213.130639","article-title":"Smart Decode-and-Forward Relaying with Polar Codes","volume":"3","author":"Karas","year":"2014","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Wang, L. (2015, January 14\u201319). Polar Coding for the Relay Channels. Proceedings of the 2015 IEEE International Symposium on Information Theory, Hong Kong, China.","DOI":"10.1109\/ISIT.2015.7282712"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1109\/LCOMM.2010.08.100875","article-title":"Nested polar codes for wiretap and relay channels","volume":"14","author":"Andersson","year":"2010","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Mondelli, M., Hassani, S.H., and Urbanke, R. (2018, January 17\u201322). A new Coding Paradigm for the Primitive Relay Channel. Proceedings of the 2018 IEEE International Symposium on Information Theory, Vail, CO, USA.","DOI":"10.1109\/ISIT.2018.8437479"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Duo, B., Wang, P., Li, Y., and Vucetic, B. (2014, January 10\u201314). Secure Transmission for Relay-Eavesdropper Channels Using Polar Coding. Proceedings of the 2014 IEEE International Conference on Communications (ICC), Sydney, NSW, Australia.","DOI":"10.1109\/ICC.2014.6883649"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Athanasakos, M., and Karagiannidis, G. (2020, January 7\u201311). Strong Secrecy for Relay Wiretap Channels with Polar Codes and Double-Chaining. Proceedings of the 2020 IEEE Global Communications Conference\u2014GLOBECOM, Taipei, Taiwan.","DOI":"10.1109\/GLOBECOM42002.2020.9347956"},{"key":"ref_21","unstructured":"Hassani, S.H., and Urbanke, R. (July, January 29). Universal polar codes. Proceedings of the IEEE International Symposium on Information Theory, Honolulu, HI, USA."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"7829","DOI":"10.1109\/TIT.2013.2282305","article-title":"Polar coding without alphabet extension for assymetric models","volume":"59","author":"Honda","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_23","unstructured":"Chou, R., and Bloch, M. (October, January 29). Using deterministic decisions for low-entropy bits in the encoding and decoding of polar codes. Proceedings of the Annual Allerton Conference on Communication Control and Computing, Monticello, IL, USA."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Del Olmo Al\u00f2s, J., and Fonollosa, J.R. (2020). Polar Coding for Confidential Broadcasting. Entropy, 22.","DOI":"10.3390\/e22020149"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Arikan, E., and Telatar, E. (July, January 28). On the rate of Channel Polarization. Proceedings of the 2009 IEEE International Symposium on Information Theory, Seoul, Korea.","DOI":"10.1109\/ISIT.2009.5205856"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1751","DOI":"10.1109\/TIT.2010.2040961","article-title":"Polar codes are optimal for lossy source coding","volume":"56","author":"Korada","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_27","unstructured":"Korada, S.B. (2009). Polar Codes for Channel and Source Coding. [Ph.D. Thesis, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne]."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Mauerer, U.M., and Wolf, S. (2000). Information-theoretic key agreement: From weak to strong secrecy for free. Advances in Cryptology\u2014Eurocrypt 2000, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-45539-6_24"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Arikan, E. (2010, January 13\u201318). Source polarization. Proceedings of the IEEE International Symposium on Information Theory, Austin, TX, USA.","DOI":"10.1109\/ISIT.2010.5513567"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"4024","DOI":"10.1109\/TIT.2016.2539967","article-title":"Asymmetric error correction and flash-memory rewriting using polar codes","volume":"62","author":"Gad","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_31","unstructured":"Cuff, P.W. (2009). Communication in Networks for Coordinating Behavior. [Ph.D. Thesis, Stanford University]."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Cover, T., and Thomas, J.A. (2006). Elements of Information Theory, Wiley. [2nd ed.].","DOI":"10.1002\/047174882X"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Wu, F., Xing, C., Zhao, S., and Gao, F. (2012, January 29\u201331). Encrypted polar codes for wiretap channel. Proceedings of the 2012 2nd International Conference on Computer Science and Network Technology, Changchun, China.","DOI":"10.1109\/ICCSNT.2012.6526004"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"3331","DOI":"10.1109\/TVLSI.2016.2636908","article-title":"Chaotic Encrypted Polar Coding Scheme for General Wiretap Channel","volume":"25","author":"Zhao","year":"2017","journal-title":"IEEE Trans. Very Large Scale Integr. VLSI Syst."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/4\/442\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T14:12:15Z","timestamp":1760364735000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/4\/442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,9]]},"references-count":34,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2021,4]]}},"alternative-id":["e23040442"],"URL":"https:\/\/doi.org\/10.3390\/e23040442","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2021,4,9]]}}}