Abstract
Searchable encryption scheme is a cryptographic one that allows search of specific information in an encrypted content without decryption. There have been two main issues with searchable encryption: search time and extension from single reader to multi-reader setting. In this paper, we propose an efficient searchable symmetric encryption scheme by solving these issues.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
d is the size of document collection and A, \(d'=d\) in the case all keyword \(w_i\) appears only once in a document in D.
References
Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. J. Comput. Secur. 19(5), 895–934 (2011)
Song, D. X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of the 2000 IEEE Symposium on Security and Privacy, pp. 44–55. IEEE Computer Society, IEEE (2000)
Hwang, Y.H., Lee, P.J.: Public key encryption with conjunctive keyword search and its extension to a multi-user system. In: International Conference on Pairing-Based Cryptography. LNCS, vol. 4575, pp. 2–22. Springer, Heidelberg (2007)
Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: International Conference on the Theory and Applications of Cryptographic Techniques. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004)
Dong, C., Russello, G., Dulay, N.: Shared and searchable encrypted data for untrusted servers. IFIP Annual Conference on Data and Applications Security and Privacy. LNCS, vol. 5094, pp. 127–143. Springer, Heidelberg (2008)
Acknowledgment
This work was supported by the National Research Foundation of Korea(NRF) grant funded by the Korea government(MSIP) (No. 2017R1A2B4001801).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Kim, I.T., Quan, T.H., Duc, L.V., Nguyen, T.K., Hwang, S.O. (2019). An Efficient Searchable Encryption Scheme in the Multi-user Environment. In: Hwang, S., Tan, S., Bien, F. (eds) Proceedings of the Sixth International Conference on Green and Human Information Technology. ICGHIT 2018. Lecture Notes in Electrical Engineering, vol 502. Springer, Singapore. https://doi.org/10.1007/978-981-13-0311-1_31
Download citation
DOI: https://doi.org/10.1007/978-981-13-0311-1_31
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-0310-4
Online ISBN: 978-981-13-0311-1
eBook Packages: EngineeringEngineering (R0)