ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
作者： Jiejun Kong , Xiaoyan Hong
关键词:
摘要: … of network member’s identity/pseudonym. The enemy can neither link network members’ … location privacy of other legitimate members, and an on-demand ANODR route is traceable …
acm.org
sci-hub.se 参考文章(32)
Arjen K. Lenstra, Eric R. Verheul, Selecting Cryptographic Key Sizes public key cryptography. pp. 446- 465 ,(2000) , 10.1007/978-3-540-46588-1_30
S.-J. Lee, M. Gerla, Split multipath routing with maximally disjoint paths in ad hoc networks international conference on communications. ,vol. 10, pp. 3201- 3205 ,(2001) , 10.1109/ICC.2001.937262
Darrel Hankerson, Michael Kirkup, Michael Brown, Alfred Menezes, Donny Cheung, Julio Lopez Hernandez, PGP in constrained wireless devices usenix security symposium. pp. 19- 19 ,(2000)
Claude Castelluccia, Gabriel Montenegro, Statistically Unique and Cryptographically Verifiable (SUCV) Identifiers and Addresses. network and distributed system security symposium. ,(2002)
Andreas Pfitzmann, Michael Waidner, Birgit Pfitzmann, ISDN-MIXes: Untraceable Communication with Small Bandwidth Overhead kommunikation in verteilten systemen. pp. 451- 463 ,(1991)
R. Canetti, H. Krawczyk, M. Bellare, HMAC: Keyed-Hashing for Message Authentication RFC. ,vol. 2104, pp. 1- 11 ,(1997)
Alfred J Menezes, Paul C van Oorschot, Scott A Vanstone, Handbook of Applied Cryptography ,(1996)
M.G. Reed, P.F. Syverson, D.M. Goldschlag, Anonymous connections and onion routing IEEE Journal on Selected Areas in Communications. ,vol. 16, pp. 482- 494 ,(1998) , 10.1109/49.668972
Johan HÅstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby, A Pseudorandom Generator from any One-way Function SIAM Journal on Computing. ,vol. 28, pp. 1364- 1396 ,(1999) , 10.1137/S0097539793244708
O. Goldreich, L. A. Levin, A hard-core predicate for all one-way functions Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. pp. 25- 32 ,(1989) , 10.1145/73007.73010