New bounds for randomized busing

Authors:
Steven S. Seiden;Peter P. Chen;R. F. Lax;J. Chen;Guoli Ding
Affiliations:
Department of Computer Science, LSU, Baton Rouge, LA;Department of Computer Science, LSU, Baton Rouge, LA;Department of Mathematics, LSU, Baton Rouge, LA;Department of Computer Science, LSU, Baton Rouge, LA;Department of Mathematics, LSU, Baton Rouge, LA
Venue:
Theoretical Computer Science
Year:
2005

Citing 12
Cited 0

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Cryptographic defense against traffic analysis

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Randomized algorithms

Randomized algorithms
Random Walks on Regular and Irregular Graphs

SIAM Journal on Discrete Mathematics
Adaptively secure multi-party computation

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times

SIAM Journal on Computing
Xor-trees for efficient anonymous multicast and reception

ACM Transactions on Information and System Security (TISSEC)
Untraceable electronic mail, return addresses, and digital pseudonyms

Communications of the ACM
Anonymous Connections and Onion Routing

SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider anonymous secure communication, where parties not only wish to conceal their communications from outside observers, but also wish to conceal the very fact that they are communicating. We consider the bus framework introduced by Beimel and Dolev (J. Cryptology 16 (2003) 25), where messages are delivered by a bus traveling on a random walk. We generalize this idea to consider more than one bus. We show that if w buses are allowed, then the expected delivery time for a message can be decreased from Θ(n) to Θ(n/√w) in the case of a complete graph. Additionally, we introduce a class of graphs called r-partite directed collars and obtain analogous bounds on the expected delivery time for these graphs. We also propose several new features that resolve possible shortcomings in the systems proposed by Beimel and Dolev.