Abstract
Searchable encryption schemes allow users to perform keyword based searches on an encrypted database. Almost all existing such schemes only consider the scenario where a single user acts as both the data owner and the querier. However, most databases in practice do not just serve one user; instead, they support search and write operations by multiple users. In this paper, we systematically study searchable encryption in a practical multi-user setting. Our results include a set of security notions for multi-user searchable encryption as well as a construction which is provably secure under the newly introduced security notions.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abdalla, M., Bellare, M., Catalano, D., Kiltz, E., Kohno, T., Lange, T., Lee, J., Neven, G., Paillier, P., Shi, H.: Searchable Encryption Revisite: Consistency Properties, Ration to Anonymous IBE, and Extensions. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 205–222. Springer, Heidelberg (2005)
Boneh, D., di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004)
Beimel, A., Ishai, Y., Kushilevitz, E., Raymond, J.-F.: Breaking the o(n 1/(2k − 1)) barrier for information-theoretic private information retrieval. In: Proc. FOCS 2002, pp. 261–270 (2002)
Ballard, L., Kamara, S., Monrose, F.: Achieving Efficient Conjunctive Keyword Searches over Encrypted Data. In: Qing, S., Mao, W., López, J., Wang, G. (eds.) ICICS 2005. LNCS, vol. 3783, pp. 414–426. Springer, Heidelberg (2005)
Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Proc. ACM Conference on Computer and Communications Security, CCS 1993, pp. 62–73 (1993)
Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)
Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. In: Proc. STOC 1998, pp. 209–218 (1998)
Curtmola, R., Garay, J., Kamara, S., Ostrovskey, R.: Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions. In: Proc. ACM Conference on Computer and Communications Security, CCS 2006, pp. 79–88 (2006)
Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. Journal of the ACM (1995)
Chang, Y., Mitzenmacher, M.: Privacy Preserving Keyword Searches on Remote Encrypted Data. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 442–455. Springer, Heidelberg (2005)
Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)
Goh, E.: Secure Indexes (2003), http://crypto.stanford.edu/~eujin/papers/secureindex/secureindex.pdf
Goldreich, O.: Foundations of Cryptography, vol. 2. Cambridge University Press, Cambridge (2004)
Goldreich, O., Ostrovsky, R.: Software Protection and Simulation on oblivious RAMs. Journal of ACM 43(3), 431–473 (1996)
Hwang, Y.H., Lee, P.J.: Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-User System. In: Proc. International Conference on Pairing-Based Cryptography, Pairing 2007 (2007)
Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally private information retrieval. In: Proc. FOCS 1997, pp. 364–373 (1997)
Lipmaa, H.: An oblivious transfer protocol with log-squared communication. In: Zhou, J., López, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 314–328. Springer, Heidelberg (2005)
Park, D., Kim, K., Lee, P.: Public Key Encryption with Conjunctive Field Keyword Search. In: Proc. International Workshop on Information Security Applications, WISA 2004, pp. 73–86 (2004)
Song, D., Wagner, D., Perrig, A.: Practical Techniques for Searches on Encrypted Data. In: Proc. IEEE Symposium on Security and Privacy, S&P 2000, pp. 44–55 (2000)
Yang, Z., Zhong, S., Wright, R.N.: Privacy-Preserving Queries on Encrypted Data, Proc.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bao, F., Deng, R.H., Ding, X., Yang, Y. (2008). Private Query on Encrypted Data in Multi-user Settings. In: Chen, L., Mu, Y., Susilo, W. (eds) Information Security Practice and Experience. ISPEC 2008. Lecture Notes in Computer Science, vol 4991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79104-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-79104-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79103-4
Online ISBN: 978-3-540-79104-1
eBook Packages: Computer ScienceComputer Science (R0)