Anonymous communication with on-line and off-line onion encoding

Authors:
Marek Klonowski;Mirosław Kutyłowski;Filip Zagórski
Affiliations:
Institute of Mathematics, Wrocław University of Technology;Institute of Mathematics, Wrocław University of Technology;Institute of Mathematics, Wrocław University of Technology
Venue:
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Year:
2005

Citing 9
Cited 6

The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
Cryptographic defense against traffic analysis

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Untraceable electronic mail, return addresses, and digital pseudonyms

Communications of the ACM
Hiding Routing Information

Proceedings of the First International Workshop on Information Hiding
Mixing Email with Babel

SNDSS '96 Proceedings of the 1996 Symposium on Network and Distributed System Security (SNDSS '96)
Tor: the second-generation onion router

SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Reputable mix networks

PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
An improved construction for universal re-encryption

PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
Onions based on universal re-encryption – anonymous communication immune against repetitive attack

WISA'04 Proceedings of the 5th international conference on Information Security Applications

Anonymous communications in the Internet

Cluster Computing
Anonymous return route information for onion based mix-nets

Proceedings of the workshop on Applications of private and anonymous communications
Hiding Data Sources in P2P Networks

Proceedings of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005
Repelling detour attack against onions with re-encryption

ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Breaking four mix-related schemes based on universal re-encryption

ISC'06 Proceedings of the 9th international conference on Information Security
Local view attack on anonymous communication

ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Anonymous communication with onions requires that a user application determines the whole routing path of an onion. This scenario has certain disadvantages, it might be dangerous in some situations, and it does not fit well to the current layered architecture of dynamic communication networks. We show that applying encoding based on universal re-encryption can solve many of these problems by providing much flexibility – the onions can be created on-the-fly or in advance by different parties.