Recipients' Anonymity in Multihop Ad-Hoc Networks

被引：0

作者：

Rifa-Pous, Helena ^{[1
]}

Panaousis, Emmanouil A. ^{[2
]}

Politis, Christos ^{[2
]}

机构：

[1] Univ Oberta Catalunya, Internet Interdisciplinary Inst, Barcelona 08018, Spain

[2] Kingston Univ London, Wireless Multimedia & Networking Res Grp, London KT1 2EE, England

来源：

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 2012年 / E95D卷 / 01期

关键词：

anonymity; cryptography; scalability; ad-hoc network; ROUTING PROTOCOL; MOBILE;

D O I：

10.1587/transinf.E95.D.181

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Multihop ad-hoc networks have a dynamic topology. Retrieving a route towards a remote peer requires the execution of a recipient lookup, which can publicly reveal sensitive information about him. Within this context, we propose an efficient, practical and scalable solution to guarantee the anonymity of recipients' nodes in ad-hoc networks.

引用

页码：181 / 184

页数：4

共 10 条

[1]

[Anonymous], 2002, RSA CryptoBytes

[2] An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks [J].

Boukerche, A ;

El-Khatib, K ;

Xu, L ;

Korba, L .

COMPUTER COMMUNICATIONS, 2005, 28 (10) :1193-1203

[3]

Ciszkowski T, 2006, ARXIVCS0609016 CSCR

[4] ARMR: Anonymous routing protocol with multiple routes for communications in mobile ad hoc networks [J].

Dong, Ying ;

Chim, Tat Wing ;

Li, Victor O. K. ;

Yiu, S. M. ;

Hui, C. K. .

AD HOC NETWORKS, 2009, 7 (08) :1536-1550

[5]

Kong Jiejun., 2003, P ACM MOBIHOC, P291

[6]

Pfitzmann A., 2010, TERMINOLOGY TALKING

[7] Computational and Energy Costs of Cryptographic Algorithms on Handheld Devices [J].

Rifa-Pous, Helena ;

Herrera-Joancomarti, Jordi .

FUTURE INTERNET, 2011, 3 (01) :31-48

[8] Cryptographic Energy Costs Are Assumable in Ad Hoc Networks [J].

Rifa-Pous, Helena ;

Herrera-Joancomarti, Jordi .

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2009, E92D (05) :1194-1196

[9]

Song R., 2005, WORKSH SEC AD HOC SE, P42

[10]

Zhu B, 2004, C LOCAL COMPUT NETW, P102

← 1 →