A dynamic tree-based data structure for access privacy in the cloud

Proceedings of the International Conference on Cloud Computing Technology and Science, CloudCom

Volumn 0, Issue , 2016, Pages 391-398

  De Capitani Di Vimercati, Sabrina ^a   Foresti, Sara ^a   Moretti, Riccardo ^a   Paraboschi, Stefano ^b   Pelosi, Gerardo ^c   Samarati, Pierangela ^a  

^a UNIVERSITY OF MILAN   (Italy)

^b UNIVERSITY OF BERGAMO   (Italy)

^c POLITECNICO DI MILANO   (Italy)

Author keywords

Access privacy; binary search tree; dynamic data structure; key based retrieval

Indexed keywords

BINARY TREES; CLOUD COMPUTING; DATA PRIVACY; DIGITAL STORAGE;

BINARY SEARCH TREES; DATA ORGANIZATION; DYNAMIC DATA STRUCTURE; EXPERIMENTAL EVALUATION; KEY-BASED RETRIEVAL; LOGICAL STRUCTURE; ORDER PRESERVING; UNIFORM OBSERVABILITY;

TREES (MATHEMATICS);

EID: 85012977992     PISSN: 23302194     EISSN: 23302186     Source Type: Conference Proceeding    
DOI: 10.1109/CloudCom.2016.0068     Document Type: Conference Paper

References (21)

1. S. De Capitani di Vimercati, S. Foresti, and P. Samarati, "Managing, and accessing data in the cloud: Privacy risks, and approaches," in Proc. of CRiSIS, Cork, Ireland, October 2012
2. R. Jhawar, V. Piuri, and P. Samarati, "Supporting security requirements for resource management in cloud computing," in Proc. of CSE, Paphos, Cyprus, December 2012
3. R. Ostrovsky, and W. E. Skeith, III, "A survey of single-database private information retrieval: Techniques, and applications," in Proc. of PKC, Beijing, China, April 2007
4. C. Cachin, S. Micali, and M. Stadler, "Computationally private information retrieval with polylogarithmic communication," in Proc. of EUROCRYPT, Prague, Czech Republic, May 1999
5. S. De Capitani di Vimercati, S. Foresti, S. Paraboschi, G. Pelosi, and P. Samarati, "Shuffle index: Efficient, and private access to outsourced data," ACM TOS, vol. 11, no. 4, pp. 19: 1-19: 55, October 2015
6. E. Stefanov, and E. Shi, "ObliviStore: High performance oblivious cloud storage," in Proc. of IEEE S& P, San Francisco, CA, May 2013
7. E. Stefanov, M. van Dijk, E. Shi, C. Fletcher, L. Ren, X. Yu, and S. Devadas, "Path ORAM: An extremely simple Oblivious RAM protocol," in Proc. of CCS, Berlin, Germany, November 2013
8. L. Ren, C. W. Fletcher, X. Yu, A. Kwon, M. van Dijk, and S. Devadas, "Unified oblivious-RAM: Improving recursive ORAM with locality, and pseudorandomness," IACR Cryptology ePrint Archive, vol. 205, 2014
9. D. Sleator, and R. Tarjan, "Self-adjusting binary search trees," J. ACM, vol. 32, no. 3, pp. 652-686, Jul. 1985
10. J. Gray, P. Sundaresan, S. Englert, K. Baclawski, and P. Weinberger, "Quickly generating billion-record synthetic databases," in Proc. of SIGMOD, Minneapolis, MN, 1994
11. H. Hacigümüs, B. Iyer, S. Mehrotra, and C. Li, "Executing SQL over encrypted data in the database-service-provider model," in Proc. of SIGMOD, Madison, WI, June 2002
12. C. Wang, N. Cao, K. Ren, and W. Lou, "Enabling secure, and efficient ranked keyword search over outsourced cloud data," IEEE TPDS, vol. 23, no. 8, pp. 1467-1479, 2012
13. S. De Capitani di Vimercati, S. Foresti, S. Paraboschi, G. Pelosi, and P. Samarati, "Efficient, and private access to outsourced data," in Proc. of ICDCS, Minneapolis, MN, June 2011
14. S. De Capitani di Vimercati, S. Foresti, S. Paraboschi, G. Pelosi, and P. Samarati, "Supporting concurrency, and multiple indexes in private access to outsourced data," JCS, vol. 21, no. 3, pp. 425-461, 2013
15. S. De Capitani di Vimercati, S. Foresti, S. Paraboschi, G. Pelosi, and P. Samarati, "Three-server swapping for access confidentiality," IEEE TCC, 2016, pre-print
16. J. Dautrich, and C. Ravishankar, "Tunably-oblivious memory: Generalizing ORAM to enable privacy-efficiency tradeoffs," in Proc. of CODASPY, San Antonio, TX, March 2015
17. P. Lin, and K. Candan, "Hiding traversal of tree structured data from untrusted data stores," in Proc. of WOSIS, Porto, Portugal, April 2004
18. P. Williams, R. Sion, and B. Carbunar, "Building castles out of mud: Practical access pattern privacy, and correctness on untrusted storage," in Proc. of CCS, Alexandria, VA, October 2008
19. V. Bindschaedler, M. Naveed, X. Pan, X. Wang, and Y. Huang, "Practicing oblivious access on cloud storage: The gap, the fallacy, and the new way forward," in Proc. of CCS, Denver, CO, October 2015
20. S. Devadas, M. van Dijk, C. W. Fletcher, L. Ren, E. Shi, and D. Wichs, "Onion ORAM: A constant bandwidth blowup oblivious RAM," in Proc. of TCC, Tel Aviv, Israel, January 2016
21. S. De Capitani di Vimercati, S. Foresti, S. Paraboschi, G. Pelosi, and P. Samarati, "Access control for the shuffle index," in Proc. of DBSec, Trento, Italy, July 2016