{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:39:14Z","timestamp":1764783554229},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,11,10]],"date-time":"2013-11-10T00:00:00Z","timestamp":1384041600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s12083-013-0239-x","type":"journal-article","created":{"date-parts":[[2013,11,9]],"date-time":"2013-11-09T08:42:45Z","timestamp":1383986565000},"page":"572-589","source":"Crossref","is-referenced-by-count":5,"title":["An efficient ECC-based mechanism for securing network coding-based P2P content distribution"],"prefix":"10.1007","volume":"7","author":[{"given":"Heng","family":"He","sequence":"first","affiliation":[]},{"given":"Ruixuan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Zhiyong","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Weijun","family":"Xiao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,10]]},"reference":[{"key":"239_CR1","first-page":"2235","volume":"2005","author":"C Gkantsidis","year":"2005","unstructured":"Gkantsidis C, Rodriguez P (2005) Network coding for large scale content distribution. Proc IEEE INFOCOM 2005:2235\u20132245","journal-title":"Proc IEEE INFOCOM"},{"issue":"4","key":"239_CR2","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede R, Cai N, Li SR, Yeung RW (2000) Network information flow. IEEE Trans Inf Theory 46(4):1204\u20131216","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"239_CR3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1109\/JSAC.2003.818801","volume":"22","author":"Y Zhu","year":"2004","unstructured":"Zhu Y, Li B, Guo J (2004) Multicast with network coding in application layer overlay networks. IEEE J Sel Areas Commun 22(1):107\u2013120","journal-title":"IEEE J Sel Areas Commun"},{"issue":"6","key":"239_CR4","doi-asserted-by":"crossref","first-page":"2649","DOI":"10.1109\/TIT.2006.874396","volume":"52","author":"D Petrovic","year":"2006","unstructured":"Petrovic D, Ramchandran K, Rabaey J (2006) Overcoming untuned radios in wireless networks with network coding. IEEE Trans Inf Theory 52(6):2649\u20132657","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"239_CR5","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1109\/TNET.2008.923722","volume":"16","author":"S Katti","year":"2008","unstructured":"Katti S, Rahul H, Hu W, Katabi D, Medard W, Crowcroft J (2008) Xors in the air: practical wireless network coding. IEEE\/ACM Trans Networking 16(3):497\u2013510","journal-title":"IEEE\/ACM Trans Networking"},{"key":"239_CR6","first-page":"1","volume":"2006","author":"C Gkantsidis","year":"2006","unstructured":"Gkantsidis C, Rodriguez P (2006) Cooperative security for network coding file distribution. Proceedings IEEE INFOCOM 2006:1\u201313","journal-title":"Proceedings IEEE INFOCOM"},{"key":"239_CR7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/1073814.1073824","volume":"2005","author":"K Jain","year":"2005","unstructured":"Jain K, Lovasz L, Chou PA (2005) Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding. Proc ACM Symp Princ Distrib Comput 2005:51\u201359","journal-title":"Proc ACM Symp Princ Distrib Comput"},{"key":"239_CR8","first-page":"5591","volume":"2008","author":"T Small","year":"2008","unstructured":"Small T, Li B, Liang B (2008) Topology affects the efficiency of network coding in peer-to-peer networks. Proc IEEE ICC 2008:5591\u20135597","journal-title":"Proc IEEE ICC"},{"key":"239_CR9","first-page":"1","volume":"2010","author":"Q Wang","year":"2010","unstructured":"Wang Q, Vu L, Nahrstedt K, Khurana H (2010) Identifying malicious nodes in network-coding-based peer-to-peer streaming networks. Proc IEEE INFOCOM 2010:1\u20135","journal-title":"Proc IEEE INFOCOM"},{"key":"239_CR10","first-page":"2070","volume":"2010","author":"Z Liu","year":"2010","unstructured":"Liu Z, Wu C, Li B, Zhao S (2010) UUSee: large-scale operational on-demand streaming with random network coding. Proc IEEE INFOCOM 2010:2070\u20132078","journal-title":"Proc IEEE INFOCOM"},{"key":"239_CR11","first-page":"936","volume":"2011","author":"F Liu","year":"2011","unstructured":"Liu F, Shen S, Li B, Li B, Yin H, Li S (2011) Novasky: cinematic-quality VoD in a P2P storage cloud. Proc IEEE INFOCOM 2011:936\u2013944","journal-title":"Proc IEEE INFOCOM"},{"issue":"3","key":"239_CR12","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1109\/JPROC.2010.2091930","volume":"99","author":"B Li","year":"2011","unstructured":"Li B, Niu D (2011) Random network coding in peer-to-peer networks: from theory to practice. Proc IEEE 99(3):513\u2013523","journal-title":"Proc IEEE"},{"key":"239_CR13","first-page":"226","volume":"2004","author":"M Krohn","year":"2004","unstructured":"Krohn M, Freedman M, Mazieres D (2004) On-the-fly verification of rateless erasure codes for efficient content distribution. Proc IEEE Symp Secur Priv 2004:226\u2013240","journal-title":"Proc IEEE Symp Secur Priv"},{"key":"239_CR14","first-page":"1224","volume":"2009","author":"E Kehdi","year":"2009","unstructured":"Kehdi E, Li B (2009) Null Keys: limiting malicious attacks via null space properties of network coding. Proc IEEE INFOCOM 2009:1224\u20131232","journal-title":"Proc IEEE INFOCOM"},{"key":"239_CR15","first-page":"1409","volume":"2008","author":"Z Yu","year":"2008","unstructured":"Yu Z, Wei T, Ramkumar B, Guan Y (2008) An efficient signature-based scheme for securing network coding against pollution attacks. Proc IEEE INFOCOM 2008:1409\u20131417","journal-title":"Proc IEEE INFOCOM"},{"issue":"1","key":"239_CR16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1504\/IJICOT.2009.024044","volume":"1","author":"D Charles","year":"2009","unstructured":"Charles D, Jain K, Lauter K (2009) Signatures for network coding. Int J Inf Coding Theory 1(1):3\u201314","journal-title":"Int J Inf Coding Theory"},{"key":"239_CR17","first-page":"68","volume":"2009","author":"D Boneh","year":"2009","unstructured":"Boneh D, Freeman D, Katz J, Waters B (2009) Signing a linear subspace: signature schemes for network coding. Proc PKC 2009:68\u201387","journal-title":"Proc PKC"},{"key":"239_CR18","first-page":"292","volume":"2009","author":"S Agrawal","year":"2009","unstructured":"Agrawal S, Boneh D (2009) Homomorphic MACs: MAC-based integrity for network coding. Proc ACNS 2009:292\u2013305","journal-title":"Proc ACNS"},{"key":"239_CR19","first-page":"2258","volume":"2010","author":"Y Li","year":"2010","unstructured":"Li Y, Yao H, Chen M, Jaggi S, Rosen A (2010) RIPPLE authentication for network coding. Proc IEEE INFOCOM 2010:2258\u20132266","journal-title":"Proc IEEE INFOCOM"},{"issue":"6","key":"239_CR20","doi-asserted-by":"crossref","first-page":"2596","DOI":"10.1109\/TIT.2008.921711","volume":"54","author":"S Jaggi","year":"2008","unstructured":"Jaggi S, Langberg M, Katti S, Ho T, Katabi D, Medard M (2008) Resilient network coding in the presence of Byzantine adversaries. IEEE Trans Inf Theory 54(6):2596\u20132603","journal-title":"IEEE Trans Inf Theory"},{"issue":"8","key":"239_CR21","doi-asserted-by":"crossref","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R Koetter","year":"2008","unstructured":"Koetter R, Kschischang FR (2008) Coding for errors and erasures in random network coding. IEEE Trans Inf Theory 54(8):3579\u20133591","journal-title":"IEEE Trans Inf Theory"},{"key":"239_CR22","first-page":"1026","volume":"2011","author":"P Zhang","year":"2011","unstructured":"Zhang P, Jiang Y, Lin C, Yao H, Wasef A, Shen X (2011) Padding for orthogonality: efficient subspace authentication for network coding. Proc IEEE INFOCOM 2011:1026\u20131034","journal-title":"Proc IEEE INFOCOM"},{"key":"239_CR23","volume-title":"Guide to Elliptic Curve Cryptography","author":"H Darrel","year":"2004","unstructured":"Darrel H, Alfred M, Scott V (2004) Guide to Elliptic Curve Cryptography. Springer, New York"},{"issue":"2","key":"239_CR24","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s12083-011-0113-7","volume":"5","author":"DS Touceda","year":"2012","unstructured":"Touceda DS, Sierra JM, Soriano M (2012) Decentralized certification scheme for secure admission in on-the-fly peer-to-peer systems. Peer-to-Peer Netw Appl 5(2):105\u2013124","journal-title":"Peer-to-Peer Netw Appl"},{"key":"239_CR25","first-page":"640","volume":"2003","author":"S Kamvar","year":"2003","unstructured":"Kamvar S, Schlosser M, Molina HG (2003) The Eigentrust algorithm for reputation management in P2P networks. In Proceedings of WWW 2003:640\u2013651","journal-title":"In Proceedings of WWW"},{"key":"239_CR26","first-page":"1586","volume":"2007","author":"C Costa","year":"2007","unstructured":"Costa C, Soares V, Almeida J, Almeida V (2007) Fighting pollution dissemination in peer-to-peer networks. Proc ACM Symp Appl Comput 2007:1586\u20131590","journal-title":"Proc ACM Symp Appl Comput"},{"key":"239_CR27","doi-asserted-by":"crossref","unstructured":"Walsh K, Sirer EG (2005) Fighting peer-to-peer SPAM and decoys with object reputation. In Proceedings of the ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems, 2005:138\u2013143","DOI":"10.1145\/1080192.1080204"},{"key":"239_CR28","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/586110.586138","volume":"2002","author":"E Damiani","year":"2002","unstructured":"Damiani E, Vimercati S, Paraboschi S, Samarati P, Violante F (2002) A reputation-based approach for choosing reliable resources in peer-to-peer networks. Proc ACM Conf Comput Commun Secur 2002:207\u2013216","journal-title":"Proc ACM Conf Comput Commun Secur"},{"key":"239_CR29","first-page":"354","volume":"2002","author":"P Barreto","year":"2002","unstructured":"Barreto P, Kim H, Lynn B, Scott M (2002) Efficient algorithms for pairing-based cryptosystems. Proc CRYPTO 2002:354\u2013368","journal-title":"Proc CRYPTO"},{"issue":"4","key":"239_CR30","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D Boneh","year":"2004","unstructured":"Boneh D, Lynn B, Shacham H (2004) Short signatures from the Weil pairing. J Cryptol 17(4):297\u2013319","journal-title":"J Cryptol"},{"key":"239_CR31","doi-asserted-by":"crossref","unstructured":"Montresor A, Jelasity M (2009). PeerSim: A scalable P2P simulator. In Proceedings of the IEEE International Conference on Peer-to-Peer Computing, IEEE Computer Society, Washington, DC, 2009, 99\u2013100","DOI":"10.1109\/P2P.2009.5284506"},{"key":"239_CR32","first-page":"856","volume":"2009","author":"K Zhao","year":"2009","unstructured":"Zhao K, Chu X, Wang M, Jiang Y (2009) Speeding up homomorpic hashing using GPUs. Proc IEEE ICC 2009:856\u2013860","journal-title":"Proc IEEE ICC"},{"issue":"2","key":"239_CR33","first-page":"2","volume":"5","author":"A Perrig","year":"2002","unstructured":"Perrig A, Canetti R, Tygar JD, Song D (2002) The TESLA broadcast authentication protocol. RSA Cryptobytes 5(2):2\u201313","journal-title":"RSA Cryptobytes"},{"key":"239_CR34","first-page":"1","volume":"2008","author":"M Jafarisiavoshani","year":"2008","unstructured":"Jafarisiavoshani M, Fragouli C, Diggavi S (2008) On locating Byzantine attackers. Proc Netw Coding Work Theory Appl 2008:1\u20136","journal-title":"Proc Netw Coding Work Theory Appl"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-013-0239-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12083-013-0239-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-013-0239-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T09:49:07Z","timestamp":1688636947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12083-013-0239-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,10]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["239"],"URL":"https:\/\/doi.org\/10.1007\/s12083-013-0239-x","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,10]]}}}