Blind seer: A scalable private DBMS

Proceedings - IEEE Symposium on Security and Privacy

Volumn , Issue , 2014, Pages 359-374

  Pappas, Vasilis ^a   Krell, Fernando ^a   Vo, Binh ^a   Kolesnikov, Vladimir ^b   Malkin, Tal ^a   Choi, Seung Geol ^c   George, Wesley ^d   Keromytis, Angelos ^a   Bellovin, Steve ^a  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c UNITED STATES NAVAL ACADEMY   (United States)

^d UNIVERSITY OF TORONTO   (Canada)

Author keywords

Private database; private search

Indexed keywords

ACCESS CONTROL; BOOLEAN ALGEBRA; DATABASE SYSTEMS; SEARCH ENGINES;

BOOLEAN FORMULAE; COMPLEX QUERIES; IMPORTANT FEATURES; PRIVATE DATABASE; PRIVATE SEARCH; PROVABLE SECURITY; REAL WORLD DEPLOYMENT; SEARCH PATTERNS;

QUERY PROCESSING;

EID: 84914148700     PISSN: 10816011     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SP.2014.30     Document Type: Conference Paper

References (53)

1. IARPA Security and Privacy Assurance Research (SPAR) program. http://www.iarpa.gov/Programs/sso/SPAR/spar.html.
2. The porter stemming algorithm. http://tartarus.org/martin/PorterStemmer/.
3. Privacy groups file lawsuit over license plate scanners. http://www.therepublic.com/view/story/210d27e7585543a3941f5e577cf7f627/CA-License-Plate-Suit.
4. M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi. Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions. J. Cryptol., 21(3):350-391, 2008.
5. D. Beaver. Precomputing oblivious transfer. In D. Coppersmith, editor, CRYPTO'95, volume 963 of LNCS, pages 97-109. Springer, Aug. 1995.
6. M. Bellare, A. Boldyreva, and A. O'Neill. Deterministic and efficiently searchable encryption. In Proceedings of CRYPTO'07, 2007.
7. M. Bellare, V. T. Hoang, and P. Rogaway. Foundations of garbled circuits. In T. Yu, G. Danezis, and V. D. Gligor, editors, ACM CCS 12, pages 784-796. ACM Press, Oct. 2012.
8. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
9. D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano. Public key encryption with keyword search. In Proceedings of EUROCRYPT'04, pages 506-522, 2004.
10. D. Boneh and B. Waters. Conjunctive, subset, and range queries on encrypted data. In S. P. Vadhan, editor, TCC 2007, volume 4392 of LNCS, pages 535-554. Springer, Feb. 2007.
11. D. Cash, S. Jarecki, C. S. Jutla, H. Krawczyk, M.-C. Rosu, and M. Steiner. Highly-scalable searchable symmetric encryption with support for boolean queries. In R. Canetti and J. A. Garay, editors, CRYPTO 2013, Part I, volume 8042 of LNCS, pages 353-373. Springer, Aug. 2013.
12. Y.-C. Chang and M. Mitzenmacher. Privacy preserving keyword searches on remote encrypted data. In ACNS, volume 3531, 2005.
13. M. Chase and S. Kamara. Structured encryption and controlled disclosure. In M. Abe, editor, ASIACRYPT 2010, volume 6477 of LNCS, pages 577-594. Springer, Dec. 2010.
14. S. G. Choi, J. Katz, R. Kumaresan, and H.-S. Zhou. On the security of the "free-XOR" technique. In R. Cramer, editor, TCC 2012, volume 7194 of LNCS, pages 39-53. Springer, Mar. 2012.
15. B. Chor, N. Gilboa, and M. Naor. Private information retrieval by keywords. Technical Report TR-CS0917, Dept. of Computer Science, Technion, 1997.
16. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. J. ACM, 45(6):965-981, 1998.
17. R. Curtmola, J. A. Garay, S. Kamara, and R. Ostrovsky. Searchable symmetric encryption: improved definitions and efficient constructions. In ACM CCS 06, pages 79-88, 2006.
18. E. De Cristofaro, Y. Lu, and G. Tsudik. Efficient techniques for privacypreserving sharing of sensitive information. In TRUST'11, pages 239-253, 2011.
19. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31:469-472, 1985.
20. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. In D. Chaum, R. L. Rivest, and A. T. Sherman, editors, CRYPTO'82, pages 205-210. Plenum Press, New York, USA, 1982.
21. C. Gentry. Fully homomorphic encryption using ideal lattices. In M. Mitzenmacher, editor, 41st ACM STOC, pages 169-178. ACM Press, May/June 2009.
22. C. Gentry, K. A. Goldman, S. Halevi, C. Julta, M. Raykova, and D. Wichs. Optimizing oram and using it efficiently for secure computation. In Privacy Enhancing Technologies, pages 1-18. Springer, 2013.
23. C. Gentry, S. Halevi, and N. P. Smart. Homomorphic evaluation of the AES circuit. In R. Safavi-Naini and R. Canetti, editors, CRYPTO 2012, volume 7417 of LNCS, pages 850-867. Springer, Aug. 2012.
24. Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private information retrieval schemes. Journal of Computer and System Sciences, 60(3):592-629, 2000.
25. E.-J. Goh. Secure indexes. IACR Cryptology ePrint Archive, 2003:216, 2003.
26. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or A completeness theorem for protocols with honest majority. In A. Aho, editor, 19th ACM STOC, pages 218-229. ACM Press, May 1987.
27. O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious rams. J. ACM, 43:431-473, 1996.
28. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270-299, 1984.
29. S. D. Gordon, J. Katz, V. Kolesnikov, F. Krell, T. Malkin, M. Raykova, and Y. Vahlis. Secure two-party computation in sublinear (amortized) time. In ACM CCS 12, pages 513-524, 2012.
30. Y. Ishai, J. Kilian, K. Nissim, and E. Petrank. Extending oblivious transfers efficiently. In D. Boneh, editor, CRYPTO 2003, volume 2729 of LNCS, pages 145-161. Springer, Aug. 2003.
31. S. Jarecki, C. S. Jutla, H. Krawczyk, M.-C. Rosu, and M. Steiner. Outsourced symmetric private information retrieval. In A.-R. Sadeghi, V. D. Gligor, and M. Yung, editors, ACM CCS 13, pages 875-888. ACM Press, Nov. 2013.
32. S. Kamara and C. Papamanthou. Searching Dynamic Encrypted Data in Parallel. In FC 2013, 2013.
33. D. M. Kays. Reasons to "friend" electronic discovery law. Franchise Law Journal, 32(1), 2012.
34. V. Kolesnikov. Gate evaluation secret sharing and secure one-round two-party computation. In B. K. Roy, editor, ASIACRYPT 2005, volume 3788 of LNCS, pages 136-155. Springer, Dec. 2005.
35. V. Kolesnikov and R. Kumaresan. Improved secure two-party computation via information-theoretic garbled circuits. In I. Visconti and R. D. Prisco, editors, SCN 12, volume 7485 of LNCS, pages 205-221. Springer, Sept. 2012.
36. V. Kolesnikov and T. Schneider. Improved garbled circuit: Free XOR gates and applications. In L. Aceto, I. Damgård, L. A. Goldberg, M. M. Halldórsson, A. Ingólfsdóttir, and I. Walukiewicz, editors, ICALP 2008, Part II, volume 5126 of LNCS, pages 486-498. Springer, July 2008.
37. V. Kolesnikov and T. Schneider. A practical universal circuit construction and secure evaluation of private functions. In G. Tsudik, editor, FC 2008, volume 5143 of LNCS, pages 83-97. Springer, Jan. 2008.
38. Y. Lindell and B. Pinkas. A proof of security of Yao's protocol for twoparty computation. Journal of Cryptology, 22(2):161-188, Apr. 2009.
39. S. Lu and R. Ostrovsky. Distributed oblivious ram for secure two-party computation. In TCC, pages 377-396, 2013.
40. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - secure two-party computation system. In USENIX Security Symposium, pages 287-302, 2004.
41. T. Moataz and A. Shikfa. Boolean symmetric searchable encryption. In ASIACCS 2013: 8th ACM Symposium on Information, Computer and Communications Security, 2013.
42. M. Naor and B. Pinkas. Computationally secure oblivious transfer. Journal of Cryptology, 18(1):1-35, Jan. 2005.
43. J. E. Pace III. Testing the security blanket: An analysis of recent challenges to stipulated blanket protective orders. Antitrust Magazine, 19(3), 2005.
44. V. Pappas, M. Raykova, B. Vo, S. M. Bellovin, and T. Malkin. Private search in the real world. In ACSAC '11, pages 83-92, 2011.
45. R. A. Popa, C. M. S. Redfield, N. Zeldovich, and H. Balakrishnan. Cryptdb: protecting confidentiality with encrypted query processing. In SOSP '11, pages 85-100. ACM, 2011.
46. M. O. Rabin. How to exchange secrets by oblivious transfer. In Technical Report TR-81. Aiken Computation Laboratory, Harvard University, 1981.
47. M. Raykova, B. Vo, S. Bellovin, and T. Malkin. Secure anonymous database search. In CCSW 2009., 2009.
48. P. Rogaway. The round complexity of secure protocols. PhD thesis, Massachusetts Institute of Technology, 1991.
49. E. Shi, J. Bethencourt, H. T.-H. Chan, D. X. Song, and A. Perrig. Multidimensional range query over encrypted data. In 2007 IEEE Symposium on Security and Privacy, pages 350-364. IEEE Computer Society Press, May 2007.
50. D. X. Song, D. Wagner, and A. Perrig. Practical techniques for searches on encrypted data. In Proceedings of the 2000 IEEE Symposium on Security and Privacy, SP '00, pages 44-, Washington, DC, USA, 2000. IEEE Computer Society.
51. J. K. Yan Huang, David Evans and L. Malka. Faster secure two-party computation using garbled circuits. In USENIX Security Symposium. USENIX Association, 2011.
52. A. C.-C. Yao. Protocols for secure computations (extended abstract). In 23rd FOCS, pages 160-164. IEEE Computer Society Press, Nov. 1982.
53. A. C.-C. Yao. How to generate and exchange secrets (extended abstract). In 27th FOCS, pages 162-167. IEEE Computer Society Press, Oct. 1986.