[ { "key": "QW8RPAKB", "version": 1982, "library": { "type": "group", "id": 8225, "name": "active attack with network coding", "links": { "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/8225/items/QW8RPAKB", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding/items/QW8RPAKB", "type": "text/html" }, "up": { "href": "https://api.zotero.org/groups/8225/items/6QB7WRAI", "type": "application/json" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } } }, "data": { "key": "QW8RPAKB", "version": 1982, "parentItem": "6QB7WRAI", "itemType": "attachment", "linkMode": "linked_url", "title": "IEEE Xplore Abstract Record", "accessDate": "2014-12-28T10:15:29Z", "url": "http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6857127&url=http%3A%2F%2Fieeexplore.ieee.org%2Fiel7%2F6850208%2F6857077%2F06857127.pdf%3Farnumber%3D6857127", "note": "", "contentType": "text/html", "charset": "", "tags": [], "relations": {}, "dateAdded": "2014-12-28T10:15:29Z", "dateModified": "2014-12-28T10:15:29Z" } }, { "key": "6QB7WRAI", "version": 1982, "library": { "type": "group", "id": 8225, "name": "active attack with network coding", "links": { "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/8225/items/6QB7WRAI", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding/items/6QB7WRAI", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Wang et al.", "parsedDate": "2014-06", "numChildren": 1 }, "data": { "key": "6QB7WRAI", "version": 1982, "itemType": "conferencePaper", "title": "An optimal Cache management framework for information-centric networks with network coding", "creators": [ { "creatorType": "author", "firstName": "Jin", "lastName": "Wang" }, { "creatorType": "author", "firstName": "Jing", "lastName": "Ren" }, { "creatorType": "author", "firstName": "Kejie", "lastName": "Lu" }, { "creatorType": "author", "firstName": "Jianping", "lastName": "Wang" }, { "creatorType": "author", "firstName": "Shucheng", "lastName": "Liu" }, { "creatorType": "author", "firstName": "C.", "lastName": "Westphal" } ], "abstractNote": "The increasing demand for media-rich content has driven many efforts to redesign the Internet architecture. As one of the major candidates, information-centric network (ICN) has attracted significant attention, where in-network cache is a key component in different ICN architectures. In this paper, we propose a novel framework for optimal cache management in ICNs which jointly considers caching strategy and content routing. Specifically, we propose a cache management framework for ICNs based on software-defined networking (SDN) where a controller is responsible for determining the optimal caching strategy and content routing via linear network coding (LNC). Under the proposed cache management framework, we formally formulate the problem of minimizing the network bandwidth cost by jointly considering caching strategy and content routing with LNC. We develop an efficient network coding based cache management (NCCM) algorithm to obtain a near-optimal caching and routing solution for ICNs. We further develop a lower bound of the problem and conduct extensive experiments to compare the performance of the NCCM algorithm with the lower bound. Simulation results validate the effectiveness of the NCCM algorithm and framework.", "proceedingsTitle": "Networking Conference, 2014 IFIP", "conferenceName": "Networking Conference, 2014 IFIP", "publisher": "", "place": "", "date": "June 2014", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "1-9", "series": "", "seriesNumber": "", "DOI": "10.1109/IFIPNetworking.2014.6857127", "ISBN": "", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "IEEE Xplore", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "Algorithm design and analysis", "type": 1 }, { "tag": "Bandwidth", "type": 1 }, { "tag": "Educational institutions", "type": 1 }, { "tag": "Internet", "type": 1 }, { "tag": "Internet architecture", "type": 1 }, { "tag": "Manganese", "type": 1 }, { "tag": "Routing", "type": 1 }, { "tag": "Servers", "type": 1 }, { "tag": "cache storage", "type": 1 }, { "tag": "content retrieval", "type": 1 }, { "tag": "content routing", "type": 1 }, { "tag": "in-network cache", "type": 1 }, { "tag": "information-centric network", "type": 1 }, { "tag": "linear network coding", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "network coding based cache management algorithm", "type": 1 }, { "tag": "optimal cache management framework", "type": 1 }, { "tag": "optimal caching strategy", "type": 1 }, { "tag": "software radio", "type": 1 }, { "tag": "software-defined networking", "type": 1 } ], "collections": [], "relations": {}, "dateAdded": "2014-12-28T10:15:29Z", "dateModified": "2014-12-28T10:15:29Z" } }, { "key": "8FIVKCP7", "version": 1, "library": { "type": "group", "id": 8225, "name": "active attack with network coding", "links": { "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/8225/items/8FIVKCP7", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding/items/8FIVKCP7", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Wang et al.", "parsedDate": "2010", "numChildren": 0 }, "data": { "key": "8FIVKCP7", "version": 1, "itemType": "conferencePaper", "title": "Optimal Linear Network Coding Design for Secure Unicast with Multiple Streams", "creators": [ { "creatorType": "author", "firstName": "Jin", "lastName": "Wang" }, { "creatorType": "author", "firstName": "Jianping", "lastName": "Wang" }, { "creatorType": "author", "firstName": "Kejie", "lastName": "Lu" }, { "creatorType": "author", "firstName": "Bin", "lastName": "Xiao" }, { "creatorType": "author", "firstName": "Naijie", "lastName": "Gu" } ], "abstractNote": "", "proceedingsTitle": "Proc.of the 29th Conference on Computer Communications", "conferenceName": "", "publisher": "", "place": "", "date": "2010", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "2240-2248", "series": "", "seriesNumber": "", "DOI": "", "ISBN": "", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "", "callNumber": "", "rights": "", "extra": "", "tags": [], "collections": [], "relations": {}, "dateAdded": "2013-01-06T10:59:11Z", "dateModified": "2013-01-06T10:59:11Z" } }, { "key": "M6RSQUXS", "version": 1, "library": { "type": "group", "id": 8225, "name": "active attack with network coding", "links": { "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/8225/items/M6RSQUXS", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding/items/M6RSQUXS", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Charles et al.", "parsedDate": "2006", "numChildren": 0 }, "data": { "key": "M6RSQUXS", "version": 1, "itemType": "conferencePaper", "title": "Signatures for Network Coding", "creators": [ { "creatorType": "author", "firstName": "D.", "lastName": "Charles" }, { "creatorType": "author", "firstName": "K.", "lastName": "Jain" }, { "creatorType": "author", "firstName": "K.", "lastName": "Lauter" } ], "abstractNote": "This paper presents a practical digital signature scheme to be used in conjunction with network coding. Our scheme simultaneously provides authentication and detects malicious nodes that intentionally corrupt content on the network.", "proceedingsTitle": "Information Sciences and Systems, 2006 40th Annual Conference on", "conferenceName": "Information Sciences and Systems, 2006 40th Annual Conference on", "publisher": "", "place": "", "date": "2006", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "857-863", "series": "", "seriesNumber": "", "DOI": "10.1109/CISS.2006.286587", "ISBN": "", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "IEEE Xplore", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "authentication", "type": 1 }, { "tag": "digital signature scheme", "type": 1 }, { "tag": "encoding", "type": 1 }, { "tag": "network coding", "type": 1 }, { "tag": "packet radio networks", "type": 1 } ], "collections": [], "relations": { "owl:sameAs": "http://zotero.org/groups/2334/items/FD6ZPM2W" }, "dateAdded": "2009-12-04T01:30:28Z", "dateModified": "2009-12-04T01:30:28Z" } }, { "key": "BRTPAT6Q", "version": 1, "library": { "type": "group", "id": 8225, "name": "active attack with network coding", "links": { "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/8225/items/BRTPAT6Q", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding/items/BRTPAT6Q", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Zhao et al.", "parsedDate": "2007", "numChildren": 0 }, "data": { "key": "BRTPAT6Q", "version": 1, "itemType": "journalArticle", "title": "Signatures for content distribution with network coding", "creators": [ { "creatorType": "author", "firstName": "Fang", "lastName": "Zhao" }, { "creatorType": "author", "firstName": "Ton", "lastName": "Kalker" }, { "creatorType": "author", "firstName": "Muriel", "lastName": "Médard" }, { "creatorType": "author", "firstName": "Keesook J", "lastName": "Han" } ], "abstractNote": "", "publicationTitle": "IN PROC. OF INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT", "publisher": "", "place": "", "date": "2007", "volume": "", "issue": "", "section": "", "partNumber": "", "partTitle": "", "pages": "", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "", "DOI": "", "citationKey": "", "url": "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.978", "accessDate": "2009-12-04T01:29:33Z", "PMID": "", "PMCID": "", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "", "callNumber": "", "rights": "", "extra": "", "tags": [], "collections": [], "relations": {}, "dateAdded": "2009-12-04T01:30:28Z", "dateModified": "2009-12-04T01:30:28Z" } }, { "key": "S93HIZ67", "version": 1, "library": { "type": "group", "id": 8225, "name": "active attack with network coding", "links": { "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/8225/items/S93HIZ67", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding/items/S93HIZ67", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Dong et al.", "parsedDate": "2009-11-15", "numChildren": 0 }, "data": { "key": "S93HIZ67", "version": 1, "itemType": "journalArticle", "title": "Secure network coding for wireless mesh networks: Threats, challenges, and directions", "creators": [ { "creatorType": "author", "firstName": "Jing", "lastName": "Dong" }, { "creatorType": "author", "firstName": "Reza", "lastName": "Curtmola" }, { "creatorType": "author", "firstName": "Cristina", "lastName": "Nita-Rotaru" } ], "abstractNote": "In recent years, network coding has emerged as a new communication paradigm that can significantly improve the efficiency of network protocols by requiring intermediate nodes to mix packets before forwarding them. Recently, several real-world systems have been proposed to leverage network coding in wireless networks. Although the theoretical foundations of network coding are well understood, a real-world system needs to solve a plethora of practical aspects before network coding can meet its promised potential. These practical design choices expose network coding systems to a wide range of attacks.\nWe identify two general frameworks (inter-flow and intra-flow) that encompass several network coding-based systems proposed in wireless networks. Our systematic analysis of the components of these frameworks reveals vulnerabilities to a wide range of attacks, which may severely degrade system performance. Then, we identify security goals and design challenges in achieving security for network coding systems. Adequate understanding of both the threats and challenges is essential to effectively design secure practical network coding systems. Our paper should be viewed as a cautionary note pointing out the frailty of current network coding-based wireless systems and a general guideline in the effort of achieving security for network coding systems.", "publicationTitle": "Computer Communications", "publisher": "", "place": "", "date": "November 15, 2009", "volume": "32", "issue": "17", "section": "", "partNumber": "", "partTitle": "", "pages": "1790-1801", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "", "DOI": "10.1016/j.comcom.2009.07.010", "citationKey": "", "url": "http://www.sciencedirect.com/science/article/B6TYP-4WSHK4F-1/2/eb16347cf7f805c4e3daed2421a7afa9", "accessDate": "2009-09-25T12:31:27Z", "PMID": "", "PMCID": "", "ISSN": "0140-3664", "archive": "", "archiveLocation": "", "shortTitle": "Secure network coding for wireless mesh networks", "language": "", "libraryCatalog": "ScienceDirect", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "Network coding attacks", "type": 1 }, { "tag": "Network coding security", "type": 1 }, { "tag": "Wireless network coding", "type": 1 } ], "collections": [], "relations": {}, "dateAdded": "2009-11-28T02:27:19Z", "dateModified": "2009-11-28T02:27:19Z" } }, { "key": "5SIATIAS", "version": 1, "library": { "type": "group", "id": 8225, "name": "active attack with network coding", "links": { "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/8225/items/5SIATIAS", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding/items/5SIATIAS", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Jaggi et al.", "parsedDate": "2007", "numChildren": 0 }, "data": { "key": "5SIATIAS", "version": 1, "itemType": "conferencePaper", "title": "Resilient Network Coding in the Presence of Byzantine Adversaries", "creators": [ { "creatorType": "author", "firstName": "S.", "lastName": "Jaggi" }, { "creatorType": "author", "firstName": "M.", "lastName": "Langberg" }, { "creatorType": "author", "firstName": "S.", "lastName": "Katti" }, { "creatorType": "author", "firstName": "T.", "lastName": "Ho" }, { "creatorType": "author", "firstName": "D.", "lastName": "Katabi" }, { "creatorType": "author", "firstName": "M.", "lastName": "Medard" } ], "abstractNote": "Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up contaminating all the information reaching a destination, preventing decoding. This paper introduces the first distributed polynomial-time rate-optimal network codes that work in the presence of Byzantine nodes. We present algorithms that target adversaries with different attacking capabilities. When the adversary can eavesdrop on all links and jam zO links , our first algorithm achieves a rate of C - 2zO, where C is the network capacity. In contrast, when the adversary has limited snooping capabilities, we provide algorithms that achieve the higher rate of C - zO. Our algorithms attain the optimal rate given the strength of the adversary. They are information-theoretically secure. They operate in a distributed manner, assume no knowledge of the topology, and can be designed and implemented in polynomial-time. Furthermore, only the source and destination need to be modified; non-malicious nodes inside the network are oblivious to the presence of adversaries and implement a classical distributed network code. Finally, our algorithms work over wired and wireless networks.", "proceedingsTitle": "Proceedings of IEEE INFOCOM 2007, the 26th Conference on Computer Communications", "conferenceName": "IEEE INFOCOM 2007, the 26th Conference on Computer Communications", "publisher": "", "place": "", "date": "2007", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "616-624", "series": "", "seriesNumber": "", "DOI": "10.1109/INFCOM.2007.78", "ISBN": "0743-166X", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "IEEE Xplore", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "Byzantine nodes", "type": 1 }, { "tag": "communication complexity", "type": 1 }, { "tag": "distributed network code", "type": 1 }, { "tag": "distributed polynomial-time rate-optimal network codes", "type": 1 }, { "tag": "encoding", "type": 1 }, { "tag": "nonmalicious nodes", "type": 1 }, { "tag": "resilient network coding", "type": 1 }, { "tag": "telecommunication security", "type": 1 } ], "collections": [], "relations": {}, "dateAdded": "2009-11-28T02:27:19Z", "dateModified": "2009-11-28T02:27:19Z" } }, { "key": "79AFRTUP", "version": 1, "library": { "type": "group", "id": 8225, "name": "active attack with network coding", "links": { "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/8225/items/79AFRTUP", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding/items/79AFRTUP", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Krohn et al.", "parsedDate": "2004", "numChildren": 0 }, "data": { "key": "79AFRTUP", "version": 1, "itemType": "conferencePaper", "title": "On-the-fly verification of rateless erasure codes for efficient content distribution", "creators": [ { "creatorType": "author", "firstName": "M.N.", "lastName": "Krohn" }, { "creatorType": "author", "firstName": "M.J.", "lastName": "Freedman" }, { "creatorType": "author", "firstName": "D.", "lastName": "Mazieres" } ], "abstractNote": "The quality of peer-to-peer content distribution can suffer when malicious participants intentionally corrupt content. Some systems using simple block-by-block downloading can verify blocks with traditional cryptographic signatures and hashes, but these techniques do not apply well to more elegant systems that use rateless erasure codes for efficient multicast transfers. This paper presents a practical scheme, based on homomorphic hashing, that enables a downloader to perform on-the-fly verification of erasure-encoded blocks.", "proceedingsTitle": "Proceedings of IEEE Symposium on Security and Privacy 2004", "conferenceName": "IEEE Symposium on Security and Privacy 2004", "publisher": "", "place": "", "date": "2004", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "226-240", "series": "", "seriesNumber": "", "DOI": "10.1109/SECPRI.2004.1301326", "ISBN": "1081-6011", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "IEEE Xplore", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "authorisation", "type": 1 }, { "tag": "block-by-block downloading", "type": 1 }, { "tag": "cryptographic hashes", "type": 1 }, { "tag": "cryptographic signatures", "type": 1 }, { "tag": "cryptography", "type": 1 }, { "tag": "data communication", "type": 1 }, { "tag": "document handling", "type": 1 }, { "tag": "erasure-encoded blocks", "type": 1 }, { "tag": "homomorphic hashing", "type": 1 }, { "tag": "mobile computing", "type": 1 }, { "tag": "on-the-fly verification", "type": 1 }, { "tag": "peer-to-peer content distribution", "type": 1 }, { "tag": "program verification", "type": 1 }, { "tag": "rateless erasure codes", "type": 1 } ], "collections": [], "relations": {}, "dateAdded": "2009-11-28T02:27:19Z", "dateModified": "2009-11-28T02:27:19Z" } }, { "key": "ARWEMD96", "version": 1, "library": { "type": "group", "id": 8225, "name": "active attack with network coding", "links": { "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/8225/items/ARWEMD96", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding/items/ARWEMD96", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Kehdi and Baochun Li", "parsedDate": "2009", "numChildren": 0 }, "data": { "key": "ARWEMD96", "version": 1, "itemType": "conferencePaper", "title": "Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding", "creators": [ { "creatorType": "author", "firstName": "E.", "lastName": "Kehdi" }, { "creatorType": "author", "firstName": "", "lastName": "Baochun Li" } ], "abstractNote": "The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error correcting codes by generalizing some well known bounds in coding theory. Such codes are based on introducing redundancy in space domain. Other approaches require the use of homomorphic hashing functions, which are computationally expensive. In this paper, we present a novel and computationally efficient security algorithm, referred to as Null Keys, to detect and contain malicious attacks based on the subspace properties of random linear network coding. The participating nodes verify the integrity of a block by checking if it belongs to the subspace spanned by the source blocks. This is possible when every node has a vector orthogonal to all the combinations of the source blocks. These vectors, referred to as null keys, belong to the null space of the source blocks and go through a random combination when distributed by the source. Unlike previous security approaches, our Null Keys algorithm allows nodes to rapidly detect corrupted blocks without changing the code or imposing redundancy on the exchanged data. We analytically evaluate the pollution produced by jamming attacks, and demonstrate the effectiveness of Null Keys by varying the strength of the malicious nodes. We also show, through extensive simulations, that the Null Keys approach is more effective than cooperative security using homomorphic hashing when it comes to limiting the pollution spread.", "proceedingsTitle": "INFOCOM 2009, IEEE", "conferenceName": "INFOCOM 2009, IEEE", "publisher": "", "place": "", "date": "2009", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "1224-1232", "series": "", "seriesNumber": "", "DOI": "10.1109/INFCOM.2009.5062036", "ISBN": "0743-166X", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "IEEE Xplore", "archiveLocation": "", "shortTitle": "Null Keys", "language": "", "libraryCatalog": "", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "block codes", "type": 1 }, { "tag": "block integrity verification", "type": 1 }, { "tag": "cryptography", "type": 1 }, { "tag": "homomorphic hashing", "type": 1 }, { "tag": "malicious attack detection", "type": 1 }, { "tag": "null key security algorithm", "type": 1 }, { "tag": "null space property", "type": 1 }, { "tag": "random codes", "type": 1 }, { "tag": "randomized network coding", "type": 1 }, { "tag": "telecommunication security", "type": 1 } ], "collections": [], "relations": {}, "dateAdded": "2009-11-28T02:27:19Z", "dateModified": "2009-11-28T02:27:19Z" } }, { "key": "PR69Z5IX", "version": 1, "library": { "type": "group", "id": 8225, "name": "active attack with network coding", "links": { "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/8225/items/PR69Z5IX", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding/items/PR69Z5IX", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Gkantsidis and Rodriguez", "parsedDate": "2006", "numChildren": 0 }, "data": { "key": "PR69Z5IX", "version": 1, "itemType": "conferencePaper", "title": "Cooperative Security for Network Coding File Distribution", "creators": [ { "creatorType": "author", "firstName": "C.", "lastName": "Gkantsidis" }, { "creatorType": "author", "firstName": "P. Rodriguez", "lastName": "Rodriguez" } ], "abstractNote": "", "proceedingsTitle": "Proceedings of INFOCOM 2006, the 25th IEEE International Conference on Computer Communications", "conferenceName": "IEEE INFOCOM 2006, the 25th IEEE International Conference on Computer Communications", "publisher": "", "place": "", "date": "2006", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "1-13", "series": "", "seriesNumber": "", "DOI": "10.1109/INFOCOM.2006.233", "ISBN": "0743-166X", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "IEEE Xplore", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "", "callNumber": "", "rights": "", "extra": "", "tags": [], "collections": [], "relations": {}, "dateAdded": "2009-11-28T02:27:19Z", "dateModified": "2009-11-28T02:27:19Z" } }, { "key": "S99EKSE4", "version": 1, "library": { "type": "group", "id": 8225, "name": "active attack with network coding", "links": { "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/8225/items/S99EKSE4", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding/items/S99EKSE4", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Ho et al.", "parsedDate": "2004", "numChildren": 0 }, "data": { "key": "S99EKSE4", "version": 1, "itemType": "conferencePaper", "title": "Byzantine modification detection in multicast networks using randomized network coding", "creators": [ { "creatorType": "author", "firstName": "T.", "lastName": "Ho" }, { "creatorType": "author", "firstName": "B.", "lastName": "Leong" }, { "creatorType": "author", "firstName": "R.", "lastName": "Koetter" }, { "creatorType": "author", "firstName": "M.", "lastName": "Medard" }, { "creatorType": "author", "firstName": "M.", "lastName": "Effros" }, { "creatorType": "author", "firstName": "D.R.", "lastName": "Karger" } ], "abstractNote": "Distributed randomized network coding, a robust approach to multicasting in distributed network settings, can be extended to provide Byzantine modification detection without the use of cryptographic functions is presented in this paper.", "proceedingsTitle": "Proceedings of IEEE International Symposium on Information Theory (ISIT) 2004", "conferenceName": "IEEE International Symposium on Information Theory (ISIT) 2004", "publisher": "", "place": "", "date": "2004", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "144", "series": "", "seriesNumber": "", "DOI": "10.1109/ISIT.2004.1365180", "ISBN": "", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "IEEE Xplore", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "Byzantine modification detection", "type": 1 }, { "tag": "ad hoc networks", "type": 1 }, { "tag": "distributed network setting", "type": 1 }, { "tag": "distributed randomized network coding", "type": 1 }, { "tag": "encoding", "type": 1 }, { "tag": "multicast communication", "type": 1 }, { "tag": "multicast network", "type": 1 }, { "tag": "probability", "type": 1 } ], "collections": [], "relations": {}, "dateAdded": "2009-11-28T02:27:19Z", "dateModified": "2009-11-28T02:27:19Z" } }, { "key": "9CIWG27K", "version": 1, "library": { "type": "group", "id": 8225, "name": "active attack with network coding", "links": { "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/8225/items/9CIWG27K", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding/items/9CIWG27K", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Yu et al.", "parsedDate": "2008", "numChildren": 0 }, "data": { "key": "9CIWG27K", "version": 1, "itemType": "conferencePaper", "title": "An Efficient Signature-Based Scheme for Securing Network Coding Against Pollution Attacks", "creators": [ { "creatorType": "author", "firstName": "Zhen", "lastName": "Yu" }, { "creatorType": "author", "firstName": "Yawen", "lastName": "Wei" }, { "creatorType": "author", "firstName": "B.", "lastName": "Ramkumar" }, { "creatorType": "author", "firstName": "Yong", "lastName": "Guan" } ], "abstractNote": "Network coding provides the possibility to maximize network throughput and receives various applications in traditional computer networks, wireless sensor networks and peer-to-peer systems. However, the applications built on top of network coding are vulnerable to pollution attacks, in which the compromised forwarders can inject polluted or forged messages into networks. Existing schemes addressing pollution attacks either require an extra secure channel or incur high computation overhead. In this paper, we propose an efficient signature-based scheme to detect and filter pollution attacks for the applications adopting linear network coding techniques. Our scheme exploits a novel homomorphic signature function to enable the source to delegate its signing authority to forwarders, that is, the forwarders can generate the signatures for their output messages without contacting the source. This nice property allows the forwarders to verify the received messages, but prohibit them from creating the valid signatures for polluted or forged ones. Our scheme does not need any extra secure channels, and can provide source authentication and batch verification. Experimental results show that it can improve computation efficiency up to ten times compared to some existing one. In addition, we present an alternate lightweight scheme based on a much simpler linear signature function. This alternate scheme provides a tradeoff between computation efficiency and security.", "proceedingsTitle": "Proceedings of IEEE INFOCOM 2008, the 27th Conference on Computer Communications", "conferenceName": "IEEE INFOCOM 2008, the 27th Conference on Computer Communications", "publisher": "", "place": "", "date": "2008", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "1409-1417", "series": "", "seriesNumber": "", "DOI": "10.1109/INFOCOM.2008.199", "ISBN": "0743-166X", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "IEEE Xplore", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "batch verification", "type": 1 }, { "tag": "digital signatures", "type": 1 }, { "tag": "encoding", "type": 1 }, { "tag": "formal verification", "type": 1 }, { "tag": "linear network coding", "type": 1 }, { "tag": "network throughput", "type": 1 }, { "tag": "pollution attacks", "type": 1 }, { "tag": "signature-based scheme", "type": 1 }, { "tag": "source authentication", "type": 1 } ], "collections": [], "relations": {}, "dateAdded": "2009-11-28T02:27:19Z", "dateModified": "2009-11-28T02:27:19Z" } }, { "key": "TWF4IZDT", "version": 1, "library": { "type": "group", "id": 8225, "name": "active attack with network coding", "links": { "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/8225/items/TWF4IZDT", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/active_attack_with_network_coding/items/TWF4IZDT", "type": "text/html" } }, "meta": { "createdByUser": { "id": 33685, "username": "ustc_wangjin", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/ustc_wangjin", "type": "text/html" } } }, "creatorSummary": "Zhen Yu et al.", "parsedDate": "2009", "numChildren": 0 }, "data": { "key": "TWF4IZDT", "version": 1, "itemType": "conferencePaper", "title": "An Efficient Scheme for Securing XOR Network Coding against Pollution Attacks", "creators": [ { "creatorType": "author", "firstName": "", "lastName": "Zhen Yu" }, { "creatorType": "author", "firstName": "", "lastName": "Yawen Wei" }, { "creatorType": "author", "firstName": "B.", "lastName": "Ramkumar" }, { "creatorType": "author", "firstName": "", "lastName": "Yong Guan" } ], "abstractNote": "Network coding is promising to maximize throughput in various networking systems. Compared to normal network coding operated over large finite fields, XOR network coding has gained an increasing number of applications for its simplicity, especially in wireless networks. However, both types of network coding systems are vulnerable to pollution attacks in which the compromised forwarders inject polluted messages into the systems. Existing solutions to pollution attacks can protect only the normal network coding, but none of them is able to secure XOR network coding. In this paper, we propose an efficient scheme for securing XOR network coding against pollution attacks. Our scheme exploits probabilistic key pre-distribution and message authentication codes (MACs). In our scheme, the source appends multiple MACs to each message, where each MAC can authenticate only a part of the message and the parts authenticated by different MACs are overlapped. Thus, multiple forwarders can collaboratively verify different parts of messages using the MACs with their own shared keys. By carefully controlling the overlapping between the parts authenticated by different MACs, our scheme can filter polluted messages in a few hops with a high probability. To the best of our knowledge, this is the first solution to pollution attacks for XOR network coding. Experimental results show that it is 200 to 1000 times faster than existing ones, hence, it is particularly suitable for resource-constrained wireless networks.", "proceedingsTitle": "INFOCOM 2009, IEEE", "conferenceName": "INFOCOM 2009, IEEE", "publisher": "", "place": "", "date": "2009", "eventPlace": "", "volume": "", "issue": "", "numberOfVolumes": "", "pages": "406-414", "series": "", "seriesNumber": "", "DOI": "10.1109/INFCOM.2009.5061945", "ISBN": "0743-166X", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "IEEE Xplore", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "cryptography", "type": 1 }, { "tag": "encoding", "type": 1 }, { "tag": "message authentication", "type": 1 }, { "tag": "message authentication code", "type": 1 }, { "tag": "pollution attack", "type": 1 }, { "tag": "probabilistic key pre-distribution", "type": 1 }, { "tag": "probability", "type": 1 }, { "tag": "radio networks", "type": 1 }, { "tag": "resource-constrained wireless network", "type": 1 }, { "tag": "secure XOR network coding", "type": 1 }, { "tag": "telecommunication security", "type": 1 } ], "collections": [], "relations": {}, "dateAdded": "2009-11-28T02:27:19Z", "dateModified": "2009-11-28T02:27:19Z" } } ]