References of "Egners, Andre"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailIntroducing SOR: SSH-based Onion Routing
Egners, Andre; Gatzen, Dominic; Panchenko, Andriy UL et al

in 26th IEEE International Conference on Advanced Information Networking and Applications (2012)

Detailed reference viewed: 94 (1 UL)
Full Text
Peer Reviewed
See detailLightweight Hidden Services
Panchenko, Andriy UL; Spaniol, Otto; Egners, Andre et al

in 10th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (IEEE TrustCom 2011) (2011)

Hidden services (HS) are mechanisms designed to provide network services while preserving anonymity for the identity of the server. Besides protecting the identity of the server, hidden services help to ... [more ▼]

Hidden services (HS) are mechanisms designed to provide network services while preserving anonymity for the identity of the server. Besides protecting the identity of the server, hidden services help to resist censorship, are resistant against distributed DoS attacks, and allow server functionality even if the service provider does not own a public IP address. Currently, only the Tor network offers this feature in full functionality. However, the HS concept in Tor is complex and provides poor performance. According to recent studies, average contact time for a hidden service is 24s which is far beyond what an average user is willing to wait. In this paper we introduce a novel approach for hidden services that achieves similar functionality as HS in Tor but does so in a simple and lightweight way with the goal to improve performance and usability. Additionally, contrary to Tor, in our approach clients are not required to install any specific software for accessing hidden services. This increases usability of our approach. Simplicity makes our approach easier to understand for normal users, eases protocol reviews, and increases chances of having several implementations of the protocol available. Moreover, simpler solutions are easier to analyze and they are naturally less prone to implementation failures rather than complex protocols. In this paper, we describe our approach and provide performance as well as anonymity analysis of resulting properties of the protocol. [less ▲]

Detailed reference viewed: 86 (0 UL)