Improving Efficiency and Simplicity of Tor Circuit Establishtment and Hidden Services

Abstract

In this paper we demonstrate how to reduce the overhead and delay of circuit establishment in the Tor anonymizing network by using predistributed Diffie-Hellman values. We eliminate the use of RSA encryption and decryption from circuit setup, and we reduce the number of DH exponentiations vs. the current Tor circuit setup protocol while maintaining immediate forward secrecy. We also describe savings that can be obtained by precomputing during idle cycles values that can be determined before the protocol starts. We introduce the distinction of eventual vs. immediate forward secrecy and present protocols that illustrate the distinction. These protocols are even more efficient in communication and computation than the one we primarily propose, but they provide only eventual forward secrecy. We describe how to reduce the overhead and the complexity of hidden server connections by using our DH-values to implement valet nodes and eliminate the need for rendezvous points as they exist today. We also discuss the security of the new elements and an analysis of efficiency improvements.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 2007
Accession Number
ADA474921

Entities

People

  • Lasse Oeverlier
  • Paul Syverson

Organizations

  • Norwegian Defence Research Establishment

Tags

Communities of Interest

  • Engineered Resilient Systems

DTIC Thesaurus Topics

  • Anonymous Communications
  • Asymetric Encryption
  • Authentication
  • Communication Channels
  • Computations
  • Cryptography
  • Demographic Cohorts
  • Directories
  • Efficiency
  • Information Operations
  • Materials
  • Mathematics
  • Military Research
  • Rendezvous
  • Security
  • Standards

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computer Networking
  • Systems Analysis and Design