Skip to main content
SpringerLink
Log in

Cache Enhanced Anonymity Systems Against Probabilistic Attacks

  • Conference paper
  • First Online:
Computer Networks (CN 2018)

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

Included in the following conference series:

  • 849 Accesses

Abstract

The technique of data caching is being increasingly recognized for its ability to increase the amount of anonymity provided by an anonymous communication network, and is expected to be widely adopted in the next generation of these systems. We present a method to measure the degree of anonymity remaining in a cache enhanced anonymity system after a probabilistic attack has been carried out on it. Our method determines the probability distribution induced by the attack on all possible communication patterns of being the true one, from which a system-wide anonymity metric is developed. The scope of our metric, in terms of the attacks it is applicable to, is far wider than that of existing methods.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

References

  1. Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84–88 (1981)

    Article  Google Scholar 

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

    Google Scholar 

  3. Kwon, A., Lazar, D., Devadas, S., Ford, B.: Riffle: an efficient communication system with strong anonymity. Proc. Priv. Enhancing Technol. (PoPETs) 2016(2), 115–134 (2016)

    Google Scholar 

  4. Díaz, C., Seys, S., Claessens, J., Preneel, B.: Towards measuring anonymity. In: Dingledine, R., Syverson, P. (eds.) PET 2002. LNCS, vol. 2482, pp. 54–68. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36467-6_5

    Chapter  Google Scholar 

  5. Edman, M., Sivrikaya, F., Yener, B.: A combinatorial approach to measuring anonymity. In: Proceedings of the IEEE International Conference on Intelligence and Security Informatics, pp. 356–363 (2007)

    Google Scholar 

  6. Bagai, R., Tang, B.: Data caching for enhancing anonymity. In: Proceedings of the 25th IEEE International Conference on Advanced Information Networking and Applications, Biopolis, Singapore, pp. 135–142 (2011)

    Google Scholar 

  7. Bagai, R., Lu, H., Li, R., Tang, B.: An accurate system-wide anonymity metric for probabilistic attacks. In: Fischer-Hübner, S., Hopper, N. (eds.) PETS 2011. LNCS, vol. 6794, pp. 117–133. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22263-4_7

    Chapter  Google Scholar 

  8. Shubina, A.M., Smith, S.W.: Using caching for browsing anonymity. ACM SIGEcom Exchanges 4(2), 11–20 (2003)

    Article  Google Scholar 

  9. Kim, B.R., Kim, K.C.: Efficient caching strategies for gnutella-like systems to achieve anonymity in unstructured P2P file sharing. In: Etzion, O., Kuflik, T., Motro, A. (eds.) NGITS 2006. LNCS, vol. 4032, pp. 117–128. Springer, Heidelberg (2006). https://doi.org/10.1007/11780991_11

    Chapter  Google Scholar 

  10. Asratian, A., Denley, T., Häggkvist, R.: Bipartite Graphs and Their Applications. Cambridge University Press, Cambridge (1998)

    Book  Google Scholar 

  11. Shannon, C.: A mathematical theory of communication. Bell Syst. Techn. J. 27, 379–423, 623–656 (1948)

    Article  MathSciNet  Google Scholar 

  12. Serjantov, A., Danezis, G.: Towards an information theoretic metric for anonymity. In: Dingledine, R., Syverson, P. (eds.) PET 2002. LNCS, vol. 2482, pp. 41–53. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36467-6_4

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  14. Kesdogan, D., Egner, J., Büschkes, R.: Stop- and- Go-MIXes providing probabilistic anonymity in an open system. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, pp. 83–98. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-49380-8_7

    Chapter  Google Scholar 

  15. Tóth, G., Hornák, Z., Vajda, F.: Measuring anonymity revisited. In: Proceedings of the 9th Nordic Workshop on Secure IT Systems, Espoo, Finland, pp. 85–90 (2004)

    Google Scholar 

  16. Clauß, S., Schiffner, S.: Structuring anonymity metrics. In: Proceedings of the ACM Workshop on Digital Identity Management, pp. 55–62 (2006)

    Google Scholar 

  17. Rényi, A.: On measures of entropy and information. In: Proceedings of the 4th Berkeley Symposium on Mathematical Statistics and Probability, pp. 547–561 (1961)

    Google Scholar 

  18. Andersson, C., Lundin, R.: On the fundamentals of anonymity metrics. In: Fischer-Hübner, S., Duquenoy, P., Zuccato, A., Martucci, L. (eds.) Privacy and Identity 2007. ITIFIP, vol. 262, pp. 325–341. Springer, Boston, MA (2008). https://doi.org/10.1007/978-0-387-79026-8_23

    Chapter  Google Scholar 

  19. Bagai, R., Jiang, N.: Measuring anonymity by profiling probability distributions. In: Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TRUSTCOM), Liverpool, UK, pp. 366–374 (2012)

    Google Scholar 

  20. Bagai, R., Lu, H.: Measuring client-server anonymity. In: Gaj, P., Kwiecień, A., Stera, P. (eds.) CN 2016. CCIS, vol. 608, pp. 96–106. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-39207-3_9

    Chapter  Google Scholar 

  21. 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, Alexandria, VA, USA, pp. 111–116 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Wichita State University, Wichita, KS, 67260-0083, USA

    Huabo Lu & Rajiv Bagai

Authors
  1. Huabo Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajiv Bagai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rajiv Bagai .

Editor information

Editors and Affiliations

  1. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Piotr Gaj

  2. Silesian University of Technology, Gliwice, Poland

    Michał Sawicki

  3. University of Opole, Opole, Poland

    Grażyna Suchacka

  4. Silesian University of Technology, Gliwice, Poland

    Andrzej Kwiecień

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lu, H., Bagai, R. (2018). Cache Enhanced Anonymity Systems Against Probabilistic Attacks. In: Gaj, P., Sawicki, M., Suchacka, G., Kwiecień, A. (eds) Computer Networks. CN 2018. Communications in Computer and Information Science, vol 860. Springer, Cham. https://doi.org/10.1007/978-3-319-92459-5_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-92459-5_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-92458-8

  • Online ISBN: 978-3-319-92459-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation