Klein bottle routing: an alternative to onion routing and mix network

Authors:
Kun Peng;Juan Manuel Nieto;Yvo Desmedt;Ed Dawson
Affiliations:
Information Security Institute, Queensland University of Technology;Information Security Institute, Queensland University of Technology;University College London;Information Security Institute, Queensland University of Technology
Venue:
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Year:
2006

Citing 11
Cited 1

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Onion routing

Communications of the ACM
A verifiable secret shuffle and its application to e-voting

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
A Three Phased Schema for Sealed Bid Auction System Design

ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
An Efficient Scheme for Proving a Shuffle

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Threshold Cryptosystems

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
A Verifiable Secret Shuffle of Homomorphic Encryptions

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Breaking four mix-related schemes based on universal re-encryption

ISC'06 Proceedings of the 9th international conference on Information Security
Onions based on universal re-encryption – anonymous communication immune against repetitive attack

WISA'04 Proceedings of the 5th international conference on Information Security Applications
A formal treatment of onion routing

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Simple and efficient shuffling with provable correctness and ZK privacy

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology

Anonymous return route information for onion based mix-nets

Proceedings of the workshop on Applications of private and anonymous communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditionally, there are two methods to implement anonymous channels: free-route networks like onion routing and cascade networks like mix network. Each of them has its merits and is suitable for some certain applications of anonymous communication. Both of them have their own drawbacks, so neither of them can satisfy some applications. A third solution to anonymous channels, Klein bottle routing, is proposed in this paper. It fills the gap between onion routing and mix network and can be widely employed in anonymous communication.