Abstract
We consider the following problem: a user with either limited resources or limited expertise wants to outsource its private documens, which are associated with noisy keywords, to an untrusted cloud server in a private manner, while maintaining the ability to retrieve the stored data in a fault-tolerant manner. For example, the organization of homeland security wishes to outsource its private criminal database comprised of a set of criminal dossiers to the cloud server in encrypted form and hopes to retrieve encrypted dossiers by biometrics.
In this paper, we first present a general framework for searching on private-key encrypted data by noisy keywords in a fault-tolerant manner. Then we propose a concrete scheme which is proved secure against an adaptive adversary under well-defined security definition. It achieves search in two rounds of communication, and requires an amount of work from the server that is linear in the number of noisy keywords.
This work is supported by the National Natural Science Foundation of China under Grants 60973134, 61173164, 61272436 and 61103232.
Chapter PDF
Similar content being viewed by others
References
Bellare, M., Boldyreva, A., ONeill, A.: Efficiently-searchable and deterministic asymmetric encryption. Tech. rep., Citeseer (2006)
Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public Key Encryption with Keyword Search. In: Cachin, C., Camenisch, J. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004)
Boneh, D., Kushilevitz, E., Ostrovsky, R., Skeith, W.: Public Key Encryption That Allows PIR Queries. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 50–67. Springer, Heidelberg (2007)
Boneh, D., Waters, B.: Conjunctive, Subset, and Range Queries on Encrypted Data. In: Vadhan, S. (ed.) TCC 2007. LNCS, vol. 4392, pp. 535–554. Springer, Heidelberg (2007)
Bringer, J., Chabanne, H., Kindarji, B.: Error-tolerant searchable encryption. In: IEEE International Conference on Communications, ICC 2009, pp. 1–6. IEEE (2009)
Chang, Y., Mitzenmacher, M.: Privacy Preserving Keyword Searches on Remote Encrypted Data. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 442–455. Springer, Heidelberg (2005)
Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: Improved definitions and efficient constructions. Journal of Computer Security 19(5), 895–934 (2011)
Dodis, Y., Reyzin, L., Smith, A.: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. In: Cachin, C., Camenisch, J. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 523–540. Springer, Heidelberg (2004)
Dodis, Y., Reyzin, L., Smith, A.: Fuzzy extractors. Security with Noisy Data, 79–99 (2007)
Du, W., Atallah, M.: Protocols for secure remote database access with approximate matching. In: E-Commerce Security and Privacy, pp. 87–111. Springer (2001)
Goh, E.: Secure indexes. An early version of this paper first appeared on the Cryptology ePrint Archive, pp. 1–18 (October 7, 2003)
Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. Journal of the ACM (JACM) 43(3), 431–473 (1996)
Kevenaar, T.: Protection of biometric information. Security with Noisy Data, 169–193 (2007)
Li, J., Wang, Q., Wang, C., Cao, N., Ren, K., Lou, W.: Fuzzy keyword search over encrypted data in cloud computing. In: 2010 Proceedings IEEE INFOCOM, pp. 1–5. IEEE (2010)
Ma, S., Yang, B., Li, K., Xia, F.: A Privacy-Preserving Join on Outsourced Database. In: Lai, X., Zhou, J., Li, H. (eds.) ISC 2011. LNCS, vol. 7001, pp. 278–292. Springer, Heidelberg (2011)
Monrose, F., Reiter, M., Li, Q., Wetzel, S.: Cryptographic key generation from voice. In: 2001 IEEE Symposium on Security and Privacy, S&P 2001. Proceedings, pp. 202–213. IEEE (2001)
Park, D., Kim, K., Lee, P.: Public Key Encryption with Conjunctive Field Keyword Search. In: Lim, C., Yung, M. (eds.) WISA 2004. LNCS, vol. 3325, pp. 73–86. Springer, Heidelberg (2005)
Pinkas, B., Reinman, T.: Oblivious RAM Revisited. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 502–519. Springer, Heidelberg (2010)
Shi, E., Bethencourt, J., Chan, T., Song, D., Perrig, A.: Multi-dimensional range query over encrypted data. In: IEEE Symposium on Security and Privacy, SP 2007, pp. 350–364. IEEE (2007)
Song, D., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of IEEE Symposium on Security and Privacy, S&P 2000, pp. 44–55. IEEE (2000)
Van Liesdonk, P., Sedghi, S., Doumen, J., Hartel, P., Jonker, W.: Computationally Efficient Searchable Symmetric Encryption. In: Jonker, W., Petkovic, M. (eds.) SDM 2010. LNCS, vol. 6358, pp. 87–100. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pang, X., Yang, B., Huang, Q. (2012). Privacy-Preserving Noisy Keyword Search in Cloud Computing. In: Chim, T.W., Yuen, T.H. (eds) Information and Communications Security. ICICS 2012. Lecture Notes in Computer Science, vol 7618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34129-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-34129-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34128-1
Online ISBN: 978-3-642-34129-8
eBook Packages: Computer ScienceComputer Science (R0)