BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Quantifying Location Privacy - George Theodorakopoulos (EPFL\, Uni
 versity of Derby)
DTSTART:20111117T160000Z
DTEND:20111117T170000Z
UID:TALK33339@talks.cam.ac.uk
CONTACT:Eiko Yoneki
DESCRIPTION:The popularity of personal communication devices leads to seri
 ous concerns about privacy in general\, and location privacy in particular
 .\nAs a response to these issues\, a number of Location-Privacy Protection
  Mechanisms (LPPMs) have been proposed during the last decade. However\, t
 heir assessment and comparison remains problematic because of the absence 
 of a systematic method to quantify them. In particular\, the assumptions a
 bout the attacker's model tend to be incomplete\, with the risk of a possi
 bly wrong estimation of the users' location privacy.\n\nI will talk about 
 how we address these issues by providing a formal framework for the analys
 is of LPPMs\; it captures\, in particular\, the prior information that mig
 ht be available to the attacker\, and various attacks that he can perform.
  By formalizing the adversary's performance\, we propose and justify the r
 ight metric to quantify location privacy. We find that popular privacy met
 rics\, such as k-anonymity and entropy\, do not correlate well with the su
 ccess of the adversary in inferring users'\nlocations.\n\nJoint work with 
 R. Shokri\, J.-Y. Le Boudec\, and J.-P. Hubaux.\n\n\nBio: George Theodorak
 opoulos is a Lecturer/Senior Lecturer at the University of Derby. He recei
 ved his B.Sc. at the National Technical University of Athens (NTUA)\, Gree
 ce\, and his M.Sc. and Ph.D. at the University of Maryland\, in 2002\, 200
 4 and 2007\, respectively. From\n2007 to 2011\, he was a senior researcher
  at EPFL working with Prof.\nJean-Yves Le Boudec.\n\nHis research is on ne
 twork security\, privacy\, and trust. Together with his Ph.D. advisor\, Jo
 hn S. Baras\, he has received the best paper award at WiSe'04\, the 2007 I
 EEE ComSoc Leonard Abraham prize\, and he has co-authored the book "Path P
 roblems in Networks" on algebraic\n(semiring) generalizations of shortest 
 path algorithms and their applications to networking problems.\n
LOCATION:SS03\, Computer Lab\, William Gates Building
END:VEVENT
END:VCALENDAR