Atom
© 2017 Copyright held by the owner/author(s). Publication rights licensed to Association for Computing Machinery. Atom is an anonymous messaging system that protects against traffic-analysis attacks. Unlike many prior systems, each Atom server touches only a small fraction of the total messages rout...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery (ACM)
2022
|
| Online Access: | https://hdl.handle.net/1721.1/137543.2 |
| _version_ | 1811091521241350144 |
|---|---|
| author | Kwon, Albert Corrigan-Gibbs, Henry Devadas, Srinivas Ford, Bryan |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Kwon, Albert Corrigan-Gibbs, Henry Devadas, Srinivas Ford, Bryan |
| author_sort | Kwon, Albert |
| collection | MIT |
| description | © 2017 Copyright held by the owner/author(s). Publication rights licensed to Association for Computing Machinery. Atom is an anonymous messaging system that protects against traffic-analysis attacks. Unlike many prior systems, each Atom server touches only a small fraction of the total messages routed through the network. As a result, the system’s capacity scales near-linearly with the number of servers. At the same time, each Atom user benefits from “best possible” anonymity: a user is anonymous among all honest users of the system, even against an active adversary who monitors the entire network, a portion of the system’s servers, and any number of malicious users. The architectural ideas behind Atom have been known in theory, but putting them into practice requires new techniques for (1) avoiding heavy general-purpose multi-party computation protocols, (2) defeating active attacks by malicious servers at minimal performance cost, and (3) handling server failure and churn. Atom is most suitable for sending a large number of short messages, as in a microblogging application or a high-security communication bootstrapping (“dialing”) for private messaging systems. We show that, on a heterogeneous network of 1,024 servers, Atom can transit a million Tweet-length messages in 28 minutes. This is over 23× faster than prior systems with similar privacy guarantees. |
| first_indexed | 2024-09-23T15:03:42Z |
| format | Article |
| id | mit-1721.1/137543.2 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T15:03:42Z |
| publishDate | 2022 |
| publisher | Association for Computing Machinery (ACM) |
| record_format | dspace |
| spelling | mit-1721.1/137543.22024-05-31T20:31:17Z Atom Horizontally Scaling Strong Anonymity Kwon, Albert Corrigan-Gibbs, Henry Devadas, Srinivas Ford, Bryan Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory © 2017 Copyright held by the owner/author(s). Publication rights licensed to Association for Computing Machinery. Atom is an anonymous messaging system that protects against traffic-analysis attacks. Unlike many prior systems, each Atom server touches only a small fraction of the total messages routed through the network. As a result, the system’s capacity scales near-linearly with the number of servers. At the same time, each Atom user benefits from “best possible” anonymity: a user is anonymous among all honest users of the system, even against an active adversary who monitors the entire network, a portion of the system’s servers, and any number of malicious users. The architectural ideas behind Atom have been known in theory, but putting them into practice requires new techniques for (1) avoiding heavy general-purpose multi-party computation protocols, (2) defeating active attacks by malicious servers at minimal performance cost, and (3) handling server failure and churn. Atom is most suitable for sending a large number of short messages, as in a microblogging application or a high-security communication bootstrapping (“dialing”) for private messaging systems. We show that, on a heterogeneous network of 1,024 servers, Atom can transit a million Tweet-length messages in 28 minutes. This is over 23× faster than prior systems with similar privacy guarantees. 2022-05-31T20:19:51Z 2021-11-05T16:46:03Z 2022-05-31T20:19:51Z 2017-10 2017-10 2019-05-28T16:23:07Z Article http://purl.org/eprint/type/ConferencePaper 978-1-4503-5085-3 https://hdl.handle.net/1721.1/137543.2 Kwon, Albert, Corrigan-Gibbs, Henry, Devadas, Srinivas and Ford, Bryan. 2017. "Atom: Horizontally Scaling Strong Anonymity." en http://dx.doi.org/10.1145/3132747.3132755 SOSP 2017: Proceedings of the 26th Symposium on Operating Systems Principles Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/octet-stream Association for Computing Machinery (ACM) arXiv |
| spellingShingle | Kwon, Albert Corrigan-Gibbs, Henry Devadas, Srinivas Ford, Bryan Atom |
| title | Atom |
| title_full | Atom |
| title_fullStr | Atom |
| title_full_unstemmed | Atom |
| title_short | Atom |
| title_sort | atom |
| url | https://hdl.handle.net/1721.1/137543.2 |
| work_keys_str_mv | AT kwonalbert atom AT corrigangibbshenry atom AT devadassrinivas atom AT fordbryan atom AT kwonalbert horizontallyscalingstronganonymity AT corrigangibbshenry horizontallyscalingstronganonymity AT devadassrinivas horizontallyscalingstronganonymity AT fordbryan horizontallyscalingstronganonymity |