Abstract
In this article we introduce a technique, guaranteeing access pattern privacy against a computationally bounded adversary, in outsourced data storage, with communication and computation overheads orders of magnitude better than existing approaches. In the presence of a small amount of temporary storage (enough to store O(√n log n) items and IDs, where n is the number of items in the database), we can achieve access pattern privacy with computational complexity of less than O(log2 n) per query (as compared to, for instance, O(log4 n) for existing approaches).
We achieve these novel results by applying new insights based on probabilistic analyses of data shuffling algorithms to Oblivious RAM, allowing us to significantly improve its asymptotic complexity. This results in a protocol crossing the boundary between theory and practice and becoming generally applicable for access pattern privacy. We show that on off-the-shelf hardware, large data sets can be queried obliviously orders of magnitude faster than in existing work.
- Ajtai, M., Komlos, J., and Szemeredi, E. 1983. An O(n log n) sorting network. In Proceedings of the 25th ACM Symposium on Theory of Computing. 1--9. Google Scholar
Digital Library
- Asonov, D. 2004. Querying Databases Privately: A New Approach to Private Information Retrieval. Springer Verlag. Google Scholar
Digital Library
- Chor, B., Goldreich, O., Kushilevitz, E., and Sudan, M. 1995. Private information retrieval. In Proceedings of the IEEE Symposium on Foundations of Computer Science. 41--50. Google Scholar
Digital Library
- Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. 2001. Introduction to Algorithms 2nd Ed. MIT Press and McGraw-Hill. Google Scholar
Digital Library
- Feller, W. 1967. An Introduction to Probability Theory and its Applications. Vol. 1. Wiley.Google Scholar
- Gartner, Inc. 1999. Server Storage and RAID Worldwide. Tech. rep., Gartner Group/Dataquest. www.gartner.com.Google Scholar
- Gasarch, W. 2004. A survey on private information retrieval. Bull. EATCS 82, 72--107.Google Scholar
- Gasarch, W. 2010. A WebPage on private information retrieval. http://www.cs.umd.edu/~gasarch/pir/pir.html.Google Scholar
- Goldberg, I. 2007. Improving the robustness of private information retrieval. In Proceedings of the IEEE Symposium on Security and Privacy. Google Scholar
Digital Library
- Goldreich, O. 2001. Foundations of Cryptography. Cambridge University Press. Google Scholar
Digital Library
- Goldreich, O. and Ostrovsky, R. 1996. Software protection and simulation on Oblivious RAMs. J. ACM 43, 3, 431--473. Google Scholar
Digital Library
- Hagerup, T. and Rüb, C. 1990. A guided tour of Chernoff bounds. Inform. Process. Lett. 33, 6, 305--308. Google Scholar
Digital Library
- Hild, M. and Mitchell, J. 2004. Free Email: Google, MSN Hotmail and Yahoo! (A). SSRN eLibrary.Google Scholar
- IBM Corp. 2008. IBM 4764 Model 001 specification sheet. http://www-03.ibm.com/security/cryptocards/pdfs/4764-001_PCIX_Data_Sheet.pdf.Google Scholar
- Iliev, A. and Smith, S. 2004. Private information storage with logarithmic-space secure hardware. In Proceedings of the 3rd Working Conference on Privacy and Anonymity in Networked and Distributed Systems (i-NetSec’04). 201--216.Google Scholar
- Lipmaa, H. 2006. AES ciphers: Speed. http://research.cyber.ee/~lipmaa/research/aes/rijndael.html.Google Scholar
- Sassaman, L., Cohen, B., and Mathewson, N. 2005. The Pynchon gate: A secure method of pseudonymous mail retrieval. In Proceedings of the Workshop on Privacy in the Electronic Society (WPES). 1--9. Google Scholar
Digital Library
- Scribner, C. 2007. Comment and casenote: Subpoena to Google Inc. in ACLU v. Gonzales: “Big Brother” is watching your internet searches through government subpoenas. U. Cincinnati Law Rev. 75, 1273.Google Scholar
- Sion, R. and Carbunar, B. 2007. On the practicality of private information retrieval. In Proceedings of the Network and Distributed Systems Security Symposium.Google Scholar
- Wang, S., Ding, X., Deng, R. H., and Bao, F. 2006. Private information retrieval using trusted hardware. In Proceedings of the European Symposium on Research in Computer Security (ESORICS). 49--64. Google Scholar
Digital Library
- Williams, P., Sion, R., and Carbunar, B. 2008. Building castles out of mud: practical access pattern privacy and correctness on untrusted storage. In Proceedings of the ACM Conference on Computer and Communications Security. 139--148. Google Scholar
Digital Library
- Yang, Y., Ding, X., Deng, R. H., and Bao, F. 2008. An efficient PIR construction using trusted hardware. In Proceedings of the 11th International Conference on Information Security. Lecture Notes in Computer Science, vol. 5222. Springer, 64--79. Google Scholar
Digital Library
Index Terms
Practical Oblivious Outsourced Storage
Recommendations
Access privacy and correctness on untrusted storage
We introduce a new practical mechanism for remote data storage with access pattern privacy and correctness. A storage client can deploy this mechanism to issue encrypted reads, writes, and inserts to a potentially curious and malicious storage service ...
Single round access privacy on outsourced storage
CCS '12: Proceedings of the 2012 ACM conference on Computer and communications securityWe present SR-ORAM1, the first single-round-trip polylogarithmic time Oblivious RAM that requires only logarithmic client storage. Taking only a single round trip to perform a query, SR-ORAM has an online communication / computation cost of O(log n log ...
Write-only oblivious RAM-based privacy-preserved access of outsourced data
Data outsourcing is plagued with several security and privacy concerns. Oblivious RAM (ORAM) can be used to address one of the many concerns, specifically to protect the privacy of data access pattern from outsourced cloud storage. This is achieved by ...






Comments