{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T07:04:01Z","timestamp":1772780641381,"version":"3.50.1"},"reference-count":48,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T00:00:00Z","timestamp":1700524800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62071115"],"award-info":[{"award-number":["62071115"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61971135"],"award-info":[{"award-number":["61971135"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2023A03"],"award-info":[{"award-number":["2023A03"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Fund of National Mobile Communications Research Laboratory, Southeast University","award":["62071115"],"award-info":[{"award-number":["62071115"]}]},{"name":"Research Fund of National Mobile Communications Research Laboratory, Southeast University","award":["61971135"],"award-info":[{"award-number":["61971135"]}]},{"name":"Research Fund of National Mobile Communications Research Laboratory, Southeast University","award":["2023A03"],"award-info":[{"award-number":["2023A03"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In this paper, we study a three-layer wiretap network including the source node in the top layer, N nodes in the middle layer and L sink nodes in the bottom layer. Each sink node recovers the message generated from the source node correctly via the middle layer nodes that it has access to. Furthermore, it is required that an eavesdropper eavesdropping a subset of the channels between the top layer and the middle layer learns absolutely nothing about the message. For each pair of decoding and eavesdropping patterns, we are interested in finding the capacity region consisting of (N+1)-tuples, with the first element being the size of the message successfully transmitted and the remaining elements being the capacity of the N channels from the source node to the middle layer nodes. This problem can be seen as a generalization of the secret sharing problem. We show that when the number of middle layer nodes is no larger than four, the capacity region is fully characterized as a polyhedral cone. When such a number is 5, we find the capacity regions for 74,222 decoding and eavesdropping patterns. For the remaining 274 cases, linear capacity regions are found. The proving steps are: (1) Characterizing the Shannon region, an outer bound of the capacity region; (2) Characterizing the common information region, an outer bound of the linear capacity region; (3) Finding linear schemes that achieve the Shannon region or the common information region.<\/jats:p>","DOI":"10.3390\/e25121566","type":"journal-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T10:24:13Z","timestamp":1700562253000},"page":"1566","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Numerical Study on the Capacity Region of a Three-Layer Wiretap Network"],"prefix":"10.3390","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0689-5356","authenticated-orcid":false,"given":"Jiahong","family":"Wu","sequence":"first","affiliation":[{"name":"National Mobile Communications Research Laboratory, Southeast University, Nanjing 211189, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4155-0685","authenticated-orcid":false,"given":"Nan","family":"Liu","sequence":"additional","affiliation":[{"name":"National Mobile Communications Research Laboratory, Southeast University, Nanjing 211189, China"}]},{"given":"Wei","family":"Kang","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Southeast University, Nanjing 211189, China"}]}],"member":"1968","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","article-title":"Network information flow","volume":"46","author":"Ahlswede","year":"2000","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/TIT.2002.807285","article-title":"Linear network coding","volume":"49","author":"Li","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_3","unstructured":"Koetter, R., and M\u00e9dard, M. (2001, January 29\u201329). An algebraic approach to network coding. Proceedings of the 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), Washington, DC, USA."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1109\/TIT.2005.847712","article-title":"Polynomial time algorithms for multicast network code construction","volume":"51","author":"Jaggi","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","unstructured":"Yeung, R.W. (2008). Information Theory and Network Coding, Springer Science & Business Media."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1109\/TIT.2010.2090197","article-title":"Secure Network Coding on a Wiretap Network","volume":"57","author":"Cai","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1109\/TIT.2011.2173631","article-title":"Secure Network Coding for Wiretap Networks of Type II","volume":"58","author":"Rouayheb","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1109\/TIT.2010.2090212","article-title":"Universal Secure Network Coding via Rank-Metric Codes","volume":"57","author":"Silva","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1109\/TIT.2012.2216936","article-title":"On Secure Network Coding With Nonuniform or Restricted Wiretap Sets","volume":"59","author":"Cui","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1109\/JSAIT.2021.3053697","article-title":"Secure Non-Linear Network Code Over a One-Hop Relay Network","volume":"2","author":"Hayashi","year":"2020","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"8280","DOI":"10.1109\/TIT.2021.3116962","article-title":"Network Information Theoretic Security with Omnipresent Eavesdropping","volume":"67","author":"Zhou","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"5965","DOI":"10.1109\/TIT.2020.3011555","article-title":"Local-Encoding-Preserving Secure Network Coding","volume":"66","author":"Guang","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"3345","DOI":"10.1109\/TIT.2014.2315821","article-title":"Performance Bounds on a Wiretap Network with Arbitrary Wiretap Sets","volume":"60","author":"Cheng","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2481","DOI":"10.1109\/TIT.2016.2539280","article-title":"A Numerical Study on the Wiretap Network with a Simple Network Topology","volume":"62","author":"Cheng","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"4513","DOI":"10.1109\/TIT.2018.2824244","article-title":"Alphabet Size Reduction for Secure Network Coding: A Graph Theoretic Approach","volume":"64","author":"Guang","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"3773","DOI":"10.1109\/TIT.2017.2694012","article-title":"Universal Secure Multiplex Network Coding with Dependent and Non-Uniform Messages","volume":"63","author":"Matsumoto","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1428","DOI":"10.1109\/TIT.2019.2957078","article-title":"Secure Network Code for Adaptive and Active Attacks with No-Randomness in Intermediate Nodes","volume":"66","author":"Cai","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"7382","DOI":"10.1109\/TIT.2017.2743688","article-title":"Perfectly Secure Index Coding","volume":"63","author":"Mojahedian","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Bai, Y., Guang, X., and Yeung, R.W. (2023). Multiple Linear-Combination Security Network Coding. Entropy, 25.","DOI":"10.3390\/e25081135"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"5204","DOI":"10.1109\/TIT.2020.2981325","article-title":"On Secure Network Coding for Multiple Unicast Traffic","volume":"66","author":"Agarwal","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Blakley, G.R. (1979, January 4\u20137). Safeguarding cryptographic keys. Proceedings of the 1979 International Workshop on Managing Requirements Knowledge (MARK), New York, NY, USA.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun. ACM"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF00125203","article-title":"An explication of secret sharing schemes","volume":"2","author":"Stinson","year":"1992","journal-title":"Des. Codes Cryptogr."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF00129769","article-title":"Perfect Secret Sharing Schemes on Five Participants","volume":"9","author":"Jackson","year":"1996","journal-title":"Des. Codes Cryptogr."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"7088","DOI":"10.1109\/TIT.2020.3005706","article-title":"Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing","volume":"66","author":"Kaced","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_26","unstructured":"Hammer, D., Romashchenko, A., Shen, A., and Vereshchagin, N. (1997, January 24\u201327). Inequalities for Shannon entropies and Kolmogorov complexities. Proceedings of the Computational Complexity, Twelfth Annual IEEE Conference, Ulm, Germany."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s001459900029","article-title":"The Size of a Share Must Be Large","volume":"10","author":"Csirmaz","year":"1997","journal-title":"J. Cryptol."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.1109\/18.681320","article-title":"On characterization of entropy function via information inequalities","volume":"44","author":"Zhang","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1982","DOI":"10.1109\/18.641561","article-title":"A non-Shannon-type conditional inequality of information quantities","volume":"43","author":"Zhang","year":"1997","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Mat\u00fas, F. (2007, January 24\u201329). Infinitely Many Information Inequalities. Proceedings of the 2007 IEEE International Symposium on Information Theory, Nice, France.","DOI":"10.1109\/ISIT.2007.4557201"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1924","DOI":"10.1109\/18.641556","article-title":"A framework for linear information inequalities","volume":"43","author":"Yeung","year":"1997","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_32","unstructured":"Dougherty, R., Freiling, C., and Zeger, K. (2010). Linear rank inequalities on five or more variables. arXiv."},{"key":"ref_33","unstructured":"Strang, G. (2006). Linear Algebra and Its Applications, Thomson, Brooks\/Cole."},{"key":"ref_34","first-page":"149","article-title":"Representation of matroids","volume":"23","author":"Ingleton","year":"1971","journal-title":"Comb. Math. Appl."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Dougherty, R. (July, January 29). Computations of linear rank inequalities on six variables. Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA.","DOI":"10.1109\/ISIT.2014.6875348"},{"key":"ref_36","unstructured":"Dougherty, R., Freiling, C., and Zeger, K. (2023, January 01). Linrank. Available online: http:\/\/code.ucsd.edu\/zeger\/linrank\/."},{"key":"ref_37","first-page":"674","article-title":"Lecture Notes in Secret Sharing","volume":"2012","year":"2012","journal-title":"IACR Cryptol. EPrint Arch."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1008215702611","article-title":"An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem","volume":"13","author":"Benson","year":"1998","journal-title":"J. Glob. Optim."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1008259214236","article-title":"A Linear Construction of Secret Sharing Schemes","volume":"12","author":"Dijk","year":"1997","journal-title":"Des. Codes Cryptogr."},{"key":"ref_40","unstructured":"Fukuda, K. (2023, January 01). Polyhedral Computation. Available online: https:\/\/www.research-collection.ethz.ch\/handle\/20.500.11850\/426218."},{"key":"ref_41","unstructured":"Lassez, C., and Lassez, J. (1992). Quantifier elimination for conjunctions of linear constraints via a convex hull algorithm. Symb. Numer. Comput. Artif. Intell., 103\u2013122."},{"key":"ref_42","unstructured":"Xu, W., Wang, J., and Sun, J. (2008, January 6\u201311). A projection method for derivation of non-Shannon-type information inequalities. Proceedings of the 2008 IEEE International Symposium on Information Theory, Toronto, ON, Canada."},{"key":"ref_43","unstructured":"Apte, J., and Walsh, J.M. (2016). Explicit Polyhedral Bounds on Network Coding Rate Regions via Entropy Function Region: Algorithms, Symmetry, and Computation. arXiv."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10589-015-9760-6","article-title":"Using multiobjective optimization to map the entropy region","volume":"63","author":"Csirmaz","year":"2016","journal-title":"Comput. Optim. Appl."},{"key":"ref_45","unstructured":"(2023, January 01). Mcmtroffaes. Pycddlib. Available online: https:\/\/pypi.org\/project\/pycddlib\/2.1.6.html."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s00186-016-0554-0","article-title":"Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming","volume":"84","year":"2016","journal-title":"Math. Methods Oper. Res."},{"key":"ref_47","unstructured":"Gurobi Optimization, LLC (2022). Gurobi Optimizer Reference Manual, Gurobi Optimization, LLC."},{"key":"ref_48","unstructured":"Apte, J., and Walsh, J.M. (2016). Constrained Linear Representability of Polymatroids and Algorithms for Computing Achievability Proofs in Network Coding. arXiv."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/12\/1566\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:25:48Z","timestamp":1760131548000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/12\/1566"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,21]]},"references-count":48,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["e25121566"],"URL":"https:\/\/doi.org\/10.3390\/e25121566","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,21]]}}}