EFFICIENT REGULAR LANGUAGE SEARCH CLOUD STORAGE

Main Article Content

Mr. C. Palani Nehru, Mr. R. Anandan,

Abstract

Cloud computing provides flexible data management and ubiquitous data access.
However, the storage service provided by cloud server is not fully trusted by customers. Searchable
encryption could simultaneously provide the functions of confidentiality protection and privacypreserving
data retrieval, which is a vital tool for secure storage. In this paper, we propose an
efficient large universe regular language searchable encryption scheme for the cloud, which is
privacy-preserving and secure against the off-line keyword guessing attack (KGA). A notable
highlight of the proposal over other existing schemes is that it supports the regular language
encryption and deterministic finite automata (DFA) based data retrieval. The large universe
construction ensures the extendability of the system, in which the symbol set does not need to be
predefined. Multiple users are supported in the system, and the user could generate a DFA token
using his own private key without interacting with the key generation center. Furthermore, the
concrete scheme is efficient and formally proved secure in standard model. Extensive comparison
and simulation show that this scheme has function and performance superior than other schemes.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Article Details

How to Cite
Mr. C. Palani Nehru, Mr. R. Anandan,. (2022). EFFICIENT REGULAR LANGUAGE SEARCH CLOUD STORAGE. Turkish Journal of Computer and Mathematics Education (TURCOMAT), 10(3), 1052–1056. https://doi.org/10.17762/turcomat.v10i3.12401
Section
Research Articles