Author:
Bennett Krista,Grothoff Christian
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Lecture Notes in Computer Science;K. Bennett,2002
2. Castro, M., Druschel, P., Hu, Y., Rowstron, A.: Exploiting network proximity in distributed hash tables. In: Proceedings of the International Workshop on Future Directions in Distributed Computing (2002)
3. Chaum, D.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM 24(2), 84–88 (1981)
4. Chaum, D.: The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptography, 65–75 (1988)
5. Lecture Notes in Computer Science;I. Clarke,2001
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Survey on Anonymous Communication Systems With a Focus on Dining Cryptographers Networks;IEEE Access;2023
2. Ant Colony Optimization based approach to filter IP Address from TOR network;2022 IEEE Conference on Interdisciplinary Approaches in Technology and Management for Social Innovation (IATMSI);2022-12-21
3. Anonymous Short Communications over Social Networks;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2021
4. Webs of Trust: Choosing Who to Trust on the Internet;Privacy Technologies and Policy;2020
5. A Survey on Routing in Anonymous Communication Protocols;ACM Computing Surveys;2019-05-31