A new bilinear pairing-based searchable encryption scheme
Journal of Information and Optimization Sciences · 2026 · 47 (4) · 1377-1396
DOI: 10.47974/jios-1607 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Information and Optimization Sciences, 2026. Verfasst von M. H. Noorallahzadeh und 1 weiteren Autor:innen.
Abstract (Originalsprache)
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 cabilities. The innovative approach has been thoroughly examined and verified to be secure.
Zitieren
APA
Noorallahzadeh, M. H., & Alimoradi, R. (2026). A new bilinear pairing-based searchable encryption scheme. Journal of Information and Optimization Sciences, 47(4), 1377-1396. https://doi.org/10.47974/jios-1607
Vancouver
Noorallahzadeh MH, Alimoradi R. A new bilinear pairing-based searchable encryption scheme. Journal of Information and Optimization Sciences. 2026;47(4):1377-1396. doi:10.47974/jios-1607
BibTeX
@article{Noorallahzadeh2026,
author = {Noorallahzadeh, M. H. and Alimoradi, R.},
title = {A new bilinear pairing-based searchable encryption scheme},
journal = {Journal of Information and Optimization Sciences},
year = {2026},
volume = {47},
number = {4},
pages = {1377--1396},
doi = {10.47974/jios-1607}
}
EUVIMED