Show simple item record

dc.contributor.advisorDevadas, Srinivas
dc.contributor.authorLin, Andrea
dc.date.accessioned2023-07-31T19:47:42Z
dc.date.available2023-07-31T19:47:42Z
dc.date.issued2023-06
dc.date.submitted2023-06-06T16:35:54.500Z
dc.identifier.urihttps://hdl.handle.net/1721.1/151547
dc.description.abstractAnonymous 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.publisherMassachusetts Institute of Technology
dc.rightsIn Copyright - Educational Use Permitted
dc.rightsCopyright retained by author(s)
dc.rights.urihttps://rightsstatements.org/page/InC-EDU/1.0/
dc.titleIntersection Attacks on Discrete Epochs
dc.typeThesis
dc.description.degreeM.Eng.
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
mit.thesis.degreeMaster
thesis.degree.nameMaster of Engineering in Electrical Engineering and Computer Science


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record