Efficient Private File Retrieval by Combining ORAM and PIR

21st Annual Network and Distributed System Security Symposium, NDSS 2014

Volumn , Issue , 2014, Pages

  Mayberry, Travis ^a   Blass, Erik Oliver ^a   Chan, Agnes Hui ^a  

^a Northeastern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COSTS; QUERY PROCESSING; RANDOM ACCESS STORAGE; TREES (MATHEMATICS);

BLOCK SIZES; COMMUNICATION COMPLEXITY; DECOUPLINGS; FILES RETRIEVAL; LARGE BLOCKS; ORDERS OF MAGNITUDE; RECENT RESEARCHES; RESEARCH RESULTS; SMALL DATA; TREE-BASED;

DATA TRANSFER;

EID: 85091187696     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.14722/ndss/2014.23033     Document Type: Conference Paper

References (20)

1. Amazon. Amazon Elastic EC2 Pricing, 2013. http://aws.amazon.com/ec2/pricing/.
2. E.-O. Blass, R. Di Pietro, R. Molva, and M. Onen. PRISM – Privacy-Preserving Search in MapReduce. In Proceedings of Privacy Enhancing Technologies, pages 180–200, Vigo, Spain, 2012. ISBN 978-3-642-31679-1.
3. D. Boneh, D. Mazieres, and R.A. Popa. Remote Oblivious Storage: Making Oblivious RAM Practical, 2011. URL http://dspace.mit.edu/handle/1721.1/62006. Technical Report.
4. O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious RAMs. Journal of the ACM, 43 (3):431–473, 1996. ISSN 0004-5411.
5. M.T. Goodrich, M. Mitzenmacher, O. Ohrimenko, and R. Tamassia. Privacy-preserving group data access via stateless oblivious ram simulation. In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pages 157–167, 2012.
6. Google. A new approach to China, 2010. http://googleblog.blogspot.com/2010/01/new-approach-to-china.html.
7. J. Hoffstein, J. Pipher, and J. Silverman. NTRU: A ring-based public key cryptosystem. In Joe Buhler, editor, Algorithmic Number Theory, Lecture Notes in Computer Science. Springer Berlin, Heidelberg, 1998.
8. E. Kushilevitz and R. Ostrovsky. Replication is not needed: single database, computationally-private information retrieval. In Annual Symposium on Foundations of Computer Science, 1997. Proceedings, pages 364 –373, October 1997.
9. E. Kushilevitz, S. Lu, and R. Ostrovsky. On the (in)security of hash-based oblivious RAM and a new balancing scheme. In Proceedings of Symposium on Discrete Algorithms, pages 143–156, Kyoto, Japan, 2012.
10. H. Lipmaa and B. Zhang. Two New Efficient PIR-Writing Protocols. In Proceedings of Applied Cryptography and Network Security Conference, pages 438–455, Beijing, China, 2010. ISBN 978-3-642-13707-5.
11. T. Mayberry, E.-O. Blass, and A.H. Chan. PIRMAP: Efficient Private Information Retrieval for MapReduce. In Proceedings of Financial Cryptography, pages 371–385, Okinawa, Japan, 2013. ISBN 978-3-642-39883-4.
12. Nasuni. State of Cloud Storage Providers Industry Benchmark Report, 2011. http://cache.nasuni.com/Resources/Nasuni_Cloud_Storage_Benchmark_Report.pdf.
13. Path-PIR. Source Code, 2013. http://pasmac.ccs.neu.edu/resources/pathpir.zip.
14. B. Pinkas and T. Reinman. Oblivious RAM Revisited. In Proceedings of Advances in Cryptology – CRYPTO, pages 502–519, Santa Barbara, USA, 2010. ISBN 978-3-642-14622-0.
15. 3(N)) Worst-Case Cost. In Proceedings of Advances in Cryptology – ASIACRYPT, volume 7073, pages 197–214, Seoul, South Korea, 2011. ISBN 978-3-642-25384-3.
16. E. Stefanov and E. Shi. Oblivistore: High performance oblivious cloud storage. In Proc. of IEEE Symposium on Security and Privacy, 2013.
17. E. Stefanov, E. Shi, and D. Song. Towards practical oblivious RAM. In Proceedings of Network and Distributed System Security Symposium, San Diego, USA, 2012.
18. E. Stefanov, M. van Dijk, E. Shi, C. Fletcher, L. Ren, X. Yu, and S. Devadas. Path oram: An extremely simple oblivious ram protocol, 2013. http://eprint.iacr.org/2013/280.pdf.
19. Techcrunch. Google Confirms That It Fired Engineer For Breaking Internal Privacy Policies, 2010. http://techcrunch.com/2010/09/14/google-engineer-spying-fired/.
20. J. Trostle and A. Parrish. Efficient computationally private information retrieval from anonymity or trapdoor groups. In Proceedings of Conference on Information Security, pages 114–128, Boca Raton, USA, 2010.