| dc.contributor.advisor | Devadas, Srinivas | |
| dc.contributor.author | Lin, Andrea | |
| dc.date.accessioned | 2023-07-31T19:47:42Z | |
| dc.date.available | 2023-07-31T19:47:42Z | |
| dc.date.issued | 2023-06 | |
| dc.date.submitted | 2023-06-06T16:35:54.500Z | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/151547 | |
| dc.description.abstract | Anonymous messaging systems with churn in the set of online users are vulnerable to intersection attacks. Researchers have evaluated the success of the state of the art intersection attack using a model of user messaging simulated from a generated social graph. This thesis compares the success of the state of the art intersection attack using a model simulated from a generated social graph versus models simulated from real social graphs, such as those of Twitter and Google+. We find that users lose anonymity at a slower rate if the model uses a real social graph rather than a generated social graph. | |
| dc.publisher | Massachusetts Institute of Technology | |
| dc.rights | In Copyright - Educational Use Permitted | |
| dc.rights | Copyright retained by author(s) | |
| dc.rights.uri | https://rightsstatements.org/page/InC-EDU/1.0/ | |
| dc.title | Intersection Attacks on Discrete Epochs | |
| dc.type | Thesis | |
| dc.description.degree | M.Eng. | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| mit.thesis.degree | Master | |
| thesis.degree.name | Master of Engineering in Electrical Engineering and Computer Science | |