Abstract
Asymmetric searchable encryption(ASE) enables one to retrieve encrypted data stored on an untrusted server without revealing the contents. Now, beyond single keyword search, more and more attention have already been paid to the problem of multi-keyword search. However, existing schemes are mainly based on composite-order bilinear groups. In this paper, we propose a public key encryption with conjunctive and disjunctive keyword search(PECDK) scheme which can simultaneously support conjunction and disjunction within each keyword field for cloud storage. It is based on prime-order bilinear groups, and can be proved fully secure under the standard model.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kamara S. and Lauter K.: Cryptographic cloud storage. In: Proc. of Financial Cryptography and Data Security, pp. 136-149(2010)
Feng D., Zhang M., Zhang Y. and Xu Z.: Study on cloud computing security. In: Ruan Jian Xue Bao/Journal of Software, vol.22, no.1, pp. 71-83(2011)
Yuriyama M. and Kushida T.: Integrated cloud computing environment with IT resources and sensor devices. In: International Journal of Space-Based and Situated Computing, vol.1, no.2/3, pp. 163-173(2011)
Ronaldc P., Stephan S. and Christoph S.: A privacy-friendly architecture for future cloud computing. In: International Journal of Grid and Utility Computing, vol.4 no.4, pp. 265-277(2013)
Ma K. and Zhang L.: Bookmarklet-triggered unified literature sharing services in the cloud. In: International Journal of Grid and Utility Computing, vol.5, no.4, pp. 217-226(2014)
Yang W., Zhang C. and Mu B.: Towards mashup optimisation with global constraints in the cloud. In: International Journal of Grid and Utility Computing, vol.5, no.4, pp. 227-235(2014)
Song D., Wagner D. and Perrig A.: Practical techniques for searches on encrypted data. In: Proc. of SP’00, pp. 44-55(2000)
Boneh D., Crescenzo G., Ostrovsky R., et al.: Public key encryption with keyword search. In: Proc. of Advances in Cryptology-EUROCRYPT, pp. 506-522(2004)
Park J., Kim K., and Lee P.: Public key encryption with conjunctive field keyword search. In: LNCS 3325, pp. 73-86(2004)
Khader D.: Public key encryption with keyword search based on K-resilient IBE. In: LNCS 4707, pp. 298-308(2006)
Boneh D. and Waters B.: Conjunctive, subset, and range queries on encrypted data. In: Proc. of Theory of cryptography, pp. 535-554(2007)
Yong H. and Lee P.: Public key encryption with conjunctive keyword search and its extension to a multi-user system. In: Proc. of the First international conference on Pairing-Based Cryptography, pp. 2-22(2007)
Baek J., Safavinaini R. and Susilo W.: Public key encryption with keyword search revisited. In: LNCS 2005, pp. 1249-1259(2008)
Katz J., Sahai A., and Waters B.: Predicate encryption supporting disjunctions, polynomial equations, and inner products. In: Proc. of Advances in Cryptology-EUROCRYPT, pp. 146-162(2008)
Rhee H., Park J., Susilo W., et al.: Trapdoor security in a searchable public-key encryption scheme with a designated tester, Journal of Systems and Software, vol.83, no.5, pp. 763-771(2010)
Lewko A., Okamoto T., Sahai A., et al.: Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption. In: Proc. of Advances in Cryptology-EUROCRYPT, pp. 62-91(2010)
Yang H., Xu C., and Zhao H.: An efficient public key encryption with keyword scheme not using pairing. In: Proc. of First International Conference on Instrumentation, pp. 900-904(2011)
Zhao Y., Chen X., Ma H., et al.: A new trapdoor-indistinguishable public key encryption with keyword search. In: Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications, vol.3, no.1/2, pp. 72-81(2012)
Lv Z., Hong C., Zhang M., et al.: Expressive and secure searchable encryption in the public key setting. In: Proc. of Information Security, pp. 364-376(2014)
Guillevic A.: Comparing the pairing efficiency over composite-order and prime-order elliptic curves. In: Proc. of Applied Cryptography and Network Security, pp. 357-372(2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Xiao, S., Ge, A., Zhang, J., Ma, C., Wang, X. (2017). Asymmetric Searchable Encryption from Inner Product Encryption. In: Xhafa, F., Barolli, L., Amato, F. (eds) Advances on P2P, Parallel, Grid, Cloud and Internet Computing. 3PGCIC 2016. Lecture Notes on Data Engineering and Communications Technologies, vol 1. Springer, Cham. https://doi.org/10.1007/978-3-319-49109-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-49109-7_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49108-0
Online ISBN: 978-3-319-49109-7
eBook Packages: EngineeringEngineering (R0)