{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T19:53:23Z","timestamp":1773258803245,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:00:00Z","timestamp":1773187200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:00:00Z","timestamp":1773187200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"CAS Project for Young Scientists in Basic Research","award":["YSBR-035"],"award-info":[{"award-number":["YSBR-035"]}]},{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2020YFB1807502"],"award-info":[{"award-number":["2020YFB1807502"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Wiretap coding, evolving in parallel with cryptography for nearly 50 years, focuses on secure transmission under the assumption that the wiretap channel is no less noisy than the main channel. Most provably secure schemes rely on information-theoretic security but often achieve limited practical rates. This paper proposes a framework for computationally secure modular wiretap coding. We integrate error correction encoding with the channel transition process to define the wiretap channel function, which consists of an invertible function and a lossy function. Secure encoding is then modeled as a computational entropy extractor. A detailed analysis of the lossy function for symmetric wiretap channels is presented. To leverage this lossiness, we design two computational extractors: the invertible fooling extractor (IFE) and the compressed randomness extractor (CRE). For practical implementation, we demonstrate that a 4-round optimal asymmetric encryption padding serves as an IFE in the random oracle model. Experimental comparisons show that our scheme achieves approximately 3 times and 2.7 times the code rates of the Invert-then-Encode and code-based schemes\u2014classical information-theoretic schemes\u2014under equivalent channel conditions. By instantiating IFE and CRE with hash algorithms such as SHAKE-128\/256, we develop a practical wiretap coding scheme that achieves high rates with reasonable computational overhead.<\/jats:p>","DOI":"10.1186\/s42400-025-00419-9","type":"journal-article","created":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T03:02:01Z","timestamp":1773198121000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computational wiretap coding: framework and practical construction"],"prefix":"10.1186","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7438-4815","authenticated-orcid":false,"given":"Mengjie","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianhui","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"An","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyi","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongchi","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,11]]},"reference":[{"key":"419_CR1","doi-asserted-by":"crossref","unstructured":"Bellare M, Boldyreva A, O\u2019Neill A (2007) Deterministic and efficiently searchable encryption. In: Advances in cryptology-CRYPTO 2007: 27th annual international cryptology conference, Santa Barbara, CA, USA, August 19\u201323, 2007. Proceedings 27. Springer, pp 535\u2013552","DOI":"10.1007\/978-3-540-74143-5_30"},{"key":"419_CR2","doi-asserted-by":"crossref","unstructured":"Bellare M, Rogaway P (1995) Optimal asymmetric encryption. In: Advances in cryptology\u2014EUROCRYPT\u201994: workshop on the theory and application of cryptographic techniques Perugia, Italy, May 9\u201312, 1994 Proceedings 13. Springer, pp 92\u2013111","DOI":"10.1007\/BFb0053428"},{"key":"419_CR3","unstructured":"Bellare M, Tessaro S (2012) Polynomial-time, semantically-secure encryption achieving the secrecy capacity. arXiv preprint arXiv:1201.3160"},{"key":"419_CR4","doi-asserted-by":"crossref","unstructured":"Bellare M, Tessaro S, Vardy A (2012) Semantic security for the wiretap channel. In: Annual cryptology conference. Springer, pp 294\u2013311","DOI":"10.1007\/978-3-642-32009-5_18"},{"key":"419_CR5","doi-asserted-by":"crossref","unstructured":"Boldyreva A, Fehr S, O\u2019Neill A (2008) On notions of security for deterministic encryption, and efficient constructions without random oracles. In: Advances in Cryptology\u2013CRYPTO 2008: 28th annual international cryptology conference, Santa Barbara, CA, USA, August 17-21, 2008. Proceedings 28. Springer, pp 335\u2013359","DOI":"10.1007\/978-3-540-85174-5_19"},{"key":"419_CR6","doi-asserted-by":"crossref","unstructured":"Boldyreva A, Fischlin M (2006) On the security of oaep. In: International conference on the theory and application of cryptology and information security. Springer, pp 210\u2013225","DOI":"10.1007\/11935230_14"},{"key":"419_CR7","doi-asserted-by":"crossref","unstructured":"Boneh D (2001) Simplified oaep for the rsa and rabin functions. In: Annual international cryptology conference. Springer, pp 275\u2013291","DOI":"10.1007\/3-540-44647-8_17"},{"issue":"2","key":"419_CR8","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1109\/COMST.2016.2633387","volume":"19","author":"X Chen","year":"2016","unstructured":"Chen X, Ng DWK, Gerstacker WH, Chen H-H (2016) A survey on multiple-antenna techniques for physical layer security. IEEE Commun Surv Tutor 19(2):1027\u20131053","journal-title":"IEEE Commun Surv Tutor"},{"issue":"5","key":"419_CR9","doi-asserted-by":"publisher","first-page":"2410","DOI":"10.1109\/TIT.2016.2539145","volume":"62","author":"RA Chou","year":"2016","unstructured":"Chou RA, Bloch MR (2016) Polar coding for the broadcast channel with confidential messages: a random binning analogy. IEEE Trans Inf Theory 62(5):2410\u20132429","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"419_CR10","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1109\/TIT.1978.1055892","volume":"24","author":"I Csisz\u00e1r","year":"1978","unstructured":"Csisz\u00e1r I, Korner J (1978) Broadcast channels with confidential messages. IEEE Trans Inf Theory 24(3):339\u2013348","journal-title":"IEEE Trans Inf Theory"},{"key":"419_CR11","doi-asserted-by":"crossref","unstructured":"Dodis Y (2012) Shannon impossibility, revisited. In: International conference on information theoretic security. Springer, pp 100\u2013110","DOI":"10.1007\/978-3-642-32284-6_6"},{"key":"419_CR12","doi-asserted-by":"crossref","unstructured":"Dodis Y, Ostrovsky R, Reyzin L, Smith A (2006) Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. In: Technical Report 2003\/235, Cryptology ePrint Archive, Http:\/\/eprint.iacr.org, 2006. Previous Version Appeared at EUROCRYPT 2004","DOI":"10.1007\/978-3-540-24676-3_31"},{"key":"419_CR13","doi-asserted-by":"crossref","unstructured":"Dodis Y, Reyzin L, Smith A (2004) Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. In: Advances in Cryptology-EUROCRYPT 2004: international conference on the theory and applications of cryptographic techniques, Interlaken, Switzerland, May 2\u20136, 2004. Proceedings 23. Springer, pp 523\u2013540","DOI":"10.1007\/978-3-540-24676-3_31"},{"key":"419_CR14","doi-asserted-by":"crossref","unstructured":"Fujisaki E, Okamoto T, Pointcheval D, Stern J (2001) Rsa-oaep is secure under the rsa assumption. In: Annual international cryptology conference. Springer, pp 260\u2013274","DOI":"10.1007\/3-540-44647-8_16"},{"key":"419_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2020.104602","volume":"275","author":"B Fuller","year":"2020","unstructured":"Fuller B, Meng X, Reyzin L (2020) Computational fuzzy extractors. Inf Comput 275:104602","journal-title":"Inf Comput"},{"key":"419_CR16","doi-asserted-by":"crossref","unstructured":"Gao T, Lu X (2023) Physical layer secure communication based on mimo channel constellation flipping. In: 2023 IEEE 22nd international conference on trust, security and privacy in computing and communications (TrustCom). IEEE, pp 1408\u20131415","DOI":"10.1109\/TrustCom60117.2023.00192"},{"issue":"6","key":"419_CR17","doi-asserted-by":"publisher","first-page":"2180","DOI":"10.1109\/TWC.2008.060848","volume":"7","author":"S Goel","year":"2008","unstructured":"Goel S, Negi R (2008) Guaranteeing secrecy using artificial noise. IEEE Trans Wirel Commun 7(6):2180\u20132189","journal-title":"IEEE Trans Wirel Commun"},{"issue":"2","key":"419_CR18","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1109\/TIT.2016.2631223","volume":"63","author":"TC Gulcu","year":"2016","unstructured":"Gulcu TC, Barg A (2016) Achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component. IEEE Trans Inf Theory 63(2):1311\u20131324","journal-title":"IEEE Trans Inf Theory"},{"key":"419_CR19","doi-asserted-by":"crossref","unstructured":"Hsiao C-Y, Lu C-J, Reyzin L (2007) Conditional computational entropy, or toward separating pseudoentropy from compressibility. In: Advances in Cryptology-EUROCRYPT 2007: 26th annual international conference on the theory and applications of cryptographic techniques, Barcelona, Spain, May 20\u201324, 2007. Proceedings 26. Springer, pp 169\u2013186","DOI":"10.1007\/978-3-540-72540-4_10"},{"key":"419_CR20","doi-asserted-by":"crossref","unstructured":"Ishai Y, Jain A, Lou P, Sahai A, Zhandry M (2023) Computational wiretap coding from indistinguishability obfuscation. In: Annual international cryptology conference. Springer, pp 263\u2013293","DOI":"10.1007\/978-3-031-38551-3_9"},{"key":"419_CR21","doi-asserted-by":"crossref","unstructured":"Ishai Y, Korb A, Lou P, Sahai A (2022) Beyond the csisz\u00e1r-korner bound: Best-possible wiretap coding via obfuscation. In: Annual international cryptology conference. Springer, pp 573\u2013602","DOI":"10.1007\/978-3-031-15979-4_20"},{"key":"419_CR22","unstructured":"ITU-R (2017) Minimum requirements related to technical performance for imt-2020 radio interface(s). Recommendation ITU-R M.2410-0, International Telecommunication Union, Radiocommunication Sector"},{"key":"419_CR23","doi-asserted-by":"crossref","unstructured":"Jain A, Lin H, Sahai A (2021) Indistinguishability obfuscation from well-founded assumptions. In: Proceedings of the 53rd Annual ACM SIGACT symposium on theory of computing, pp 60\u201373","DOI":"10.1145\/3406325.3451093"},{"key":"419_CR24","doi-asserted-by":"crossref","unstructured":"Jain A, Lin H, Sahai A (2022) Indistinguishability obfuscation from lpn over f p, dlin, and prgs in nc 0. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, pp 670\u2013699","DOI":"10.1007\/978-3-031-06944-4_23"},{"issue":"3","key":"419_CR25","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1007\/s00145-016-9238-4","volume":"30","author":"E Kiltz","year":"2017","unstructured":"Kiltz E, O\u2019Neill A, Smith A (2017) Instantiability of rsa-oaep under chosen-plaintext attack. J Cryptol 30(3):889\u2013919","journal-title":"J Cryptol"},{"issue":"10","key":"419_CR26","doi-asserted-by":"publisher","first-page":"6399","DOI":"10.1109\/TIT.2014.2343226","volume":"60","author":"C Ling","year":"2014","unstructured":"Ling C, Luzzi L, Belfiore J-C, Stehl\u00e9 D (2014) Semantically secure lattice codes for the gaussian wiretap channel. IEEE Trans Inf Theory 60(10):6399\u20136416","journal-title":"IEEE Trans Inf Theory"},{"issue":"10","key":"419_CR27","doi-asserted-by":"publisher","first-page":"6428","DOI":"10.1109\/TIT.2011.2162275","volume":"57","author":"H Mahdavifar","year":"2011","unstructured":"Mahdavifar H, Vardy A (2011) Achieving the secrecy capacity of wiretap channels using polar codes. IEEE Trans Inf Theory 57(10):6428\u20136443","journal-title":"IEEE Trans Inf Theory"},{"key":"419_CR28","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-45539-6_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2000","author":"U Maurer","year":"2000","unstructured":"Maurer U, Wolf S (2000) Information-theoretic key agreement: from weak to strong secrecy for free. In: Preneel B (ed) Advances in Cryptology \u2013 EUROCRYPT 2000. Springer, Berlin, Heidelberg, pp 351\u2013368"},{"key":"419_CR29","doi-asserted-by":"crossref","unstructured":"Negi R, Goel S (2005) Secret communication using artificial noise. In: IEEE vehicular technology conference, vol 62. Citeseer, p 1906","DOI":"10.1109\/VETECF.2005.1558439"},{"key":"419_CR30","doi-asserted-by":"crossref","unstructured":"Peikert C, Waters B (2008) Lossy trapdoor functions and their applications. In: Proceedings of the fortieth annual ACM symposium on theory of computing, pp 187\u2013196","DOI":"10.1145\/1374376.1374406"},{"key":"419_CR31","doi-asserted-by":"crossref","unstructured":"Phan DH, Pointcheval D (2004) Oaep 3-round: A generic and secure asymmetric encryption padding. In: Advances in Cryptology-ASIACRYPT 2004: 10th International Conference on the Theory and Application of Cryptology and Information Security, Jeju Island, Korea, December 5-9, 2004. Proceedings 10. Springer, pp 63\u201377","DOI":"10.1007\/978-3-540-30539-2_5"},{"key":"419_CR32","doi-asserted-by":"crossref","unstructured":"Ragavan S, Vafa N, Vaikuntanathan V (2024) Indistinguishability obfuscation from bilinear maps and lpn variants. Cryptology ePrint Archive","DOI":"10.1007\/978-3-031-78023-3_1"},{"key":"419_CR33","doi-asserted-by":"crossref","unstructured":"Renner R, Wolf S (2005) Simple and tight bounds for information reconciliation and privacy amplification. In: International conference on the theory and application of cryptology and information security. Springer, pp 199\u2013216","DOI":"10.1007\/11593447_11"},{"key":"419_CR34","doi-asserted-by":"crossref","unstructured":"Rivest RL (1997) All-or-nothing encryption and the package transform. In: Fast Software Encryption: 4th International Workshop, FSE\u201997 Haifa, Israel, January 20\u201322 1997 Proceedings 4. Springer, pp 210\u2013218","DOI":"10.1007\/BFb0052348"},{"key":"419_CR35","doi-asserted-by":"crossref","unstructured":"\u015ea\u015fo\u011flu E, Vardy A (2013) A new polar coding scheme for strong security on wiretap channels. In: 2013 IEEE international symposium on information theory. IEEE, pp 1117\u20131121","DOI":"10.1109\/ISIT.2013.6620400"},{"issue":"4","key":"419_CR36","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon CE (1949) Communication theory of secrecy systems. Bell Syst Techn J 28(4):656\u2013715. https:\/\/doi.org\/10.1002\/j.1538-7305.1949.tb00928.x","journal-title":"Bell Syst Techn J"},{"key":"419_CR37","doi-asserted-by":"crossref","unstructured":"Sharifian S, Lin F, Safavi-Naini R (2018) Hash-then-encode: A modular semantically secure wiretap code. In: Proceedings of the 2nd workshop on communication security: cryptography and physical layer security 2. Springer, pp 49\u201363","DOI":"10.1007\/978-3-319-59265-7_4"},{"issue":"2","key":"419_CR38","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/MWC.2011.5751298","volume":"18","author":"Y-S Shiu","year":"2011","unstructured":"Shiu Y-S, Chang SY, Wu H-C, Huang SC-H, Chen H-H (2011) Physical layer security in wireless networks: a tutorial. IEEE Wirel Commun 18(2):66\u201374","journal-title":"IEEE Wirel Commun"},{"key":"419_CR39","doi-asserted-by":"crossref","unstructured":"Shoup V (2001) Oaep reconsidered. In: Annual international cryptology conference. Springer, pp 239\u2013259","DOI":"10.1007\/3-540-44647-8_15"},{"issue":"3","key":"419_CR40","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/TIFS.2011.2148715","volume":"6","author":"A Subramanian","year":"2011","unstructured":"Subramanian A, Thangaraj A, Bloch M, McLaughlin SW (2011) Strong secrecy on the binary erasure wiretap channel using large-girth ldpc codes. IEEE Trans Inf For Secur 6(3):585\u2013594","journal-title":"IEEE Trans Inf For Secur"},{"issue":"4","key":"419_CR41","doi-asserted-by":"publisher","first-page":"1865","DOI":"10.1109\/TIT.2011.2110230","volume":"57","author":"H Thomas","year":"2011","unstructured":"Thomas H, Renner R (2011) On the randomness of independent experiment. IEEE Trans Inf Theory 57(4):1865\u20131871","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"419_CR42","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/18.556128","volume":"43","author":"M Van Dijk","year":"1997","unstructured":"Van Dijk M (1997) On a special class of broadcast channels with confidential messages. IEEE Trans Inf Theory 43(2):712\u2013714","journal-title":"IEEE Trans Inf Theory"},{"issue":"8","key":"419_CR43","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","volume":"54","author":"AD Wyner","year":"1975","unstructured":"Wyner AD (1975) The wire-tap channel. Bell Syst Tech J 54(8):1355\u20131387","journal-title":"Bell Syst Tech J"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00419-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-025-00419-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00419-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T03:02:15Z","timestamp":1773198135000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s42400-025-00419-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,11]]},"references-count":43,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["419"],"URL":"https:\/\/doi.org\/10.1186\/s42400-025-00419-9","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,11]]},"assertion":[{"value":"2 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and Consent to participate"}}],"article-number":"42"}}