TARU PUBLICATIONS
Journal of Information and Optimization Sciences cover
Hybrid ·Peer-reviewed·ISSN (Online): 2169-0103·ISSN (Print): 0252-2667

WoS  JIF 2026 : 0.4 (Q4)

Powered by:Powered by

Monthly Journal: Publishes theoretical and applied research on topics in information and optimization sciences.

Issues up to 2022 co-published with and available at:Taylor & Francis
submissions@tarupublications.com
Open Access Research Article

A new bilinear pairing-based searchable encryption scheme

, *

* Corresponding author · click or hover a name for details

pp. 1377–1396Vol. 47Issue 4April 2026DOI: 10.47974/JIOS-1607XML
Received:
06 Sep 2023
Published Online:
02 Feb 2026
Article type:
Research Article
Language:
EN
Article no.:
JIOS-1607
Pages:
1377–1396

Abstract

The searchable encryption scheme is employed to address privacy and data confidentiality issues in outsourced databases. It enables users to send encrypted search queries containing a keyword to a server, which then returns all encrypted documents containing the specified keyword without learning additional information about the queries or documents. Boneh et al. [2] proposed a scheme for searching encrypted keywords without leaking information about the keywords and original documents. A unique technique for public-key encryption with keyword search (PEKS) has been presented in this paper, leveraging the power of bilinear pairings, offering better performance than [2] due to not using pairing operation in the encryption. Our scheme can also search conjunctive keywords simultaneously without leaking information and does not require the establishment of a secure channel, known as the secure channel free scheme. Additionally, we introduce a highly efficient SSE scheme that enables advanced conjunctive search capabilities. The innovative approach has been thoroughly examined and verified to be secure.

Keywords

Subject Classifications

94A60

References

[1] D. Boneh and M. Franklin, “Identity-Based Encryption from the Weil Pairing,” in Advances in Cryptology – CRYPTO 2001, Lecture Notes in Computer Science, vol. 2139, C. Boyd, Ed. Berlin, Heidelberg: Springer-Verlag, pp. 213–229 (2001).
[2] D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, “Public Key Encryption with Keyword Search,” in Advances in Cryptology – EUROCRYPT 2004, Lecture Notes in Computer Science, vol. 3027, C. Cachin and J. Camenisch, Eds. Berlin, Heidelberg: Springer-Verlag, pp. 506–522 (2004).
[3] F. Zhang, R. Safavi-Naini, and W. Susilo, “An efficient signature scheme from bilinear pairings and its applications,” in Public Key Cryptography – PKC 2004, Lecture Notes in Computer Science, vol. 2947, F. Bao, R. H. Deng, and J. Zhou, Eds. Berlin, Heidelberg: Springer-Verlag, pp. 277–290 (2004).
[4] D. Song, D. Wagner, and A. Perrig, “Practical Techniques for Searching on Encrypted Data,” in Proceedings of the IEEE Symposium on Security and Privacy, Berkeley, CA, USA: IEEE Computer Society Press, pp. 44–55 (2000).
[5] Y. H. Hwang and P. J. Lee, “Public key encryption with conjunctive keyword search and its extension to a multi-user system,” in International Conference on Pairing-Based Cryptography, Berlin, Heidelberg: Springer-Verlag (2007).
[6] E.-J. Goh, “Secure indexes,” Cryptology ePrint Archive, Report 2003/216 (2003). [Online]. Available: https://eprint.iacr.org/2003/216
[7] P. Golle, J. Staddon, and B. Waters, “Secure Conjunctive Search over Encrypted Data,” in Applied Cryptography and Network Security – ACNS 2004, Lecture Notes in Computer Science, vol. 3089, J. Katz and M. Yung, Eds. Berlin, Heidelberg: Springer-Verlag, pp. 31–45 (2004).
[8] B. Waters, D. Balfanz, G. Durfee, and D. Smetters, “Building an Encrypted and Searchable Audit Log,” in Proceedings of the Network and Distributed System Security Symposium (NDSS) (2004).
[9] C. Gu, Y. Zhu, and H. Pan, “Efficient public key encryption with keyword search schemes from pairings,” in International Conference on Information Security and Cryptology, Berlin, Heidelberg: Springer-Verlag (2007).
[10] J. Baek, R. Safavi-Naini, and W. Susilo, “Public key encryption with keyword search revisited,” in International Conference on Computational Science and Its Applications, Berlin, Heidelberg: Springer-Verlag (2008).
[11] K.-M. Chan, S.-M. Yiu, K.-P. Chow, and L.C.K. Hui, “Trapdoor Privacy in Public Key Encryption with Keyword Search: A Review,” IEEE Access, vol. 10, pp. 94691–94704 (2022), doi: 10.1109/ACCESS.2022.3195185.
[12] D. J. Park, K. Kim, and P. J. Lee, “Public key encryption with conjunctive field keyword search,” in International Workshop on Information Security Applications, Berlin, Heidelberg: Springer-Verlag, pp. 73–86 (2004).
[13] L. Wu, B. Chen, S. Zeadally, and D. He, “An efficient and secure searchable public key encryption scheme with privacy protection for cloud storage,” Soft Computing, vol. 22, pp. 7685–7696 (2018), doi: 10.1007/s00500-017-2795-1.
[14] Y. Zhou, Y. Zhang, Y. Wang, and X. Zhou, “Public key encryption with keyword search in cloud: a survey,” Entropy, vol. 22, no. 4, p. 421 (2020), doi: 10.3390/e22040421.
[15] J. W. Byun, H. S. Rhee, H. A. Park, and D. H. Lee, “Off-line keyword guessing attacks on recent keyword search schemes over encrypted data,” in Proceedings of the 2006 International Workshop on Secure Data Management (SDM 2006), Seoul, Korea, Sep. 10–11, pp. 75–83 (2006).
[16] Y. Lu, G. Wang, and J. Li, “Keyword guessing attacks on a public key encryption with keyword search scheme without random oracle and its improvement,” Information Sciences, vol. 479, pp. 270–276 (2019), doi: 10.1016/j.ins.2018.03.003.

Views: 93Downloads: 45Citations: 0