- 期刊
New Efficient Searchable Encryption Schemes from Bilinear Pairings
並列摘要
Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the keyword W, but learn nothing else. In this paper, we propose a new PEKS scheme based on bilinear pairings. There is no pairing operation involved in the encryption procedure and so our new PEKS scheme is more efficient than the scheme of Boneh et. al. in [5]. Then, we provide further discussions on removing secure channel from PEKS, and present an efficient secure channel free PEKS scheme. Our two new schemes can be proved secure in the random oracle model, under the appropriate computational assumptions.
延伸閱讀
- Fan, I. A. (2012). Deniable Encryption Scheme for Private Storage [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2012.02908
- Hsieh, C. W. (2012). Public Key Searchable Encryption with Conjunctive Queries [master's thesis, National Chiao Tung University]. Airiti Library. https://doi.org/10.6842/NCTU.2012.00411
- Shao, F., & Zheng, R. (2022). An Efficient Fuzzy Searchable Encryption Scheme based Attribute for Medical Data. International Core Journal of Engineering, 8(7), 118-126. https://doi.org/10.6919/ICJE.202207_8(7).0017
- King, B. (2015). A Dynamic Threshold Decryption Scheme Using Bilinear Pairings. International Journal of Network Security, 17(6), 771-778. https://doi.org/10.6633/IJNS.201511.17(6).14
- Lo, N. W., & Tsai, J. L. (2014). A Provably Secure Proxy Signcryption Scheme Using Bilinear Pairings. Journal of Applied Mathematics, 2014(), 829-838-392. https://doi.org/10.1155/2014/454393