{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:12:13Z","timestamp":1784301133457,"version":"3.55.0"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,12,10]],"date-time":"2015-12-10T00:00:00Z","timestamp":1449705600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10623-015-0155-6","type":"journal-article","created":{"date-parts":[[2015,12,10]],"date-time":"2015-12-10T12:00:48Z","timestamp":1449748848000},"page":"269-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["(Secure) Linear network coding multicast"],"prefix":"10.1007","volume":"78","author":[{"given":"Christina","family":"Fragouli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emina","family":"Soljanin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,12,10]]},"reference":[{"key":"155_CR1","doi-asserted-by":"crossref","unstructured":"Ahlswede R., Cai N., Li S.-Y.R., Yeung R.W.: Network information flow. IEEE Trans. Inf. Theory 46, 1204\u20131216 (2000).","DOI":"10.1109\/18.850663"},{"key":"155_CR2","doi-asserted-by":"crossref","unstructured":"Amaudruz A., Fragouli C.: Combinatorial algorithms for wireless information flow. In: SODA (2009).","DOI":"10.1137\/1.9781611973068.61"},{"key":"155_CR3","doi-asserted-by":"crossref","unstructured":"Avestimehr A.S., Diggavi S.N., Tse D.N.C.: Wireless network information flow: a deterministic approach. IEEE Trans. Inf. Theory 57(4), 1872\u20131905 (2011).","DOI":"10.1109\/TIT.2011.2110110"},{"key":"155_CR4","doi-asserted-by":"crossref","unstructured":"Bellovin S.M.: Frank Miller: inventor of the one-time pad. Cryptologia 35(3), 203\u2013222 (2011).","DOI":"10.1080\/01611194.2011.583711"},{"key":"155_CR5","unstructured":"Bondy J.A., Murty U.S.R.: Graph theory with applications. North-Holland, Amsterdam (1979)."},{"key":"155_CR6","unstructured":"Cai N., Yeung R.W.: Secure network coding. In: Proceedings of 2002 IEEE International Symposium on Information Theory (ISIT\u201902) (2002)."},{"key":"155_CR7","doi-asserted-by":"crossref","unstructured":"Cheng F., Yeung R.W.: Performance bounds on a wiretap network with arbitrary wiretap sets. IEEE Trans. Inf. Theory 60(6), 3345\u20133358 (2014).","DOI":"10.1109\/TIT.2014.2315821"},{"key":"155_CR8","doi-asserted-by":"crossref","unstructured":"Csisz\u00e1r I., Narayan P.: Secrecy capacities for multi terminal channel models. IEEE Trans. Inf. Theory 54(6), 2437\u20132452 (2008).","DOI":"10.1109\/TIT.2008.921705"},{"key":"155_CR9","unstructured":"Cui T.: Coding for wireless broadcast and network secrecy. PhD Thesis, California Institute of Technology (2010)."},{"key":"155_CR10","doi-asserted-by":"crossref","unstructured":"Cui T., Ho T., Kliewer J.: Achievable strategies for general secure network coding. In: Proceedings of Information Theory and Applications Workshop (ITA), pp. 1\u20136 (2010).","DOI":"10.1109\/ITA.2010.5454118"},{"key":"155_CR11","doi-asserted-by":"crossref","unstructured":"Cui T., Ho T., Kliewer J.: On secure network coding with unequal link capacities and restricted wiretapping sets. In: Proceedings of IEEE Information Theory Workshop (ITW) (2010).","DOI":"10.1109\/CIG.2010.5592818"},{"key":"155_CR12","doi-asserted-by":"crossref","unstructured":"Cui T., Ho T., Kliewer J.: On secure network coding with nonuniform or restricted wiretap sets. IEEE Trans. Inf. Theory 59(1), 166\u2013176 (2013).","DOI":"10.1109\/TIT.2012.2216936"},{"key":"155_CR13","doi-asserted-by":"crossref","unstructured":"Czap L., Prabhakaran V.M., Fragouli C., Diggavi S.: Secret message capacity of erasure broadcast channels with feedback. In: Proceedings of Information Theory Workshop (ITW), pp. 65\u201369 (2011).","DOI":"10.1109\/ITW.2011.6089579"},{"key":"155_CR14","doi-asserted-by":"crossref","unstructured":"Czap L., Prabhakaran V.M., Diggavi S., Fragouli C.: Broadcasting private messages securely. In: Proceedings of International Symposium on Information Theory (ISIT), pp. 428\u2013432. IEEE (2012).","DOI":"10.1109\/ISIT.2012.6284224"},{"key":"155_CR15","doi-asserted-by":"crossref","unstructured":"Czap L., Prabhakaran V.M., Diggavi S., Fragouli C.: Exploiting common randomness: a resource for network secrecy. In: Proceedings of Information Theory Workshop (ITW), pp. 1\u20135 (2013).","DOI":"10.1109\/ITW.2013.6691232"},{"key":"155_CR16","doi-asserted-by":"crossref","unstructured":"Czap L., Prabhakaran V.M., Diggavi S., Fragouli C.: Secure network coding with erasures and feedback. In: Proceedings of Annual Allerton Conference on Communication, Control, and Computing (2013).","DOI":"10.1109\/Allerton.2013.6736707"},{"key":"155_CR17","doi-asserted-by":"crossref","unstructured":"Czap L., Prabhakaran V.M., Diggavi S., Fragouli C.: Triangle network secrecy. In: Proceedings of International Symposium on Information Theory (ISIT), pp. 781\u2013785 (2014).","DOI":"10.1109\/ISIT.2014.6874939"},{"key":"155_CR18","doi-asserted-by":"crossref","unstructured":"Czap L., Fragouli C., Prabhakaran V., Diggavi S.: Secure network coding with erasures and feedback. IEEE Trans. Inf. Theory 61(4), 1667\u20131686 (2015)","DOI":"10.1109\/TIT.2015.2402272"},{"key":"155_CR19","doi-asserted-by":"crossref","unstructured":"Dau S.H., Song W., Yuen C.: On the existence of MDS codes over small fields with constrained generator matrices. In: IEEE International Symposium on Information Theory (ISIT), 2014, pp. 1787\u20131791 (2014).","DOI":"10.1109\/ISIT.2014.6875141"},{"key":"155_CR20","unstructured":"Diggavi S.N., Avestimehr S., Tse D.N.C.: A deterministic approach to wireless relay networks. In: Proceedings of Allerton Conference on Communication, Control, and Computing (2007)."},{"key":"155_CR21","unstructured":"Diggavi S.N., Avestimehr S., Tse D.N.C.: Wireless network information flow. In: Proceedings of Allerton Conference on Communication, Control, and Computing (2007)."},{"key":"155_CR22","doi-asserted-by":"crossref","unstructured":"Diggavi S.N., Avestimehr S., Tse D.N.C.: Approximate capacity of gaussian relay networks. In: IEEE International Symposium on Information Theory (ISIT) (2008).","DOI":"10.1109\/ISIT.2008.4595031"},{"key":"155_CR23","doi-asserted-by":"crossref","unstructured":"Ebrahimi J., Fragouli C.: Multicasting algorithms for deterministic networks. In: Information Theory Workshop (ITW) (2010).","DOI":"10.1109\/ITWKSPS.2010.5503221"},{"key":"155_CR24","doi-asserted-by":"crossref","unstructured":"Ebrahimi J., Fragouli C.: On the benefits of vector network coding. In: IEEE Allerton Conference on Communications, Control and Computing (2010).","DOI":"10.1109\/ISIT.2010.5513771"},{"key":"155_CR25","doi-asserted-by":"crossref","unstructured":"Ebrahimi J., Fragouli C.: Vector network coding. In: IEEE International Symposium on Information Theory (ISIT) (2010).","DOI":"10.1109\/ISIT.2010.5513771"},{"key":"155_CR26","doi-asserted-by":"crossref","unstructured":"Ebrahimi J., Fragouli C.: Algebraic algorithms for vector network coding. IEEE Trans. Inf. Theory, 57(2), pp. 1046\u20131066 (2011).","DOI":"10.1109\/TIT.2010.2094930"},{"key":"155_CR27","doi-asserted-by":"crossref","unstructured":"Ebrahimi J., Fragouli C.: Combinatorial algorithms for wireless information flow. ACM Trans. Algorithms. doi: 10.1137\/1.9781611973068.61","DOI":"10.1137\/1.9781611973068.61"},{"key":"155_CR28","unstructured":"Ebrahimi J., Fragouli C.: Properties of network polynomials. In: IEEE International Symposium on Information Theory (ISIT), 2014 (2012)."},{"key":"155_CR29","doi-asserted-by":"crossref","unstructured":"El Rouayheb S., Soljanin E.: On wiretap networks II. In: Proceedings of International Symposium on Information Theory (ISIT) (2007).","DOI":"10.1109\/ISIT.2007.4557098"},{"key":"155_CR30","doi-asserted-by":"crossref","unstructured":"El Rouayheb S., Soljanin E., Sprintson A.: Secure network coding for wiretap networks of type II. IEEE Trans. Inf. Theory 58(3), 1361\u20131371 (2012).","DOI":"10.1109\/TIT.2011.2173631"},{"key":"155_CR31","unstructured":"Feldman J., Malkin T., Stein C., Servedio R.A.: On the capacity of secure network coding. In: Proceedings of 42nd Annual Allerton Conference on Communication, Control, and Computing (2004)."},{"key":"155_CR32","doi-asserted-by":"crossref","unstructured":"Fragouli C., Soljanin E.: Information flow decomposition for network coding. IEEE Trans. Inf. Theory 52(3), 829\u2013848 (2006).","DOI":"10.1109\/TIT.2005.864435"},{"key":"155_CR33","unstructured":"Gessel I.M., Viennot X.: Determinants, paths and plane partitions (1989) (preprint). http:\/\/pfeinsil.math.siu.edu\/MATH\/MatrixTree\/gesseldeterminants_paths_and_plane_partitions.pdf"},{"key":"155_CR34","doi-asserted-by":"crossref","unstructured":"Halbawi W., Ho T., Hongyi Y., Duursma I.: Distributed Reed\u2013Solomon codes for simple multiple access networks. In: Proceedings of IEEE International Symposium on Information Theory (ISIT\u201914), pp. 651\u2013655 (2014).","DOI":"10.1109\/ISIT.2014.6874913"},{"key":"155_CR35","doi-asserted-by":"crossref","unstructured":"Huang W., Ho T., Langberg M., Kliewer J.: On secure network coding with uniform wiretap sets. In: Proceedings of IEEE International Symposium on Network Coding (NetCod) (2013).","DOI":"10.1109\/NetCod.2013.6570814"},{"key":"155_CR36","doi-asserted-by":"crossref","unstructured":"Iwata S., Goemans M., Zenklusen R.: An algorithmic framework for wireless information flow. Allerton, New York (2009).","DOI":"10.1109\/ALLERTON.2009.5394810"},{"key":"155_CR37","doi-asserted-by":"crossref","unstructured":"Jafari Siavoshani, M., Diggavi, S., Fragouli, C., Kiran Pulleti, U., Argyraki, K.: Group secret key generation over broadcast erasure channels. In: Proceedings of Asilomar Conference on Signals, Systems, and Computers, pp. 719\u2013723 (2010).","DOI":"10.1109\/ACSSC.2010.5757657"},{"key":"155_CR38","doi-asserted-by":"crossref","unstructured":"Jaggi S., Cassuto Y., Effros M.: Low complexity encoding for network codes. In: International Symposium on Information Theory (ISIT) (2006).","DOI":"10.1109\/ISIT.2006.261594"},{"key":"155_CR39","unstructured":"Kim M., Medard M.: Algebraic network coding approach to deterministic wireless relay networks. arXiv:1001.4431 ."},{"key":"155_CR40","doi-asserted-by":"crossref","unstructured":"Koetter R., M\u00e9dard M.: An algebraic approach to network coding. IEEE\/ACM Trans. Netw. 11(5), 782\u2013795 (2003).","DOI":"10.1109\/TNET.2003.818197"},{"key":"155_CR41","doi-asserted-by":"crossref","unstructured":"Leung-Yan-Cheong S., Hellman M.E.: The Gaussian wire-tap channel. IEEE Trans. Inf. Theory 24(4), 451\u2013456 (1978).","DOI":"10.1109\/TIT.1978.1055917"},{"key":"155_CR42","doi-asserted-by":"crossref","unstructured":"Liang Y., Poor H.V., Shamai S.: Information theoretic security. Found. Trends Commun. Inf. Theory 5(4\u20135), 355\u2013580 (2009).","DOI":"10.1561\/0100000036"},{"key":"155_CR43","doi-asserted-by":"crossref","unstructured":"Maurer U.: Secret key agreement by public discussion from common information. IEEE Trans. Inf. Theory 39(3), 733\u2013742 (1993).","DOI":"10.1109\/18.256484"},{"key":"155_CR44","doi-asserted-by":"crossref","unstructured":"Maurer U., Wolf S.: Information-theoretic key agreement: from weak to strong secrecy for free. In: Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), pp. 351\u2013368. Springer, Berlin (2000).","DOI":"10.1007\/3-540-45539-6_24"},{"key":"155_CR45","unstructured":"Mishra S., Fragouli C., Prabhakaran V., Diggavi S.: Using feedback for secrecy over graphs. http:\/\/arxiv.org\/pdf\/1305.3051.pdf ."},{"key":"155_CR46","doi-asserted-by":"crossref","unstructured":"Ozarow L.H., Wyner A.D.: The wire-tap channel II. Bell Syst. Tech. J. 63, 2135\u20132157 (1984).","DOI":"10.1002\/j.1538-7305.1984.tb00072.x"},{"key":"155_CR47","doi-asserted-by":"crossref","unstructured":"Papadopoulos A., Czap L., Fragouli C.: Secret message capacity of a line network. In: Annual Allerton Conference on Communication, Control and Computing (Allerton) (2014).","DOI":"10.1109\/ALLERTON.2014.7028611"},{"key":"155_CR48","doi-asserted-by":"crossref","unstructured":"Papadopoulos A., Czap L., Fragouli C.: Lp formulations for secrecy over erasure networks with feedback. In: International Symposium on Information Theory (ISIT) (2015).","DOI":"10.1109\/ISIT.2015.7282596"},{"key":"155_CR49","doi-asserted-by":"crossref","unstructured":"Shannon C.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28, 656\u2013715 (1949).","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"155_CR50","unstructured":"Shi C., Ramamoorthy A.: Fast algorithms for finding unicast capacity of linear deterministic wireless relay networks. CoRR, abs\/0909.5507 (2009)."},{"key":"155_CR51","doi-asserted-by":"crossref","unstructured":"Silva D., Kschischang F.R.: Security for wiretap networks via rank-metric codes. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 176\u2013180 (2008).","DOI":"10.1109\/ISIT.2008.4594971"},{"key":"155_CR52","doi-asserted-by":"crossref","unstructured":"Silver D.S., Kovacs I., Williams S.G.: Determinants of commuting-block matrices. Am. Math. Mon. 106(10), 950\u2013952 (1999).","DOI":"10.2307\/2589750"},{"key":"155_CR53","doi-asserted-by":"crossref","unstructured":"Sun Q., Yang X., Long K., Li Z.: Constructing multicast networks where vector linear coding outperforms scalar linear coding. In: International Symposium on Information Theory (ISIT) (2015).","DOI":"10.1109\/ISIT.2015.7282933"},{"key":"155_CR54","doi-asserted-by":"crossref","unstructured":"Tabatabaei Yazdi S., Savari S.: A combinatorial study of linear deterministic relay networks. arXiv:0909.5507v1 (2011).","DOI":"10.1109\/ITWKSPS.2010.5503185"},{"key":"155_CR55","doi-asserted-by":"crossref","unstructured":"Wyner A.D.: The wire-tap channel. Bell Syst. Tech. J. 54(8), 1355\u20131387 (1975).","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"155_CR56","doi-asserted-by":"crossref","unstructured":"Yan M., Sprintson A.: Algorithms for weakly secure data exchange. In: Proceedings of 2013 International Symposium on Network Coding (NetCod), pp. 1\u20136 (2013).","DOI":"10.1109\/NetCod.2013.6570836"},{"key":"155_CR57","doi-asserted-by":"crossref","unstructured":"Yan M., Sprintson A., Zelenko I.: Weakly secure data exchange with generalized reed solomon codes. In: Proceedings of 2014 IEEE International Symposium on Information Theory (ISIT), pp. 1366\u20131370 (2014).","DOI":"10.1109\/ISIT.2014.6875056"},{"key":"155_CR58","doi-asserted-by":"crossref","unstructured":"Yeung R.W., Cai N.: On the optimality of a construction of secure network codes. In: IEEE International Symposium on Information Theory (ISIT), pp. 166\u2013170 (2008).","DOI":"10.1109\/ISIT.2008.4594969"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0155-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0155-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0155-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T21:54:10Z","timestamp":1653774850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0155-6"}},"subtitle":["A theoretical minimum and some open problems"],"short-title":[],"issued":{"date-parts":[[2015,12,10]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["155"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0155-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,10]]}}}