13 search results - page 1 / 3 » Ephemeral Pairing on Anonymous Networks |
SPC
2005
Springer
14 years 4 months ago
2005
Springer
The ephemeral pairing problem requires two or more specific physical nodes in a wireless broadcast network, that do not yet know each other, to establish a short-term relationship...
FC
2004
Springer
14 years 4 months ago
2004
Springer
Abstract In wireless ad-hoc broadcast networks the pairing problem consists of establishing a (long-term) connection between two specific physical nodes in the network that do not...
PET
2007
Springer
14 years 5 months ago
2007
Springer
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...
INFOCOM
2005
IEEE
14 years 4 months ago
2005
IEEE
— Due to the broadcast nature of radio transmissions, communications in mobile ad hoc networks (MANETs) are more susceptible to malicious traffic analysis. In this paper we prop...
WWW
2007
ACM
14 years 11 months ago
2007
ACM
In a social network, nodes correspond to people or other social entities, and edges correspond to social links between them. In an effort to preserve privacy, the practice of anon...