AB-OR: Improving the Efficiency in Onion Routing Using Attribute Based Cryptography

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 131)

Abstract

Onion routing has been employed as a technique for ensuring anonymous communication over a public channel to ensure the integrity of the message as well as the privacy of the contending entities amidst untrusted routers. The technique ensures that the actual data as well as the meta-data in the packet are hidden from the prying intermediaries. It uses multiple layers of encryption of the packet for the purpose. However, exactly due to the same, the efficiency concerns in onion routing have to be addressed. In this paper, we propose and demonstrate the use of the Ciphertext Policy Attribute Based Encryption (CP-ABE) to improve the overhead in the existing onion routing schemes as well as to improve their overall security strength. Moreover, we also impart failure tolerance in case an Onion Router in the communication path breaks down. We formally call the proposed approach as AB-OR (Attribute Based Onion Routing).

Keywords

Attribute Attribute based cryptography Network Security Onion routing 

References

  1. 1.
    Goldschlag D, Reedy M, Syverson P (1999) Onion routing for anonymous and private internet connections. Commun. ACM 42(2):39–41Google Scholar
  2. 2.
    Dingledine R, Mathewson N, Syverson P TOR: the onion router. Tor Project/EFF. http://www.torproject.org
  3. 3.
    Onion routing for anonymous communication. http://ntrg.cs.tcd.ie/undergrad/4ba2.05/group10/index.html
  4. 4.
    Dingledine R, Mathewson N, Syverson PF (2004) Tor: the second-generation onion router. In: USENIX security symposium, pp 303–320, 2004Google Scholar
  5. 5.
    Camenisch J, Lysyanskaya A (2005) A formal treatment of onion routing. In: Shoup V (ed) Proceedings of CRYPTO 2005. LNCS, vol 3621. Springer, Heidelberg, pp 169–187Google Scholar
  6. 6.
    Canetti R (2001) Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings of the 42nd IEEE symposium on foundations of computer science 2001, pp 136–145Google Scholar
  7. 7.
    Kate A, Goldberg I (2010) Using sphinx to improve onion routing circuit construction. Financ Cryptogr Data Secur (LNCS) 6052:359–366Google Scholar
  8. 8.
    Catalano D, Fiore D, Gennaro R (2009) Certificate less onion routing. In: InCCS’09, pp 151–160Google Scholar
  9. 9.
    Kate A, Zaverucha GM, Goldberg I (2007) Pairing-based onion routing. In: 7th privacy enhancing technologies symposium (PETS 2007). Lecture notes in computer science, vol 4776. Springer, Heidelberg, pp 95–112Google Scholar
  10. 10.
    Kate A, Zaverucha GM, Goldberg I (2010) Pairing-based onion routing with improved forward secrecy. ACM Trans Inf Syst Secur 13(29):4Google Scholar
  11. 11.
    Klonowski M, Kutyłowski M, Lauks A (2008) Repelling detour attack against onions with re-encryption. Appl Cryptogr Netw Secur (LNCS) 5037:296–308Google Scholar
  12. 12.
    Borisov N, Klonowski M, Kutyłowski M, Lauks-Dutka A (2010) Attacking and repairing the improved modonions protocol. In: ICISC-09. LNCS, vol 5984. Springer, Berlin, pp 258–273Google Scholar
  13. 13.
    Gomułkiewicz M, Klonowski M, Kutyłowski M (2005) Onions based on universal re-encryption—anonymous communication immune against repetitive attack. Inf Secur Appl (LNCS) 3325:400–410Google Scholar
  14. 14.
    Ren J, Wu J (2010) Survey on anonymous communications in computer networks. Comput Commun 33(4):420–431MathSciNetCrossRefGoogle Scholar
  15. 15.
    Danezis G, Diaz C (2008) A survey of anonymous communication channels. Technical report MSR-TR-2008-35. Microsoft Research, Cambridge, UKGoogle Scholar
  16. 16.
    Tang C, Goldberg I (2010) An improved algorithm for Tor circuit scheduling. Technical report CACR 2010–06, University of WaterlooGoogle Scholar
  17. 17.
    Johnson N, McLaughlin S, Thompson J (2010) Path tracing in TOR networks. In: 18th European signal processing conference (EUSIPCO-2010), pp 1856–1860. ISSN 2076–1465Google Scholar
  18. 18.
    Feigenbaum J, Johnson A, Syverson P (2007) A model of onion routing with provable anonymity. In: Proceedings of the 11th financial cryptography and data security conference (FC 2007)Google Scholar
  19. 19.
    Camenisch J, Neven G (2010) Saving on-line privacy. In: IFIP advances in information and communication technology, vol 320. Springer, Boston, pp 34–47Google Scholar
  20. 20.
    Kaviya K (2009) Network security implementation by onion routing. In: Proceedings of the 2009 international conference on information and multimedia technology (ICIMT ’09). IEEE Computer Society, Washington DC, pp 339–342Google Scholar
  21. 21.
    Panchenko A, Pimenidis L, Renner J (2008) Performance analysis of anonymous communication channels provided by Tor. In: Proceedings of the third international conference on availability, reliability and security (ARES 2008), Barcelona. IEEE Computer Society Press, Washington DC, pp 221–228Google Scholar
  22. 22.
    Snader R, Borisov N (2008) A tune-up for Tor: improving security and performance in the Tor network. In: Proceedings of the network and distributed security symposium—NDSS ’08Google Scholar
  23. 23.
    Panchenko A, Renner J (2009) Path selection metrics for performance-improved onion routing. In: Proceedings of the 9th IEEE/IPSJ symposium on applications and the internet (IEEE SAINT 2009), Seattle, July 2009. IEEE Computer Society Press, Washington DCGoogle Scholar
  24. 24.
    Catalano D, Di Raimondo M, Fiore D, Gennaro R, Puglisi O (2011) Fully non-interactive onion routing with forward-secrecy. In: Proceedings of the 9th international conference on applied cryptography and network security (ACNS’11). LNCS, vol 6715. Springer, Berlin, pp 255-273Google Scholar
  25. 25.
    Backes M, Goldberg I, Kate A, Mohammadi E (2011) Provably secure and practical onion routing. Cryptology ePrint Archive, Report 2011/308Google Scholar
  26. 26.
    Egners A, Gatzen D, Panchenko A, Meyer U (2012) Introducing SOR: SSH-based onion routing. In: Proceedings of the eighth international IEEE symposium on frontiers of information systems and network applications (FINA-2012), part of the 26th IEEE international conference on advanced information networking and applications (IEEE AINA 2012). IEEE Computer Society Press, Washington DCGoogle Scholar
  27. 27.
    Patil NM, Lingam C (2012) Anonymus connections and onion routing. Int J Adv Res Comput Sci Softw Eng 2(2). ISSN: 2277–128XGoogle Scholar
  28. 28.
    Sahai A, Waters B (2005) Fuzzy identity-based encryption. In: Proceeding of the EUROCRYPT. LNCS, vol 3494. Springer, Berlin, pp 457–473Google Scholar
  29. 29.
    Goyal V, Pandey O, Sahai A et al (2006) Attribute based encryption for fine-grained access control of encrypted data. In: Proceedings of the 13th ACM conference on computer and communications security. ACM, New York, pp 89–98Google Scholar
  30. 30.
    Bethencourt J, Sahai A, Waters B (2007) Ciphertext-policy attribute-based encryption. In: Proceedings of the 2007 IEEE symposium on security and privacy (S &P 2007). IEEE, Piscataway, pp 321–334Google Scholar
  31. 31.
    Cheung L, Newport C (2007) Provably secure ciphertext policy ABE. In: Proceedings of the 14th ACM conference on computer and communications security. ACM, New York, pp 456–465Google Scholar
  32. 32.
    Zhibin Z, Dijiang H (2012) On efficient ciphertext-policy attribute based encryption and broadcast encryption: extended abstract. In: Proceedings of the 17th ACM conference on computer and communications security (CCS ’10). ACM, New York, pp 753–755Google Scholar
  33. 33.
    Emura K, Miyaji A, Nomura A, Omote K, Soshi M (2009) A ciphertext-policy attribute-based encryption scheme with constant ciphertext length. In: Bao F, Li H, Wang G (eds) ISPEC 2009. LNCS, vol 5451. Springer, Heidelberg, pp 13–23Google Scholar
  34. 34.
    Paterson K, Quaglia E (2010) Time-specific encryption. In: Garay J (ed) Proceedings of seventh conference on security and cryptography for NetworksGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Computer Engineering DepartmentSardar Vallabhbhai National Institute of TechnologySuratIndia

Personalised recommendations