The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Detection of disrupters in the DC protocol
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
A protocol for anonymous communication over the Internet
Proceedings of the 7th ACM conference on Computer and communications security
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Proceedings of the First International Workshop on Information Hiding
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
Mixminion: Design of a Type III Anonymous Remailer Protocol
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
ARM: Anonymous Routing Protocol for Mobile Ad hoc Networks
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 02
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
MASK: anonymous on-demand routing in mobile ad hoc networks
IEEE Transactions on Wireless Communications
Slotted packet counting attacks on anonymity protocols
AISC '09 Proceedings of the Seventh Australasian Conference on Information Security - Volume 98
ACM SIGSOFT Software Engineering Notes
Improving the efficiency of anonymous routing for MANETs
Computer Communications
| Hi-index | 0.00 |
While communicating wireless every node residing in communication range of the sending node is able to eavesdrop the communication. The content of the messages can be kept confidential by encryption. On the other hand the communication partners are still known. Even if no personal information like source and destination address is included in the message an attacker might reveal the communication partners with the help of traffic analysis. In this paper the Acimn protocol is introduced which enables anonymous communication in multi hop wireless networks. It bases on the combination of the dining cryptographers networks and layered encryption. Both, the message overhead and the overhead due to cryptographic algorithms, is kept small while the protocol offers protection against traffic analysis attacks.