Fully Non-interactive Onion Routing with Forward-Secrecy

  • Dario Catalano
  • Mario Di Raimondo
  • Dario Fiore
  • Rosario Gennaro
  • Orazio Puglisi
Conference paper

DOI: 10.1007/978-3-642-21554-4_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6715)
Cite this paper as:
Catalano D., Di Raimondo M., Fiore D., Gennaro R., Puglisi O. (2011) Fully Non-interactive Onion Routing with Forward-Secrecy. In: Lopez J., Tsudik G. (eds) Applied Cryptography and Network Security. ACNS 2011. Lecture Notes in Computer Science, vol 6715. Springer, Berlin, Heidelberg

Abstract

In this paper we put forward a new onion routing protocol which achieves forward secrecy in a fully non-interactive fashion, without requiring any communication from the router and/or the users and the service provider to update time-related keys. We compare this to TOR which requires O(n2) rounds of interaction to establish a circuit of size n. In terms of the computational effort required to the parties, our protocol is comparable to TOR, but the network latency associated with TOR’s high round complexity ends up dominating the running time. Compared to other recently proposed alternative to TOR (such as the PB-OR and CL-OR protocols) our scheme still has the advantage of being non-interactive (both PB-OR and CL-OR require some interaction to update time-sensitive information), and achieves similar computational performances. We performed extensive implementation and simulation tests that confirm our theoretical analysis. Additionally, while comparing our scheme to PB-OR, we discovered a flaw in the security of that scheme which we repair in this paper.

Our solution is based on the application of forward-secure encryption. We design a forward-secure encryption scheme (of independent interest) to be used as the main encryption scheme in an onion routing protocol.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Dario Catalano
    • 1
  • Mario Di Raimondo
    • 1
  • Dario Fiore
    • 2
  • Rosario Gennaro
    • 3
  • Orazio Puglisi
    • 1
  1. 1.Dipartimento di Matematica ed InformaticaUniversità di CataniaItaly
  2. 2.École Normale SupérieureCNRS - INRIAParisFrance
  3. 3.Watson Research CenterIBM T.J.HawthorneUSA

Personalised recommendations