Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Externally Verifiable Oblivious RAM

Externally Verifiable Oblivious RAM AbstractWe present the idea of externally verifiable oblivious RAM (ORAM). Our goal is to allow a client and server carrying out an ORAM protocol to have disputes adjudicated by a third party, allowing for the enforcement of penalties against an unreliable or malicious server. We give a security definition that guarantees protection not only against a malicious server but also against a client making false accusations. We then give modifications of the Path ORAM [15] and Ring ORAM [9] protocols that meet this security definition. These protocols both have the same asymptotic runtimes as the semi-honest original versions and require the external verifier to be involved only when the client or server deviates from the protocol. Finally, we implement externally verified ORAM, along with an automated cryptocurrency contract to use as the external verifier. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Proceedings on Privacy Enhancing Technologies de Gruyter

Externally Verifiable Oblivious RAM

Download PDF
23 pages

Loading next page...
 
/lp/de-gruyter/externally-verifiable-oblivious-ram-A68ocTCmJm
Publisher
de Gruyter
Copyright
© 2017 Joshua Gancher et al., published by De Gruyter Open
ISSN
2299-0984
eISSN
2299-0984
DOI
10.1515/popets-2017-0021
Publisher site
See Article on Publisher Site

Abstract

AbstractWe present the idea of externally verifiable oblivious RAM (ORAM). Our goal is to allow a client and server carrying out an ORAM protocol to have disputes adjudicated by a third party, allowing for the enforcement of penalties against an unreliable or malicious server. We give a security definition that guarantees protection not only against a malicious server but also against a client making false accusations. We then give modifications of the Path ORAM [15] and Ring ORAM [9] protocols that meet this security definition. These protocols both have the same asymptotic runtimes as the semi-honest original versions and require the external verifier to be involved only when the client or server deviates from the protocol. Finally, we implement externally verified ORAM, along with an automated cryptocurrency contract to use as the external verifier.

Journal

Proceedings on Privacy Enhancing Technologies – de Gruyter

Published: Apr 1, 2017

References

  • Circuit On tightness of the Goldreich - Ostrovsky lower bound Communications pages
    Wang
  • Privacy - preserving audit and extraction of digital contents Technical report HP Lab No
    Shah
  • Optimistic fair exchange of digital signatures pages
    Asokan
  • Wichs Onion constant bandwidth blowup oblivious RAM of Conference pages
    Devadas
  • Sirer Thoughts on the dao hack http hackingdistributed com thoughts on the dao hack
  • secure decentralised generalised transaction ledger Technical report Project Yellow Paper
    Wood
  • Goldreich Towards a theory of software protection and simulation by oblivious RAMs InSymposium on Theory of pages
    STOC
  • Wichs Onion constant bandwidth blowup oblivious RAM of Conference pages
    Devadas
  • The blockchain model of cryptography and privacy - preserving smart contracts University of Maryland University
    Kosba
  • Optimistic protocols for fair exchange InProceedings of the th ACM conference on Computer and communications security pages
    Asokan
  • Path An extremely simple oblivious RAM protocol Communications pages
    Stefanov
  • secure decentralised generalised transaction ledger Technical report Project Yellow Paper
    Wood
  • The blockchain model of cryptography and privacy - preserving smart contracts University of Maryland University
    Kosba
  • Publicly verifiable secret sharing in pages
    Stadler
  • Oblivious RAM withO logN worst case cost InAdvances in pages
    Shi
  • Oblivious RAM withO logN worst case cost InAdvances in pages
    Shi
  • Sirer Thoughts on the dao hack http hackingdistributed com thoughts on the dao hack
  • Optimistic protocols for fair exchange InProceedings of the th ACM conference on Computer and communications security pages
    Asokan
  • Constants count practical improvements to oblivious RAM pages
    Ren
  • Path An extremely simple oblivious RAM protocol Communications pages
    Stefanov
  • Constants count practical improvements to oblivious RAM pages
    Ren
  • Verifiable oblivious storage Key pages
    Apon
  • Goldreich Software protection and simulation on oblivious RAMs
    Ostrovsky
  • Goldreich Towards a theory of software protection and simulation by oblivious RAMs InSymposium on Theory of pages
    STOC
  • Optimistic fair exchange of digital signatures pages
    Asokan
  • Privacy - preserving audit and extraction of digital contents Technical report HP Lab No
    Shah
  • Goldreich Software protection and simulation on oblivious RAMs
    Ostrovsky
  • Circuit On tightness of the Goldreich - Ostrovsky lower bound Communications pages
    Wang
  • Verifiable oblivious storage Key pages
    Apon
  • Publicly verifiable secret sharing in pages
    Stadler