Compromising privacy in precise query protocols

ACM International Conference Proceeding Series

Volumn , Issue , 2013, Pages 155-166

  Dautrich, Jonathan L ^a   Ravishankar, Chinya V ^a  

^a University of California Riverside   (United States)

Author keywords

Algorithms; H.2.7 Database Management : Database Administration Security, integrity, and protection; H.3.3 Information Storage and Retrieval : Information Search and Retrieval Query formulation; Security

Indexed keywords

CRYPTOGRAPHY; DATABASE SYSTEMS; DIGITAL STORAGE; QUERY PROCESSING;

DATABASE MANAGEMENT; H.2.7 [DATABASE MANAGEMENT]: DATABASE ADMINISTRATION - SECURITY, INTEGRITY, AND PROTECTION; H.3.3 [INFORMATION STORAGE AND RETRIEVAL]: INFORMATION SEARCH AND RETRIEVAL - QUERY FORMULATION; H.3.3 [INFORMATION STORAGE AND RETRIEVAL]: INFORMATION SEARCH AND RETRIEVALS; MANAGEMENT DATABASE; QUERY FORMULATION; RANGE QUERY; RETRIEVAL QUERY; SEARCH QUERIES; SECURITY;

TREES (MATHEMATICS);

EID: 84876791111     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2452376.2452397     Document Type: Conference Paper

References (30)

1. Salaries of federal employees located in the District of Columbia. Available: http://php.app.com/fed-employees11/search.php,2011. Source: U.S. Office of Personnel Management.
2. R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu. Order preserving encryption for numeric data. In Proc. ACM SIGMOD, pages 563-574, 2004.
3. C. Bandt and B. Pompe. Permutation entropy: A natural complexity measure for time series. Phys. Rev. Lett., 88:174102, Apr 2002.
4. A. Boldyreva, N. Chenette, Y. Lee, and A. O'Neill. Order-preserving symmetric encryption. In Proc. EUROCRYPT, pages 224-241, 2009.
5. D. Boneh and B. Waters. Conjunctive, subset, and range queries on encrypted data. In Proc. TCC, pages 535-554, 2007.
6. K. S. Booth and G. S. Lueker. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. System Sci., 13(3):335-379, 1976.
7. A. Ceselli, E. Damiani, S. De Capitani di Vimercati, S. Jajodia, S. Paraboschi, and P. Samarati. Modeling and assessing inference exposure in encrypted databases. ACM Trans. Inf. Syst. Secur., 8(1):119-152, 2005. (Pubitemid 40479431)
8. K. Chen, R. Kavuluru, and S. Guo. RASP: efficient multidimensional range query on attack-resilient encrypted databases. In Proc. ACM CODASPY, pages 249-260, 2011.
9. R. Chow, P. Golle, M. Jakobsson, E. Shi, J. Staddon, R. Masuoka, and J. Molina. Controlling data in the cloud: outsourcing computation without outsourcing control. In Proc. ACM CCSW, pages 85-90, 2009.
10. V. Ciriani, S. De Capitani Di Vimercati, S. Foresti, S. Jajodia, S. Paraboschi, and P. Samarati. Keep a few: Outsourcing data while maintaining confidentiality. Proc. ESORICS, pages 440-455, 2009.
11. E. Damiani, S. De Capitani di Vimercati, S. Jajodia, S. Paraboschi, and P. Samarati. Balancing confidentiality and efficiency in untrusted relational DBMSs. In Proc. ACM CCS, pages 93-102, 2003.
12. J. Dautrich and C. Ravishankar. Security limitations of using secret sharing for data outsourcing. In Proc. DBSec, 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. ICDCS, 2011.
14. B. Faaland. Solution of the value-independent knapsack problem by partitioning. Operations Research, 21(1):332-337, 1973.
15. H. Hacigümüş, B. Iyer, C. Li, and S. Mehrotra. Executing SQL over encrypted data in the database-service-provider model. In Proc. ACM SIGMOD, pages 216-227, 2002.
16. B. Hore, S. Mehrotra, M. Canim, and M. Kantarcioglu. Secure multidimensional range queries over outsourced data. The VLDB Journal, pages 1-26, 2011.
17. M. Kantarcioglu and C. Clifton. Security issues in querying encrypted data. In Proc. DBSec, pages 325-337, 2005.
18. J. Katz, A. Sahai, and B. Waters. Predicate encryption supporting disjunctions, polynomial equations, and inner products. In Proc. EUROCRYPT, pages 146-162, 2008.
19. J. Li and E. Omiecinski. Efficiency and security trade-off in supporting range queries on encrypted databases. In Proc. DBSec, pages 69-83, 2005.
20. M. Li, S. Yu, N. Cao, and W. Lou. Authorized private keyword search over encrypted personal health records in cloud computing. In Proc. ICDCS, 2011.
21. P. Lin and K. Candan. Hiding tree structured data and queries from untrusted data stores. Information Systems Security, 14(4):10, 2005.
22. A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam. l-diversity: Privacy beyond k-anonymity. ACM TKDD, 1(1):3-es, 2007.
23. E. Mykletun and G. Tsudik. Aggregation queries in the database-as-a-service model. In Proc. DBSec, pages 89-103, 2006.
24. F. Olumofin and I. Goldberg. Revisiting the computational practicality of private information retrieval. In Proc. FC, 2011.
25. P. Samarati and S. De Capitani di Vimercati. Data protection in outsourcing scenarios: issues and directions. In Proc. ASIACCS, pages 1-14, 2010.
26. E. Shen, E. Shi, and B. Waters. Predicate privacy in encryption systems. In Proc. TCC, pages 457-473, 2009.
27. E. Shi, J. Bethencourt, T.-H. Chan, D. Song, and A. Perrig. Multi-dimensional range query over encrypted data. In Proc. IEEE S&P, pages 350-364, 2007.
28. 3) worst-case cost. In Proc. ASIACRYPT, 2011.
29. J. Wang and X. Du. A secure multi-dimensional partition based index in DAS. In Proc. APWeb, pages 319-330, 2008.
30. Z. Yang, S. Zhong, and R. N. Wright. Privacy-preserving queries on encrypted data. In Proc. ESORICS, pages 479-495, 2006.