{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T04:04:52Z","timestamp":1743998692500,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642332715"},{"type":"electronic","value":"9783642332722"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33272-2_20","type":"book-chapter","created":{"date-parts":[[2012,8,22]],"date-time":"2012-08-22T13:45:33Z","timestamp":1345643133000},"page":"300-317","source":"Crossref","is-referenced-by-count":3,"title":["Revisiting a Secret Sharing Approach to Network Codes"],"prefix":"10.1007","author":[{"given":"Zhaohui","family":"Tang","sequence":"first","affiliation":[]},{"given":"Hoon Wei","family":"Lim","sequence":"additional","affiliation":[]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"20_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R. Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.Y.R., Yeung, R.W.: Network information flow. IEEE Trans. on Information Theory\u00a046(4), 1204\u20131216 (2000)","journal-title":"IEEE Trans. on Information Theory"},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"S.Y.R. Li","year":"2003","unstructured":"Li, S.Y.R., Yeung, R.W., Cai, N.: Linear network coding. IEEE Trans. on Information Theory\u00a049(2), 371\u2013381 (2003)","journal-title":"IEEE Trans. on Information Theory"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Carr, B., Vempala, S.: Randomized meta-rounding. In: Proc. 32nd ACM Symp. Theory of Computing, pp. 58\u201362 (May 2000)","DOI":"10.1145\/335305.335312"},{"key":"20_CR4","unstructured":"Jain, K., Mahdian, M., Salavatipour, M.R.: Packing Steiner trees. In: Proc. 14th ACM-SIAM Symposium on Discrete Algorithms (SODA) (January 2003)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Fragouli, C., Soljanin, E.: Network Coding Fundamentals. Now Publishers Inc. (2007)","DOI":"10.1561\/9781601980335"},{"key":"20_CR6","unstructured":"Chou, P., Wu, Y., Jain, K.: Practical Network Coding. In: Allerton Conference on Communication, Control and Computing (2003)"},{"key":"20_CR7","unstructured":"Avalanche: File swarming with network coding, http:\/\/research.microsoft.com\/pablo\/avalanche.aspx"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Shannon, C.E.: Communication theory of secrecy system. Bell Syst. Techn. J., 656\u2013715 (1949)","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"20_CR9","unstructured":"Gkantsidis, C., Rodriguez, P.: Network coding for large scale content distribution. In: IEEE INFOCOM (2005)"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Gkantsidis, C., Miller, J., Rodriguez, P.: Comprehensive view of a live network coding P2P system. In: ACM SIGCOM Conference on Internet Measurements (2006)","DOI":"10.1145\/1177080.1177104"},{"key":"20_CR11","unstructured":"Chen, H.: Distributed File Sharing: Network Coding Meets Compressed Sensing. In: IEEE CHINACOM (2008)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Dimakis, A.G., Godfrey, P.B., Wainwright, M.J., Ramchandran, K.: Network Coding for Distributed Storage Systems. In: IEEE INFOCOM (2007)","DOI":"10.1109\/INFCOM.2007.232"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Dong, J., Curtmola, R., Sethi, R., Nita-Rotaru, C.: Toward secure network coding in wireless networks: Threats and challenges. In: NPSec (2008)","DOI":"10.1109\/NPSEC.2008.4664878"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-00468-1_5","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"D. Boneh","year":"2009","unstructured":"Boneh, D., Freeman, D., Katz, J., Waters, B.: Signing a Linear Subspace: Signature Schemes for Network Coding. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol.\u00a05443, pp. 68\u201387. Springer, Heidelberg (2009)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-01957-9_18","volume-title":"Applied Cryptography and Network Security","author":"S. Agrawal","year":"2009","unstructured":"Agrawal, S., Boneh, D.: Homomorphic MACs: MAC-Based Integrity for Network Coding. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol.\u00a05536, pp. 292\u2013305. Springer, Heidelberg (2009)"},{"key":"20_CR16","unstructured":"Oggier, F., Fathi, H.: An Authentication Code against Pollution Attacks in Network Coding. CoRR abs\/0909.3146 (2009)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Jaggi, S., Langberg, M., Katti, S., Ho, T., Katabi, D., Medard, M.: Resilient network coding in the presence of Byzantine adversaries. In: Proc. 26th Annual IEEE Conf. on Computer Commun., INFOCOM, pp. 616\u2013624 (2007)","DOI":"10.1109\/INFCOM.2007.78"},{"issue":"8","key":"20_CR18","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R. Kotter","year":"2008","unstructured":"Kotter, R., Kschischang, F.R.: Coding for errors and erasures in random network coding. IEEE Trans. on Information Theory\u00a054(8), 3579\u20133591 (2008)","journal-title":"IEEE Trans. on Information Theory"},{"key":"20_CR19","unstructured":"Cai, N., Yeung, R.W.: Network coding and error correction. In: Proc. 2002 IEEE Inform. Theory Workshop, pp. 119\u2013122 (October 2002)"},{"key":"20_CR20","unstructured":"Bhattad, K., Narayanan, K.R.: Weakly secure network coding. In: Proc. NetCod (April 2005)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Wei, Y., Yu, Z., Guan, Y.: Efficient Weakly-Secure Network Coding Schemes against Wiretapping Attacks. In: Proc. NetCod (June 2010)","DOI":"10.1109\/NETCOD.2010.5487671"},{"issue":"1","key":"20_CR22","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1109\/TIT.2010.2090197","volume":"57","author":"N. Cai","year":"2011","unstructured":"Cai, N., Yeung, R.W.: Secure Network Coding on a Wiretap Network. IEEE Trans. on Information Theory\u00a057(1), 424\u2013435 (2011)","journal-title":"IEEE Trans. on Information Theory"},{"key":"20_CR23","unstructured":"Feldman, J., Malkin, T., Stein, C., Servedio, R.A.: Secure network coding via filtered secret sharing. In: Proc. 42nd Annual Allerton Conf. Commun., Control and Comput. (September 2004)"},{"issue":"3","key":"20_CR24","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1109\/TIT.2011.2173631","volume":"58","author":"S.Y.E. Rouayheb","year":"2012","unstructured":"Rouayheb, S.Y.E., Soljanin, E.: Secure Network Coding for Wiretap Networks of Type II. IEEE Trans. on Information Theory\u00a058(3), 1361\u20131371 (2012)","journal-title":"IEEE Trans. on Information Theory"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Silva, D., Kschischang, F.R.: Security for wiretap networks via rank-metric codes. In: IEEE International Symposium on Information Theory (July 2008)","DOI":"10.1109\/ISIT.2008.4594971"},{"key":"20_CR26","doi-asserted-by":"crossref","unstructured":"Shioji, E., Matsumoto, R., Uyematsu, T.: Vulnerability of MRD-code-based universal secure network coding against stronger eavesdroppers. In: Proc. 2010 IEEE ISIT, pp. 2433\u20132437 (June 2010)","DOI":"10.1109\/ISIT.2010.5513791"},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-39757-4_5","volume-title":"Advances in Cryptology","author":"L.H. Ozarow","year":"1985","unstructured":"Ozarow, L.H., Wyner, A.D.: Wire-Tap Channel II. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol.\u00a0209, pp. 33\u201350. Springer, Heidelberg (1985)"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptography keys. In: Proc. of the 1979 AFIPS national Computer Conference, vol.\u00a048, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Ho, T., Koetter, R., M\u00e9dard, M., Karger, D.R., Effros, M.: The benefits of coding over routing in a randomized setting. In: IEEE International Symposium on Information Theory (June 2003)","DOI":"10.1109\/ISIT.2003.1228459"},{"key":"20_CR30","unstructured":"Jaggi, S., Sanders, P., Chou, P.A., Effros, M., Egner, S., Jain, K., Tolhuizen, L.: Polynomial time algorithms for multicast network code construction. IEEE Wireless Communications, 68\u201371 (February 2004)"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Fragouli, C., Soljanin, E.: Information flow decomposition for network coding. IEEE Trans. on Information Theory, 829\u2013848 (March 2006)","DOI":"10.1109\/TIT.2005.864435"},{"issue":"6","key":"20_CR32","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1109\/TIT.2006.874434","volume":"52","author":"M. Langberg","year":"2006","unstructured":"Langberg, M., Sprintson, A., Bruck, J.: The encoding complexity of network coding. IEEE Trans. on Information Theory\u00a052(6), 2386\u20132397 (2006)","journal-title":"IEEE Trans. on Information Theory"},{"issue":"1","key":"20_CR33","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TIT.2008.2008135","volume":"55","author":"M. Langberg","year":"2009","unstructured":"Langberg, M., Sprintson, A., Bruck, J.: Network coding: A computational perspective. IEEE Trans. on Information Theory\u00a055(1), 147\u2013157 (2009)","journal-title":"IEEE Trans. on Information Theory"},{"key":"20_CR34","doi-asserted-by":"crossref","unstructured":"Shamir, A.: How to share a secret. Communications of the ACM, 612\u2013613 (1979)","DOI":"10.1145\/359168.359176"},{"key":"20_CR35","first-page":"235","volume":"2","author":"D.R. Stinson","year":"1992","unstructured":"Stinson, D.R.: An explication of secret sharing schemes. Designs, Codes and Cryptography\u00a02, 235\u2013390 (1992)","journal-title":"Designs, Codes and Cryptography"},{"key":"20_CR36","series-title":"LNCS","first-page":"242","volume-title":"CRYPTO 1984","author":"G.R. Blakley","year":"1985","unstructured":"Blakley, G.R., Meadows, C.: The Security of RAMP Schemes. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 242\u2013268. Springer, Heidelberg (1985)"},{"issue":"6","key":"20_CR37","doi-asserted-by":"publisher","first-page":"2608","DOI":"10.1109\/TIT.2006.874523","volume":"52","author":"D.S. Lun","year":"2006","unstructured":"Lun, D.S., Ratnakar, N., Medard, M., Koetter, R., Karger, D.R., Ho, T., Ahmed, E., Zhao, F.: Minimum-cost multicast over coded packet networks. IEEE Trans. on Information Theory\u00a052(6), 2608\u20132623 (2006)","journal-title":"IEEE Trans. on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33272-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T02:44:15Z","timestamp":1743993855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33272-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642332715","9783642332722"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33272-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}