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
Unconditional sender and recipient untraceability in spite of active attacks
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Cryptographic defense against traffic analysis
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Adaptively secure multi-party computation
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomness vs. fault-tolerance
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed 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
ISDN-MIXes: Untraceable Communication with Small Bandwidth Overhead
Kommunikation in Verteilten Systemen, Grundlagen, Anwendungen, Betrieb, GI/ITG-Fachtagung
| Hi-index | 0.89 |
In this paper, we shall propose a scheme for anonymous multicast and reception. Since the scheme can hide the identity of the receiver, we can resist the attack of traffic analysis. Besides that, we shall also extend our method to anonymous multicast. In our new scheme of multicast, we shall propose a new idea for seeds distribution that can also be applied to anonymous reception of messages.On top of all those above, in this paper, we shall reveal how we have solved the problem of synchronization, which is quite an accomplishment in a massive network, a new altitude that has never been reached.