File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Anonymous communication with network coding against traffic analysis attack

TitleAnonymous communication with network coding against traffic analysis attack
Authors
KeywordsAlgorithm complexity
Anonymous communication
Effective algorithms
Influential factors
ITS efficiencies
Issue Date2011
PublisherI E E E, Computer Society. The Journal's web site is located at http://www.ieee-infocom.org/
Citation
The IEEE INFOCOM 2011, Shanghai, China, 10-15 April 2011. In Conference Proceedings, 2011, p. 1008-1016 How to Cite?
Abstract
Flow untraceability is one critical requirement for anonymous communication with network coding, which prevents malicious attackers with wiretapping and traffic analysis abilities from relating the senders to the receivers, using linear dependency of the received packets. There have recently been proposals advocating encryptions on the Global Encoding Vectors (GEV) of network coding to thwart such attacks [1], [2]. Nevertheless, there has been no exploration of the capability of networking coding itself, to constitute more efficient and effective algorithms which guarantee anonymity. In this paper, we design a novel, simple, and effective linear network coding mechanism (ALNCode) to achieve flow untraceability in a communication network with multiple unicast flows. With solid theoretical analysis, we first show that linear network coding (LNC) can be applied to thwart traffic analysis attacks without the need of encrypting GEVs. Our key idea is to mix multiple flows at their intersection nodes by generating downstream GEVs from the common basis of upstream GEVs belonging to multiple flows, in order to hide the correlation of upstream and downstream GEVs in each flow. We then design a deterministic LNC scheme to implement our idea, by which the downstream GEVs produced are guaranteed to obfuscate their correlation with the corresponding upstream GEVs. We also give extensive theoretical analysis on the intersection probability of GEV bases and the influential factors to the effectiveness of our scheme, as well as the algorithm complexity to support its efficiency. © 2011 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/135704
ISSN
2013 SCImago Journal Rankings: 1.482
References

 

DC FieldValueLanguage
dc.contributor.authorWang, Jen_HK
dc.contributor.authorWang, Jen_HK
dc.contributor.authorWu, Cen_HK
dc.contributor.authorLu, Ken_HK
dc.contributor.authorGu, Nen_HK
dc.date.accessioned2011-07-27T01:46:59Z-
dc.date.available2011-07-27T01:46:59Z-
dc.date.issued2011en_HK
dc.identifier.citationThe IEEE INFOCOM 2011, Shanghai, China, 10-15 April 2011. In Conference Proceedings, 2011, p. 1008-1016en_HK
dc.identifier.issn0743-166Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/135704-
dc.description.abstractFlow untraceability is one critical requirement for anonymous communication with network coding, which prevents malicious attackers with wiretapping and traffic analysis abilities from relating the senders to the receivers, using linear dependency of the received packets. There have recently been proposals advocating encryptions on the Global Encoding Vectors (GEV) of network coding to thwart such attacks [1], [2]. Nevertheless, there has been no exploration of the capability of networking coding itself, to constitute more efficient and effective algorithms which guarantee anonymity. In this paper, we design a novel, simple, and effective linear network coding mechanism (ALNCode) to achieve flow untraceability in a communication network with multiple unicast flows. With solid theoretical analysis, we first show that linear network coding (LNC) can be applied to thwart traffic analysis attacks without the need of encrypting GEVs. Our key idea is to mix multiple flows at their intersection nodes by generating downstream GEVs from the common basis of upstream GEVs belonging to multiple flows, in order to hide the correlation of upstream and downstream GEVs in each flow. We then design a deterministic LNC scheme to implement our idea, by which the downstream GEVs produced are guaranteed to obfuscate their correlation with the corresponding upstream GEVs. We also give extensive theoretical analysis on the intersection probability of GEV bases and the influential factors to the effectiveness of our scheme, as well as the algorithm complexity to support its efficiency. © 2011 IEEE.en_HK
dc.languageengen_US
dc.publisherI E E E, Computer Society. The Journal's web site is located at http://www.ieee-infocom.org/en_HK
dc.relation.ispartofProceedings of the IEEE INFOCOMen_HK
dc.rightsIEEE Infocom Proceedings. Copyright © IEEE, Computer Society.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectAlgorithm complexity-
dc.subjectAnonymous communication-
dc.subjectEffective algorithms-
dc.subjectInfluential factors-
dc.subjectITS efficiencies-
dc.titleAnonymous communication with network coding against traffic analysis attacken_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0743-166X&volume=&spage=1008&epage=1016&date=2011&atitle=Anonymous+communication+with+network+coding+against+traffic+analysis+attack-
dc.identifier.emailWu, C:cwu@cs.hku.hken_HK
dc.identifier.authorityWu, C=rp01397en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/INFCOM.2011.5934873en_HK
dc.identifier.scopuseid_2-s2.0-79960862937en_HK
dc.identifier.hkuros187767en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-79960862937&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage1008en_HK
dc.identifier.epage1016en_HK
dc.publisher.placeUnited Statesen_HK
dc.description.otherThe IEEE INFOCOM 2011, Shanghai, China, 10-15 April 2011. In Conference Proceedings, 2011, p. 1008-1016-
dc.identifier.scopusauthoridWang, J=35087680000en_HK
dc.identifier.scopusauthoridWang, J=35249657500en_HK
dc.identifier.scopusauthoridWu, C=15836048100en_HK
dc.identifier.scopusauthoridLu, K=7402892798en_HK
dc.identifier.scopusauthoridGu, N=7102669753en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats