Skip to main content

A Novel Anonymity Quantification and Preservation Model for UnderNet Relay Networks

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 630))

Abstract

With the wide spread of Internet applications in both the surface net (Internet) and Darknet, the necessity to safeguard privacy and anonymity has become more prominent than ever. In an attempt to assure untraceability and undetectability between entities, as part of the communication process, traditional confidentiality mechanisms have proved insufficient to address attacks against those principles. In addition, different international laws and cross-continental cybercrimes become immune from being affected by a global public policy on how data traffic should be treated. In this article, a holistic view of anonymity preservation approaches and techniques is given with emphasis on the partial articulation of a novel anonymity preservation model based on infrastructure elements, circuit attributes and adversarial engagement rates on clustered and unindexed portions of the cyberspace.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    Hidden space, hidden Web, or UnderNet refers to the portion of the cyberspace which is not indexed by traditional search engines in the surface Net (Internet).

References

  1. Burmester, M., Magkos, E., Chrissikopoulos, V.: Modelling security in cyber-physical systems. Crit. Infrastruct. Prot. 5, 118–126 (2012)

    Article  Google Scholar 

  2. Chaabane, A., Manils, P., Kaafar, M.A.: Digging into anonymous traffic: A deep analysis of the tor anonymizing network. In: 2010 4th International Conference on Network and System Security (NSS), pp. 167–174. IEEE (2010)

    Google Scholar 

  3. Chakravarty, S., Stavrou, A., Keromytis, A.D.: Traffic analysis against low-latency anonymity networks using available bandwidth estimation. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol. 6345, pp. 249–267. Springer, Heidelberg (2010). doi:10.1007/978-3-642-15497-3_16

    Chapter  Google Scholar 

  4. Chaum, D.L.: The dining cryptographers problem: unconditional sender and recipient untraceability. J. Cryptol. 1, 65–75 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  5. Danezis, G.: Measuring anonymity: a few thoughts and a differentially private bound. In: Proceedings of the DIMACS Workshop on Measuring Anonymity (2013)

    Google Scholar 

  6. Danezis, G., Sassaman, L.: Heartbeat traffic to counter (n-1) attacks. In: Jajodia, S., Samarati, P., Syverson, P.F. (eds.) Workshop on Privacy in Electronic Society (WPES), pp. 89–93. ACM, Washington (2003)

    Google Scholar 

  7. Dingledine, R., Mathewson, N., Syverson, P.: Tor: the second-generation onion router. In: Proceedings of the Thirteen USENIX Security Symposium, 9–13 August 2004, USA, pp. 303–320

    Google Scholar 

  8. Edman, M., Sivrikaya, F., Yener, B.: A combinatorial approach to measuring anonymity. In: IEEE Intelligence and Security Informatics, pp. 179–186. IEEE (2007)

    Google Scholar 

  9. Evans, N.S., Dingledine, R., Grothoff, C.: A practical congestion attack on Tor using long paths. In: Proceedings of the 18th Conference on USENIX Security Symposium, Montreal, Canada, pp. 33–50. ACM (2009)

    Google Scholar 

  10. Freedman, M.J., Morris, R.: Tarzan: a peer-to-peer anonymising network layer. In: 9th ACM Conference on Computer and Communication Security. ACM, Washington (2002)

    Google Scholar 

  11. Gierlichs, B., Troncoso, C., Diaz, C., Preneel, B., Verbauwhede, I.: Revisiting a combinatorial approach toward measuring anonymity. In: Proceedings of the 7th ACM Workshop on Privacy in the Electronic Society, pp. 111–116. ACM, Alexandria (2008)

    Google Scholar 

  12. Guan, Y., Fu, X., Bettati, R., Zhap, W.: An optimal strategy for anonymous communication protocols. In: 22nd International Conference on Distributed Computing Systems, pp. 257–266. IEEE (2002)

    Google Scholar 

  13. Hopper, N., Vasserman, E.Y., Chan-TIN, E.: How much anonymity does network latency leak? ACM Trans. Inf. Syst. Secur. 13, 1094–9224 (2010)

    Article  Google Scholar 

  14. Hsu, D.F., Marinucci, D.: Advances in Cyber Security. Fordham University Press, The Bronx (2013)

    Book  Google Scholar 

  15. Kedogan, D., Agrawal, D., Penz, S.: Limits of anonymity in open environments. In: Petitcolas, F.A.P. (ed.) IH 2002. LNCS, vol. 2578, pp. 53–69. Springer, Heidelberg (2003). doi:10.1007/3-540-36415-3_4

    Chapter  Google Scholar 

  16. Kelly, D., Raines, R., Baldwin, R., Grimaila, M., Mullins, B.: Exploring extant and emerging issues in anonymous networks: a taxonomy and survey of protocols and metrics. IEEE Commun. Surv. Tutorials 14, 579–606 (2012)

    Article  Google Scholar 

  17. Landsiedel, O., Pimenidis, L., Wehrle, K., Niedermayer, H., Carle, G.: Dynamic multipath onion routing in anonymous peer-to-peer overlay networks. In: GLOBECOM, pp. 64–69. IEEE (2007)

    Google Scholar 

  18. Ling, Z., Luo, J., Yu, W., Fu, X., Xuan, D., Jia, W.: A new cell counter based attack against Tor. In: Proceedings of the 16th ACM Conference on Computer and Communications Security, pp. 578–589. ACM (2009)

    Google Scholar 

  19. Ling, Z., Luo, J., Yu, W., Fu, X., Jia, W., Zhao, W.: Protocol-level attacks against Tor. Comput. Netw. 57(4), 869–886 (2013). doi:10.1016/j.comnet.2012.11.005. http://www.sciencedirect.com/science/article/pii/S1389128612003799

    Article  Google Scholar 

  20. Lu, T., Fang, B., Sun, Y., Cheng, X.: Wongoo: a peer-to-peer protocol for anonymous communication. J. Parallel Distrib. Process. Tech. Appl. 3, 1102–1106 (2004)

    Google Scholar 

  21. Mislove, A., Oberoi, G., Post, A., Reis, C., Druschel, P., Wallach, D.S.: Ap3: cooperative decentralised anonymous communication. In: ACM Proceedings of the Eleventh ACM SIGOPS European Workshop, 19–22 September 2004, Belgium (2004)

    Google Scholar 

  22. Mislove, A., Oberoi, G., Post, A., Reis, C., Druschel, P., Wallach, D.S.: Privacy and cybersecurity: the next 100 years. In: Proceedings of the IEEE 100 (2012)

    Google Scholar 

  23. Mittal, P., Khurshid, A., Juen, J., Caesar, M., Borisov, N.: Stealthy traffic analysis of low-latency anonymous communication using throughput finger-printing: Chicago, Illinois, USA. In: Proceedings of the 18th ACM Conference on Computer and Communications Security, pp. 215–226. ACM (2003)

    Google Scholar 

  24. Nambiar, A., Wright, M.: Salsa: a structured approach to large scale anonymity. In: Juels, A., Wright, R.N., di Vimercati, S.D.C. (eds.) Proceedings of the Thirteen ACM Conference on Computer and Communication Security: 11 December 2006, pp. 7–26. ACM, Alexandria (2006)

    Google Scholar 

  25. Reiter, M.K., Rubin, A.D.: Crowds: anonymity for web transations. ACM Trans. Inf. Secur. 1, 66–92 (1998)

    Article  Google Scholar 

  26. Tóth, G., Hornák, Z.: Measuring anonymity in a non-adaptive, real-time system. In: Martin, D., Serjantov, A. (eds.) PET 2004. LNCS, vol. 3424, pp. 226–241. Springer, Heidelberg (2005). doi:10.1007/11423409_14

    Chapter  Google Scholar 

  27. Urdoch, S.J., Danezis, G.: Low-cost traffic analysis of Tor. In: Proceedings of the 2005 IEEE Symposium on Security and Privacy, pp. 183–195. IEEE (2005)

    Google Scholar 

  28. Wang, X., Chen, S., Jajodia, S.: Network flow watermarking attack on low-latency anonymous communication systems. In: 2007 IEEE Symposium on Security and Privacy, SP 2007, pp. 116–130 (2007). doi:10.1109/SP.2007.30

  29. Xiao, L., Liu, X., Gu, W., Xuan, D., Liu, Y.: A design of overlay anonymous multicast protocol. In: International Parallel, Distributed Processing Symposium (IPDPS), 20 May 2007. IEEE (2006)

    Google Scholar 

  30. Xiaoxin, W., Bertino, E.: Achieving k-anonymity in mobile ad hoc networks. In: 1st IEEE ICNP Workshop on Secure Network Protocols, 6 November 2005, pp. 37–42. IEEE, Massachusetts (2005)

    Google Scholar 

  31. Yang, M., Luo, J., Ling, Z., Fu, X., Yu, W.: De-anonymizing and countermeasures in anonymous communication networks. IEEE Commun. Mag. 53(4), 60–66 (2015). doi:10.1109/MCOM.2015.7081076

    Article  Google Scholar 

  32. Yu, W., Fu, X., Graham, S., Xuan, D., Zhao, W.: DSSS-based flow marking technique for invisible traceback. In: 2007 IEEE Symposium on Security and Privacy, SP 2007, pp. 18–32 (2007) doi:10.1109/SP.2007.14

  33. Zhang, J., Duan, H., Liu, W., Wu, J.: Anonymity analysis of p2p anonymous communication systems. Comput. Commun. 34, 358–366 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gregory Epiphaniou .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Epiphaniou, G., French, T., Al-Khateeb, H., Dehghantanha, A., Jahankhani, H. (2016). A Novel Anonymity Quantification and Preservation Model for UnderNet Relay Networks. In: Jahankhani, H., et al. Global Security, Safety and Sustainability - The Security Challenges of the Connected World. ICGS3 2017. Communications in Computer and Information Science, vol 630. Springer, Cham. https://doi.org/10.1007/978-3-319-51064-4_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-51064-4_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-51063-7

  • Online ISBN: 978-3-319-51064-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics