微信服务号

微信订阅号

2025-4-6- 0
Home > Archive>Volume 21, Issue 9, 2010 >2338-2351
PDF HTML XML Export Cite reminder
Anonymous Communication Mechanism with Multi-Paths Network Coding
Author:
Affiliation:

  • Article
    • | |
  • Metrics
    • |
  • Reference [21]
    • |
  • Related [20]
    • |
  • Cited by
    • | |
  • Comments
    Abstract:

    This paper first proposes a new information slicing and transmitting method ITNC (information slicing and transmitting with multi-path network coding) with multi-paths network coding. Next, a novel anonymous communication mechanism AC-ITNC (anonymous communication mechanism based on ITNC) without key infrastructure, which is based on ITNC, is presented. In the new mechanism, the anonymous path setup information is sliced into pieces, and every piece is coded by the random coding coefficient. The coding coefficient and coded information pieces are delivered along different paths, which make the anonymous paths be set up in the case of non-cryptographic scheme. Theoretical analysis and simulation results show that AC-ITNC can significantly improve resistance against conspiracy attacks in an anonymous communication system within complete distributed environment without key infrastructure.

    Reference
    [1] Chaum D. Untraceable electronic mail, return addresses and digital pseudonyms. Communications of the ACM, 1981,24(2):84-88. [doi: 10.1145/358549.358563]
    [2] Goldschlag D, Reed M, Syverson P. Onion routing for anonymous and private Internet connections. Communications of the ACM, 1999,42(2):39-41. [doi: 10.1145/293411.293443]
    [3] Dingledine R, Mathewson N, Syverson P. Tor: The second-generation onion router. In: Proc. of the 13th USENIX Security Symp. Berkeley: USENIX Association, 2004. 303-320.
    [4] Reiter M, Rubin A. Crowds: Anonymity for Web transactions. ACM Trans. on Information and System Security, 1998,1(1):66-92. [doi: 10.1145/290163.290168]
    [5] Sherwood R, Bhattacharjee B, Srinivasan A. P5: A protocol for scalable anonymous communication. Journal of Computer Security, 2005,13(6):839-876.
    [6] Freedman MJ, Morris R. Tarzan: A peer-to-peer anonymizing network layer. In: Proc. of the 9th ACM Conf. on Computer and Communications Security (CCS 2002). Washington: ACM Press, 2002. 193-206.
    [7] Rennhard M, Plattner B. Introducing MorphMix: Peer-to-Peer based anonymous Internet usage with collusion detection. In: Proc. of the ACM Workshop on Privacy in the Electronic Society (WPES 2002). Washington: ACM Press, 2002. 91-102.
    [8] Kate A, Zaverucha GM, Goldberg I. Pairing-Based onion routing. In: Borisov N, Golle P, eds. Proc. of the 7th Privacy Enhancing Technologies (PET 2007). LNCS 4776, Berlin: Springer-Verlag, 2007. 95-112.
    [9] ?verlier L, Syverson P. Improving efficiency and simplicity of Tor circuit establishment and hidden services. In: Borisov N, Golle P, eds. Proc. of the 7th Privacy Enhancing Technologies (PET 2007). LNCS 4776, Berlin: Springer-Verlag, 2007. 134-152.
    [10] Chaum D. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1988,1(1): 65-75.
    [11] Katti S, Katabi D, Puchala K. Slicing the onion: Anonymous routing without PKI. Technical Report, MIT-CSAIL-TR-2005-053, Cambridge: Massachusetts Institute of Technology, 2005.
    [12] Katti S, Cohen J, Katabi D. Information slicing: Anonymity using unreliable overlays. In: Proc. of the 4th USENIX Symp. on Network Systems Design and Implementation (NSDI 2007). Berkeley: USENIX Association, 2007. 43-56.
    [13] Ahlswede R, Cai N, Li SY, Yeung R. Network information flow. IEEE Trans. on Information Theory, 2000,46(4):1204-1216. [doi: 10.1109/18.850663]
    [14] Chou PA, Wu Y, Jain K. Practical network coding. In: Proc. of the 41st Annual Allerton Conf. on Communication, Control, and Computing. Monticello, 2003. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.697
    [15] Widmer J, Fragouli C, Le Boudec JY. Low-Complexity energy efficient broadcasting in wireless ad-hoc networks using network coding. In: Proc. of the Workshop on Network Coding, Theory, and Applications. 2005. http://arni.epfl.ch/contents/pubs/pubs_ network/network_8.pdf
    [16] Gkantsidis C, Rodriguez P. Cooperative security for network coding file distribution. In: Proc. of the IEEE Int’l. Conf. on Computer Communications (INFOCOM 2006). Washington: IEEE Press, 2006. 1-13.
    [17] Charles D, Jain K, Lauter K. Signatures for network coding. In: Proc. of the IEEE Conf. on Information Sciences and Systems (CISS 2006). Washington: IEEE Press, 2006. 857-863.
    [18] Wang WP, Chen JE, Chen SQ, Wang JX. Research on a short distance-prior rerouting scheme in anonymous communication. Journal of Software, 2004,15(4):561-570 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/15/561.htm
    [19] Wang WP, Chen JE, Wang JX. An anonymous communication protocol based on groups with definite route length. Journal of Computer Research and Development, 2003,40(4):609-614 (in Chinese with English abstract).
    附中文参考文献: [18] 王伟平,陈建二,陈松乔,王建新.匿名通信中短距离优先分组重路由方法的研究.软件学报,2004,15(4):561-570. http://www.jos. org.cn/1000-9825/15/561.htm
    [19] 王伟平,陈建二,王建新.基于组群的有限路长匿名通信协议.计算机研究与发展,2003,40(4):609-614.
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

段桂华,王伟平,王建新,杨路明.一种基于多路径网络编码的匿名通信机制.软件学报,2010,21(9):2338-2351

Copy
Share
Article Metrics
  • Abstract:5023
  • PDF: 6134
  • HTML: 0
  • Cited by: 0
History
  • Received:September 01,2008
  • Revised:March 31,2009
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the first2033255Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063