|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 listsCivil Engineering Talks George Pitt-Rivers Seminar Series Cambridge Virology Seminars
Other talksHealth Economics @ Cambridge seminar Evening talk & Film screening: savage messiah " 50 years of Computing - A Cambridge Perspective" Consumption and trade in East Anglian market towns and their hinterlands in the late middle ages The MInT study: Effectively communicating about, and intervening with, overweight in young children Defining Autism Since 1979: The Sciences of Social Impairment