Single round access privacy on outsourced storage

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2012, Pages 293-304

  Williams, Peter ^a   Sion, Radu ^a  

^a STONY BROOK UNIVERSITY   (United States)

Author keywords

Access privacy; Cloud computing; Oblivious RAM

Indexed keywords

COMMUNICATION COST; COMPUTATION COSTS; INTERNET-SCALE NETWORKS; LARGE DATASETS; MALICIOUS ADVERSARIES; OFFLINE; ON-LINE COMMUNICATION; QUERY OBJECT; ROUND TRIP;

CARBON CAPTURE; CLOUD COMPUTING; SECURITY OF DATA;

RANDOM ACCESS STORAGE;

EID: 84869381921     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2382196.2382229     Document Type: Conference Paper

References (19)

1. M. Ajtai, J. Komlos, and E. Szemeredi. An O(n log n) sorting network. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 1-9, 1983.
2. Dimitri Asonov. Querying Databases Privately: A New Approach to Private Information Retrieval. Springer Verlag, 2004.
3. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
4. Dan Boneh, David Maziéres, and Raluca Ada Popa. Remote oblivious storage: Making Oblivious RAM practical. Technical report, MIT, 2011. MIT-CSAIL-TR-2011-018 March 30, 2011.
5. Ivan Damgård, Sigurd Meldgaard, and Jesper Nielsen. Perfectly secure Oblivious RAM without random oracles. In Theory of Cryptography, volume 6597 of Lecture Notes in Computer Science, pages 144-163. 2011.
6. Oded Goldreich and Rafail Ostrovsky. Software protection and simulation on Oblivious RAMs. Journal of the ACM, 45:431-473, May 1996.
7. Michael Goodrich and Michael Mitzenmacher. Mapreduce parallel cuckoo hashing and Oblivious RAM simulations. In 38th International Colloquium on Automata, Languages and Programming (ICALP), 2011.
8. Michael Goodrich, Michael Mitzenmacher, Olga Ohrimenko, and Roberto Tamassia. Oblivious RAM simulation with efficient worst-case access overhead. In ACM Cloud Computing Security Workshop at CCS (CCSW), 2011.
9. Michael T. Goodrich. Randomized shellsort: A simple oblivious sorting algorithm. In Proceedings 21st ACM-SIAM Symposium on Discrete Algorithms (SODA), 2010.
10. Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, and Roberto Tamassia. Practical oblivious storage. In Proceedings of the second ACM conference on Data and Application Security and Privacy, CODASPY '12, pages 13-24, New York, NY, USA, 2012. ACM.
11. IBM. IBM 4764 PCI-X Cryptographic Coprocessor (PCIXCC). Online at http://www-03.ibm.com/security/cryptocards/pcixcc/overview.shtml, 2006.
12. A. Iliev and S.W. Smith. Private information storage with logarithmic-space secure hardware. In Proceedings of i-NetSec 04: 3rd Working Conference on Privacy and Anonymity in Networked and Distributed Systems, pages 201-216, 2004.
13. Eyal Kushilevitz, Steve Lu, and Rafail Ostrovsky. On the (in)security of hash-based oblivious RAM and a new balancing scheme. In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '12, pages 143-156. SIAM, 2012.
14. Benny Pinkas and Tzachy Reinman. Oblivious RAM revisited. In CRYPTO, pages 502-519, 2010.
15. Sean W. Smith and David Safford. Practical server privacy with secure coprocessors. IBM Systems Journal, 40(3):683-695, 2001.
16. Emil Stefanov, Elaine Shi, and Dawn Song. Towards Practical Oblivious RAM. In Proceedings of the Network and Distributed System Security Symposium (NDSS), 2012.
17. Shuhong Wang, Xuhua Ding, Robert H. Deng, and Feng Bao. Private information retrieval using trusted hardware. In Proceedings of the European Symposium on Research in Computer Security ESORICS, pages 49-64, 2006.
18. Peter Williams and Radu Sion. SR-ORAM: Single round-trip Oblivious RAM. In Industrial Track of ACNS, 2012.
19. Peter Williams, Radu Sion, and Bogdan Carbunar. Building castles out of mud: practical access pattern privacy and correctness on untrusted storage. In ACM Conference on Computer and Communications Security (CCS), pages 139-148, 2008.