|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Key amplification in unstructured networks
If you have a question about this talk, please contact Saar Drimer.
There are a number of scenarios where users wishing to communicate, share a weak secret. Often, they are also part of a common social network. Connections (edges) from the social network are represented as shared link keys between participants (vertices). We propose several mechanisms that utilise the graph topology of such a network, to increase the entropy of weak pre-shared secrets. Our proposals are based on using random walks to efficiently identify a chain of common acquaintances between Alice and Bob, each of which contribute entropy to the final key. Our mechanisms exploit one-wayness and convergence properties of Markovian random walks to, firstly, maximize the set of potential entropy contributors, and second, to resist any contribution from dubious sources by exploiting the community information characteristically present in real world network topologies.
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 listseuroscicon Worms and Bugs Fluid Mechanics (DAMTP)
Other talksWhy does ethics matter to big data? Sovereignty and Imperialism: Non-European Powers in the Age of Empire Sex, Disease and Fertility in History Variation in measures and markers of timeliness of diagnosis in cancer Open Innovation Forum Food & FMCG Pitching Event Fireworks & Waterworks - Spectacular Chemistry Demonstration Lecture