|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Anonymity in the wild: Mixes on unstructured networks
If you have a question about this talk, please contact Saar Drimer.
With the growth in decentralised systems, unstructured networks including social networks are natural candidates for mix network topologies that are resilient against a well funded adversary who blocks access to a centralised mix-network. We consider mix topologies where mixes are placed on the nodes of a social network. We analyse the anonymity such networks provide under high latency conditions, and compare it with other sparsely connected mix networks. We prove that real network topologies such as scale-free networks mix efficiently. We also analyse mix topologies from the Klienberg small world and scale-free random graphs, using simulations and compare their performance with expander graphs. We also show that mix networks over unstructured topologies are resilient to vertex-order attacks of Barabasi-Albert, however batch sizes required for preventing intersection attacks could be a challenging requirement to meet.
Shishir Nagaraja’s webpage can be found here
This talk is part of the Computer Laboratory Security Seminar series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsNaked mole-rats Cambridge Lovelace Hackathons Joint Machine Learning Seminars
Other talksPretence and creativity during childhood and beyond A short history of the microscope Modeling the Physical Multi-Phase Interactions of HNO3 Between Snow and Air on the Antarctic Plateau (Dome C) and coast (Halley) A classification of real-line group actions with faithful Connes--Takesaki modules on hyperfinite factors Pathology and preparations at the Great Windmill Street School A V HILL LECTURE - Systems level in vivo modelling of vertebrate physiology and pharmacology