BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Dynamic PDP vs. Dynamic POR: Are they really different?  - Alpteki
 n Kupcu\, Koc University
DTSTART:20150114T113000Z
DTEND:20150114T123000Z
UID:TALK57210@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:As many services are moving to the cloud\, we are losing contr
 ol of our own data. This constitutes one of the biggest problems that we f
 ace in this decade. The talk will start simple\, presenting basics of cryp
 tographic mechanisms for security protection of outsourced data. \nThe bas
 ics will include data structures\, such as rank-based authenticated skip l
 ists\, used in dynamic provable data possession (DPDP) schemes. Later\, we
  will switch gears\, and talk about dynamic proofs of retrievability (DPOR
 ) schemes. At the technical level\, the difference is that the POR-type sc
 hemes employ erasure codes. We will see how the first DPOR scheme PORAM is
  achieved with the help of oblivious RAM\, and then informally talk about 
 some latest results on how to achieve DPOR without the full complexity of 
 the oblivious RAM constructions. As a surprise\, we will talk about how to
  achieve DPOR using only static PDP and DPDP\, meaning that the first DPOR
  scheme existed (though no one knew) in 2009 already. Finally\, we will co
 nclude with a philosophical discussion of their difference in practice\n
LOCATION:Small Lecture Theatre\, Microsoft Research Ltd\, 21 Station Road\
 , Cambridge\, CB1 2FB
END:VEVENT
END:VCALENDAR