Sciweavers

182 search results - page 8 / 37
» Survey on anonymous communications in computer networks
Sort
View
PODC
2006
ACM
15 years 3 months ago
Stably computable predicates are semilinear
We consider the model of population protocols introduced by Angluin et al. [2], in which anonymous finite-state agents stably compute a predicate of their inputs via twoway inter...
Dana Angluin, James Aspnes, David Eisenstat
72
Voted
CCS
2009
ACM
15 years 4 months ago
Scalable onion routing with torsk
We introduce Torsk, a structured peer-to-peer low-latency anonymity protocol. Torsk is designed as an interoperable replacement for the relay selection and directory service of th...
Jon McLachlan, Andrew Tran, Nicholas Hopper, Yongd...
PERCOM
2005
ACM
15 years 9 months ago
A Capability-Based Privacy-Preserving Scheme for Pervasive Computing Environments
Pervasive computing is a future technology that provides a user with the capability to compute and communicate from everywhere. In a pervasive computing environment, a user interac...
Divyan M. Konidala, Dang Nguyen Duc, Dongman Lee, ...
AINA
2006
IEEE
15 years 1 months ago
ARM: Anonymous Routing Protocol for Mobile Ad hoc Networks
Due to the nature of radio transmissions, communications in wireless networks are easy to capture and analyze. Next to this, privacy enhancing techniques (PETs) proposed for wired...
Stefaan Seys, Bart Preneel
PET
2007
Springer
15 years 3 months ago
Pairing-Based Onion Routing
Abstract. This paper presents a novel use of pairing-based cryptography to improve circuit construction in onion routing anonymity networks. Instead of iteratively and interactivel...
Aniket Kate, Gregory M. Zaverucha, Ian Goldberg