Towards a Taxonomy of Wired and Wireless Anonymous Networks

被引:0
作者
Kelly, Douglas [1 ]
Raines, Richard [1 ]
Baldwin, Rusty [1 ]
Mullins, Barry [1 ]
Grimaila, Michael [1 ]
机构
[1] USAF, Inst Technol, Wright Patterson AFB, OH 45433 USA
来源
2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8 | 2009年
关键词
Anonymity; privacy; taxonomy; communications networks;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
With the aim to preserve privacy over a communications network, a plethora of anonymous protocols have been proposed along with many empirical investigations into specific adversary attacks over those networks. However, no known taxonomies exist that address anonymity in the diverse set of both wired and wireless anonymous communications networks. This paper proposes such a novel cubic taxonomy which explores the three key components of anonymity property, adversary capability, and network type. This taxonomy expands the definition of anonymity and aids in the advancement of state-of-the-art technological privacy-preserving mechanisms in anonymous networks against any adversary.
引用
收藏
页码:585 / 592
页数:8
相关论文
共 64 条
  • [1] [Anonymous], ACM Transactions on Information and System Security (TISSEC), DOI DOI 10.1145/290163.290168
  • [2] [Anonymous], IEEE J SELECTED AREA
  • [3] [Anonymous], ACM MOBICOM 95
  • [4] Untraceable mobility or how to travel incognito
    Ateniese, G
    Herzberg, A
    Krawczyk, H
    Tsudik, G
    [J]. COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 1999, 31 (08): : 871 - 884
  • [5] Location privacy in pervasive computing
    Beresford, AR
    Stajano, F
    [J]. IEEE PERVASIVE COMPUTING, 2003, 2 (01) : 46 - 55
  • [6] BOUKERCHE A, 2004, 29 ANN IEEE INT C LO
  • [7] Bowen C., 2007, 40 ANN HAW INT C SYS
  • [8] Boyan J., 1997, CMC MAGAZINE
  • [9] Chaum D., 1988, Journal of Cryptology, V1, P65, DOI 10.1007/BF00206326
  • [10] UNTRACEABLE ELECTRONIC MAIL, RETURN ADDRESSES, AND DIGITAL PSEUDONYMS
    CHAUM, DL
    [J]. COMMUNICATIONS OF THE ACM, 1981, 24 (02) : 84 - 88