@inproceedings{6a2ce89d19d147e2b32c99a24df35189,
title = "Privacy amplification with social networks",
abstract = "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 mechanisms that utilise the graph topology of such a network, to increase the entropy of weak pre-shared secrets. Our proposal is based on using random walks to 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 such as Sybill sub-networks.",
keywords = "social network, random walk, random graph, small world networks, graph topology",
author = "Shishir Nagaraja",
year = "2010",
month = jan,
day = "1",
doi = "10.1007/978-3-642-17773-6_7",
language = "English",
isbn = "3642177727",
volume = "5964 ",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "58--73",
editor = "Christianson, {Bruce } and Crispo, {Bruno } and Malcolm, {James A. } and Roe, {Michael }",
booktitle = "Security Protocols - 15th International Workshop, Revised Selected Papers",
note = "15th International Workshop on Security Protocols ; Conference date: 18-04-2007 Through 20-04-2007",
}