Indexed by:
Abstract:
Public key encryption with keyword search (PEKS) is able to enhance cloud data security. On the other hand, the existence of malicious cloud servers and untrusted central authorities, in addition the keyword space faces a low entropy, attackers often launch keyword guessing attacks (KGA), thereby leaking data privacy. Therefore, we use certificateless authentication and proxy re-encryption technology to construct a lattice-based verifiable PEKS scheme for Multi-Data Users (MDU). Certificateless authentication can ensure that our scheme does not require key escrow, and proxy re-encryption technology allows us to perform multi-user authorization and use the verification block for data users to ensure the integrity of search results. Security research proves that, under the assumption that the learning with errors (LWE) problem is hard, the ciphertext is indistinguishable and resistant to KGA. Results from experiments show that our scheme is significantly more effective than current schemes. Our scheme is based on proxy re-encryption concept, proposes a lattice-based verifiable public key encryption with keyword search that supports multi-user authorization in a certificateless environment. The scheme satisfies the ciphertext is indistinguishable and resists keyword guessing attacks under the assumption of the hardness of the learning with errors problem. image
Keyword:
Reprint Author's Address:
Email:
Source :
TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES
ISSN: 2161-3915
Year: 2024
Issue: 4
Volume: 35
3 . 6 0 0
JCR@2022
Cited Count:
WoS CC Cited Count: 1
SCOPUS Cited Count: 2
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 2
Affiliated Colleges: