Effective erasure codes for reliable computer communication protocols
ACM SIGCOMM Computer Communication Review
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
SNDSS '96 Proceedings of the 1996 Symposium on Network and Distributed System Security (SNDSS '96)
Statistical Identification of Encrypted Web Browsing Traffic
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Mixminion: Design of a Type III Anonymous Remailer Protocol
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Towards an information theoretic metric for anonymity
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
On flow correlation attacks and countermeasures in mix networks
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
About priority encoding transmission
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Wireless Networks are susceptible to anonymous monitoring of transmissions by adversaries who can infer valuable information about data flows in the network. It is therefore necessary to design network protocols that maintain secrecy of routes from eavesdroppers. In this work, we present a mathematical formulation of route secrecy when eavesdroppers observe transmission epochs of nodes. We consider networks where the nodes use receiver directed signaling schemes and each node has a strict delay constraint for relaying packets. We propose a scheduling technique to provide complete secrecy of routes, and based on that, characterize achievable rate regions for two-hop data routes under the given constraints. Furthermore, we extend the results when an additional constraint on packet loss is imposed.