BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Private Information Retrieval with Sublinear Online Time
DTSTART:20191210T151500
DTSTAMP:20260407T033532Z
UID:136d2ee38262e1835f4755112cfc56c87d6d64ca698e5e28a8c8b34e
CATEGORIES:Conferences - Seminars
DESCRIPTION:Dima Kogan\, Stanford University\nAbstract\nWe present the fir
 st protocols for private information retrieval that allow fast (sublinear-
 time) database lookups without increasing the server-side storage requirem
 ents. To achieve these efficiency goals\, our protocols work in an offline
 /online model. In an offline phase\, which takes place before the client h
 as decided which database bit it wants to read\, the client fetches a shor
 t string from the servers. In a subsequent online phase\, the client can p
 rivately retrieve its desired bit of the database by making a second query
  to the servers. By pushing the bulk of the server-side computation into t
 he offline phase (which is independent of the client's query)\, our protoc
 ols allow the online phase to complete very quickly—in time sublinear in
  the size of the database. Finally\, we prove that our protocols are optim
 al in terms of the trade-off they achieve between communication and runnin
 g time. Joint work with Henry Corrigan-Gibbs\n \nBiography\nDmitry Kogan 
 is a fourth-year PhD student at Stanford University working on cryptograph
 y and security with Dan Boneh and David Mazières. Dmitry holds an MSc in 
 computer science from the Weizmann Institute\, and a BSc in mathematics\, 
 physics\, and computer science from the Hebrew University. He previously w
 orked on data analytics and account security at Google. His research has r
 eceived best young researcher awards at Eurocrypt and TCC.\n 
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR