BEGIN:VCALENDAR
PRODID;X-RICAL-TZSOURCE=TZINFO:-//Calagator//EN
CALSCALE:GREGORIAN
X-WR-CALNAME:Calagator
METHOD:PUBLISH
VERSION:2.0
BEGIN:VTIMEZONE
TZID;X-RICAL-TZSOURCE=TZINFO:America/Los_Angeles
BEGIN:DAYLIGHT
DTSTART:20140309T020000
RDATE:20140309T020000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
CREATED;VALUE=DATE-TIME:20140417T231443Z
DTEND;TZID=America/Los_Angeles;VALUE=DATE-TIME:20140425T110000
DTSTART;TZID=America/Los_Angeles;VALUE=DATE-TIME:20140425T100000
DTSTAMP;VALUE=DATE-TIME:20140417T231443Z
LAST-MODIFIED;VALUE=DATE-TIME:20140417T231443Z
UID:http://calagator.org/events/1250466038
DESCRIPTION:abstract: What if you want to store encrypted files on an unt
 rusted Cloud Server in such a way that Server does not even know if you 
 are editing the same file today as you were yesterday\, or anything else
  about your usage patterns other than total amount of traffic to the Ser
 ver? Clearly\, no matter how strong of an encryption you use\, access pa
 ttern is revealed: Cloud Server can simply track where on the hard drive
  you read/write from – clearly encryption does not hide that information
 . One naive solution to prevent revealing access pattern to the Server i
 s to simply read all your data back from the Server and re-write your en
 tire data back to Server in its entirety for each read/write. This works
 \, but it is clearly impractical. Oblivious Random Access Memory (ORAM) 
 is an algorithm that allows you to completely hide arbitrary access patt
 ern in an efficient manner. In this talk\, I will describe Oblivious RAM
  from the ground up\, starting from my own Ph.D. thesis work on this top
 ic (STOC 1990\, MIT Ph.D. 1992) which showed the first efficient ORAM. T
 he Journal Version of this work gained over 450 references according to 
 Google Scholar [Ostrovsky-Goldreich JACM 1996] and ORAM became an import
 ant area of research in Cryptography in the last 5 years. I will describ
 e surprising connections of ORAM to (1) tamper-proof embedded systems\, 
 (2) Software Protection (3) Secure Multi-Party and Secure Two Party Comp
 utation as well as (4) ways to securely compile programs with loops\, “g
 oto” statements\, recursion\, etc. into Garbled programs without “unroll
 ing” the execution path\, yet not revealing anything about the execution
  path. I will also compare and contrast ORAM to Single-Server Private In
 formation Retrieval (Single-server PIR)\, which I co-invented with Kushi
 levitz in 1997\, and explain important differences of these two models. 
 The talk will be self-contained and accessible to the general audience.&
 #13\;\n&#13\;\nSpeaker bio: Rafail Ostrovsky is a Professor of Computer 
 Science and Professor of Mathematics at UCLA and co-founder of Stealth S
 oftware Technologies\, Inc. He has over 200 papers published in refereed
  journals and conferences and has 11 U.S. Patents issued. In 2013\, Dr. 
 Ostrovsky was inducted as an IACR (International Association of Cryptolo
 gic Research) Fellow. He currently serves as Vice-Chair of the IEEE Tech
 nical Committee on Mathematical Foundations of Computing and has served 
 on 38 international conference Program Committees including serving as a
  PC chair of FOCS 2011. He is a member of the Editorial Board of JACM\, 
 the Editorial Board of Algorithmica\; and the Editorial Board of Journal
  of Cryptology\; he serves on the Editorial and Advisory Board of the In
 ternational Journal of Information and Computer Security and is a member
  of the steering committee of the international symposium of Security in
  Communication Networks (SCN). He is a recipient of multiple academic aw
 ards and honors and has google h-index factor of 55. At UCLA\, Prof. Ost
 rovsky heads security and cryptography multi-disciplinary Research Cente
 r (http://www.cs.ucla.edu/security/) at Henry Samueli School of Engineer
 ing and Applied Science.\n\nTags: Galois tech talk\, cryptography\, secu
 rity\, privacy\n\nImported from: http://calagator.org/events/1250466038
URL:http://corp.galois.com/blog/2014/4/17/tech-talk-a-gentle-introduction
 -to-hiding-usage-patterns.html
SUMMARY:Galois tech talk: A Gentle Introduction to Hiding Usage Patterns
LOCATION:Galois\, Inc: 421 SW 6th Ave. Suite 300\, Portland OR 97204 US
SEQUENCE:1
END:VEVENT
END:VCALENDAR