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

Learn More →

Recursive Trees for Practical ORAM

Recursive Trees for Practical ORAM Abstract We present a new, general data structure that reduces the communication cost of recent tree-based ORAMs. Contrary to ORAM trees with constant height and path lengths, our new construction r -ORAM allows for trees with varying shorter path length. Accessing an element in the ORAM tree results in different communication costs depending on the location of the element. The main idea behind r -ORAM is a recursive ORAM tree structure, where nodes in the tree are roots of other trees. While this approach results in a worst-case access cost (tree height) at most as any recent tree-based ORAM, we show that the average cost saving is around 35% for recent binary tree ORAMs. Besides reducing communication cost, r -ORAM also reduces storage overhead on the server by 4% to 20% depending on the ORAM’s client memory type. To prove r -ORAM’s soundness, we conduct a detailed overflow analysis. r -ORAM’s recursive approach is general in that it can be applied to all recent tree ORAMs, both constant and poly-log client memory ORAMs. Finally, we implement and benchmark r -ORAM in a practical setting to back up our theoretical claims. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Proceedings on Privacy Enhancing Technologies de Gruyter

Recursive Trees for Practical ORAM

Download PDF
20 pages

Loading next page...
 
/lp/de-gruyter/recursive-trees-for-practical-oram-1oOY0XDm9r

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
de Gruyter
Copyright
Copyright © 2015 by the
ISSN
2299-0984
eISSN
2299-0984
DOI
10.1515/popets-2015-0010
Publisher site
See Article on Publisher Site

Abstract

Abstract We present a new, general data structure that reduces the communication cost of recent tree-based ORAMs. Contrary to ORAM trees with constant height and path lengths, our new construction r -ORAM allows for trees with varying shorter path length. Accessing an element in the ORAM tree results in different communication costs depending on the location of the element. The main idea behind r -ORAM is a recursive ORAM tree structure, where nodes in the tree are roots of other trees. While this approach results in a worst-case access cost (tree height) at most as any recent tree-based ORAM, we show that the average cost saving is around 35% for recent binary tree ORAMs. Besides reducing communication cost, r -ORAM also reduces storage overhead on the server by 4% to 20% depending on the ORAM’s client memory type. To prove r -ORAM’s soundness, we conduct a detailed overflow analysis. r -ORAM’s recursive approach is general in that it can be applied to all recent tree ORAMs, both constant and poly-log client memory ORAMs. Finally, we implement and benchmark r -ORAM in a practical setting to back up our theoretical claims.

Journal

Proceedings on Privacy Enhancing Technologies – de Gruyter

Published: Jun 1, 2015

References

  • Private information storage extended abstract InProceedings of the Symposium on Theory of pages
    Ostrovsky
  • Replication is not needed : Single database computationally - private information retrieval InProceedings of Foundations of pages
    Eyal Kushilevitz
  • Goldreich Software protection and simulation on oblivious rams ISSN acm org
    Oded
  • Behavior of tandem buffers with geometric input and markovian output Communications Transactions on
    Hsu
  • source code http pasmac ccs neu edu resources zip
    PASMAC
  • Emil Path an extremely simple oblivious RAM protocol Conference on Communications pages
    Stefanov
  • Path - pir : Lower worst - case bounds by combining oram and pir InProceedings of the Network and Distributed System San
    Mayberry
  • Behavior of tandem buffers with geometric input and markovian output Communications Transactions on
    Hsu
  • Tree Based Oblivious RAM of and Puerto
    Moataz
  • Efficient computation on oblivious rams InProceedings of the Symposium on Theory of pages
    Ostrovsky
  • Google new approach to China http googleblog blogspot com new approach to china html
  • Oblivious RAM withO log Worst Case Cost InProceedings of in pages South Korea ISBN
    Shi
  • Pass Simple ePrint Archive
    Chung
  • On the in security of hash - based oblivious ram and a new balancing scheme InProceedings of the Symposium on Discrete Algorithms SODA pages Kyoto Japan
    Kushilevitz
  • Towards practical oblivious ram InProceedings of the Network and Distributed System San The Internet
    Stefanov
  • Oblivious ram revisited in pages Santa
    Pinkas
  • closing the gap between small and large client storage oblivious RAM Cryptology ePrint Archive
    Ling Ren
  • Privacy - preserving group data access via stateless oblivious RAM simulation InProceedings of the Symposium on Discrete Algorithms SODA pages Kyoto Japan
    Goodrich
  • Ren Onion constant bandwidth and constant client storage without FHE or Cryptology ePrint Archive
    Srinivas Devadas
  • million compromised in Evernote hack http www cnn com tech web evernote hacked
    Gross
  • in bins with limited capacity http www mathpages com home kmath htm
    Brown
  • Privacy - preserving group data access via stateless oblivious RAM simulation InProceedings of the Symposium on Discrete Algorithms SODA pages Kyoto Japan
    Goodrich
  • Pass Simple ePrint Archive
    Chung
  • Google Confirms That It Fired Engineer For Breaking Internal Privacy Policies http techcrunch com google engineer spying fired
    Techcrunch
  • Privacy - preserving access of outsourced data via oblivious ram simulation InProceedings of Automata and pages
    Goodrich
  • Olga and Oblivious ram simulation with efficient worst - case access overhead InProceedings of the rd Workshop pages Chicago
    Goodrich
  • Statistical inference advanced series in decision Learning ISBN
    Casella
  • Replication is not needed : Single database computationally - private information retrieval InProceedings of Foundations of pages
    Eyal Kushilevitz
  • Building castles out of mud : practical access pattern privacy and correctness on untrusted storage InACM Conference on Computer and Communications pages Alexandra
    Williams
  • and RAW Path Low - Latency Low - Area Hardware Controller with Integrity Cryptology ePrint Archive
    Christopher
  • Privacy - preserving access of outsourced data via oblivious ram simulation InProceedings of Automata and pages
    Goodrich
  • On the in security of hash - based oblivious ram and a new balancing scheme InProceedings of the Symposium on Discrete Algorithms SODA pages Kyoto Japan
    Kushilevitz
  • Perfectly Secure Oblivious RAM without Random Oracles of of Conference pages Providence
    Damgård
  • Oblivious ram revisited in pages Santa
    Pinkas
  • Theory Volume ISBN
    Kleinrock
  • Goldreich Towards a Theory of Software Protection and Simulation by Oblivious RAMs InProceedings of the th Annual ACM Symposium on Theory of pages New York
    STOC
  • closing the gap between small and large client storage oblivious RAM Cryptology ePrint Archive
    Ling Ren
  • Towards practical oblivious ram InProceedings of the Network and Distributed System San The Internet
    Stefanov
  • Oblivious RAM withO log Worst Case Cost InProceedings of in pages South Korea ISBN
    Shi
  • Google Confirms That It Fired Engineer For Breaking Internal Privacy Policies http techcrunch com google engineer spying fired
    Techcrunch
  • Path - pir : Lower worst - case bounds by combining oram and pir InProceedings of the Network and Distributed System San
    Mayberry
  • Statistical inference advanced series in decision Learning ISBN
    Casella
  • Emil Path an extremely simple oblivious RAM protocol Conference on Communications pages
    Stefanov
  • Usable pir InProceedings of the Network and Distributed System San
    Williams
  • in bins with limited capacity http www mathpages com home kmath htm
    Brown
  • Efficient computation on oblivious rams InProceedings of the Symposium on Theory of pages
    Ostrovsky
  • Theory Volume ISBN
    Kleinrock
  • Goldreich Towards a Theory of Software Protection and Simulation by Oblivious RAMs InProceedings of the th Annual ACM Symposium on Theory of pages New York
    STOC
  • Ren Onion constant bandwidth and constant client storage without FHE or Cryptology ePrint Archive
    Srinivas Devadas
  • Google new approach to China http googleblog blogspot com new approach to china html
  • Olga and Oblivious ram simulation with efficient worst - case access overhead InProceedings of the rd Workshop pages Chicago
    Goodrich
  • Usable pir InProceedings of the Network and Distributed System San
    Williams
  • source code http pasmac ccs neu edu resources zip
    PASMAC
  • million compromised in Evernote hack http www cnn com tech web evernote hacked
    Gross
  • Perfectly Secure Oblivious RAM without Random Oracles of of Conference pages Providence
    Damgård
  • Private information storage extended abstract InProceedings of the Symposium on Theory of pages
    Ostrovsky
  • Tree Based Oblivious RAM of and Puerto
    Moataz
  • and RAW Path Low - Latency Low - Area Hardware Controller with Integrity Cryptology ePrint Archive
    Christopher
  • Building castles out of mud : practical access pattern privacy and correctness on untrusted storage InACM Conference on Computer and Communications pages Alexandra
    Williams
  • Goldreich Software protection and simulation on oblivious rams ISSN acm org
    Oded