FAN: Friendship based anonymous routing in wireless social mobile networks of malicious communities

ACM International Conference Proceeding Series

Volumn , Issue , 2011, Pages

  Davoli, Antonio ^a   Mei, Alessandro ^a   Stefa, Julinda ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Anonymous routing; DTNs; Pocket switched networks

Indexed keywords

ANONYMITY PROPERTY; ANONYMOUS COMMUNICATION; ANONYMOUS ROUTING; DATA TRACES; DTNS; FIXED NETWORKS; KEY TECHNOLOGIES; NETWORK THROUGHPUT; POCKET SWITCHED NETWORKS; UNLINKABILITY;

COMMUNICATION; INNOVATION;

PACKET NETWORKS;

EID: 84871953737     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2414393.2414406     Document Type: Conference Paper

References (25)

1. M. V. Barbera and A. Mei. Personal marks and community certificates: Detecting clones in mobile wireless networks of smart-phones. Preprint: http://arxiv.org/abs/1105.3716, 2011.
2. A. Boukerche, K. El-Khatib, L. Xu, and L. Korba. Sdar: A secure distributed anonymous routing protocol for wireless and mobile ad hoc networks. In Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks (LCN04), 2004.
3. R. M. Capocelli, A. D. Santis, L. Gargano, and U. Vaccaro. On the size of shares for secret sharing schemes. Journal of Cryptology, 6:157-168.
4. M. Carpentieri, A. D. Santis, U. Vaccaro, A. De, and S. U. Vaccaro. Size of shares and probability of cheating in threshold schemes. In In Proc. of Eurocrypto'93, Lecture Notes in Computer Science, LNCS 765, pages 118-125. Springer-Verlag, 1993.
5. L. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM, 24:84-90, February 1981.
6. E. M. Daly and M. Haahr. Social network analysis for routing in disconnected delay-tolerant manets. In MobiHoc '07: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing, 2007.
7. R. Dingledine, N. Mathewson, and P. P. Syverson. Tor: the second-generation onion router. In Proceedings of the 13th conference on USENIX Security Symposium (SSYM'04), 2004.
8. N. Eagle and A. S. Pentland. CRAWDAD data set mit/reality (v. 2005-07-01). Downloaded from http://crawdad.cs.dartmouth.edu/mit/reality, July 2005.
9. V. Erramilli, M. Crovella, A. Chaintreau, and C. Diot. Delegation forwarding. In MobiHoc '08: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, 2008.
10. P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft, and C. Diot. Pocket switched networks and human mobility in conference environments. In WDTN '05: Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, 2005.
11. P. Hui, J. Crowcroft, and E. Yoneki. Bubble rap: social-based forwarding in delay tolerant networks. In MobiHoc '08: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, 2008.
12. R. Jansen and R. Beverly. Toward Anonymity in Delay Tolerant Networks: Threshold Pivot Scheme. In Proceedings of The Military Communications Conference (MILCOM 2010).
13. D. Kotz, T. Henderson, I. Abyzov, and J. Yeo. CRAWDAD data set dartmouth/campus (v. 2009-09-09). Downloaded from http://crawdad.cs.dartmouth. edu/dartmouth/campus, Sept. 2009.
14. F. Li and J. Wu. LocalCom: a community-based epidemic forwarding scheme in disruption-tolerant networks. In SECON'09: Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks, 2009.
15. A. Liu and P. Ning. Tinyecc: A configurable library for elliptic curve cryptography in wireless sensor networks. In Proceedings of the 7th International Conference on Information Processing in Sensor Networks (IPSN 2008), SPOTS Track, 2008.
16. X. Lu, P. Hui, D. Towsley, J. Pu, and Z. Xiong. Anti-localization anonymous routing for delay tolerant network. Computer Networks, 54(11):1899 - 1910, 2010.
17. A. Mei, G. Morabito, P. Santi, and J. Stefa. Social-Aware Stateless Forwarding in Pocket Switched Networks. In Proceedings of The 30th IEEE Conference on Computer Communications, mini-conference, (INFOCOM 2011), April 2011.
18. G. Palla, I. Derényi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435(7043), 2005.
19. J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau. CRAWDAD trace cambridge/haggle/imote (v. 2009-05-29). Downloaded from http://crawdad.cs.dartmouth.edu/cam-bridge/haggle/imote, May 2009.
20. S. Seys and B. Preneel. ARM: anonymous routing protocol for mobile ad hoc networks. Int. J. Wire. Mob. Comput., 3:145-155, October 2009.
21. A. Shamir. How to share a secret. Communications of the ACM, 11(22):612-613, 1979.
22. R. Song, L. Korba, and G. Yee. Anondsr: efficient anonymous dynamic source routing for mobile ad-hoc networks. In Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks (SASN'05), 2005.
23. T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In ACM Sigcomm Workshops, Aug. 2005.
24. A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, 2000.
25. Y. Zhang, W. Liu, W. Lou, and Y. Fang. MASK: Anonymous on-demand routing in mobile ad hoc networks. IEEE Transactions on Wireless Communications, 21:2376-2385, 2006.