Abstract
Abstract
Organizational networks are vulnerable to trafficanalysis attacks that enable adversaries to infer sensitive information fromnetwork traffic—even if encryption is used. Typical anonymous communication networks are tailored to the Internet and are poorly suited for organizational networks.We present PriFi, an anonymous communication protocol for LANs, which protects users against eavesdroppers and provides high-performance traffic-analysis resistance. PriFi builds onDining Cryptographers networks (DC-nets), but reduces the high communication latency of prior designs via a new client/relay/server architecture, in which a client’s packets remain on their usual network path without additional hops, and in which a set of remote servers assist the anonymization process without adding latency. PriFi also solves the challenge of equivocation attacks, which are not addressed by related work, by encrypting traffic based on communication history. Our evaluation shows that PriFi introduces modest latency overhead (≈ 100ms for 100 clients) and is compatible with delay-sensitive applications such as Voice-over-IP.
Reference88 articles.
1. [1] S. Angel and S. Setty. Unobservable communication over fully untrusted infrastructure. In 12th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 16), pages 551–569, 2016.
2. [2] L. Barman, M. Zamani, I. Dacosta, J. Feigenbaum, B. Ford, J.- P. Hubaux, and D. Wolinsky. PriFi: A low-latency and trackingresistant protocol for local-area anonymous communication. In Proceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society, pages 181–184. ACM, 2016.10.1145/2994620.2994623
3. [3] L. Barman, I. Dacosta, M. Zamani, E. Zhai, B. Ford, J.-P. Hubaux, and J. Feigenbaum. PriFi: Low-latency metadata protection for organizational network (extended version). https://arxiv.org/abs/1710.10237, 2020.
4. [4] M. Blum, P. Feldman, and S. Micali. Non-interactive zero-knowledge and its applications. In Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 103–112. ACM, 1988.10.1145/62212.62222
5. [5] D. Boneh. The decision diffie-hellman problem. In International Algorithmic Number Theory Symposium, pages 48–63. Springer, 1998.10.1007/BFb0054851
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献