Efficient Regular Language Search for Secure Cloud Storage
Efficient Regular Language Search for Secure Cloud Storage
IEEE BASE PAPER 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 privacy-preserving 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.
PROJECT OUTPUT VIDEO:
SYSTEM REQUIREMENTS:
HARDWARE REQUIREMENTS:
- System : Pentium i3 Processor
- Hard Disk : 500 GB.
- Monitor : 15’’ LED
- Input Devices : Keyboard, Mouse
- Ram : 2 GB
SOFTWARE REQUIREMENTS:
- Operating System : Windows 10 / 11.
- Coding Language : JAVA.
- Frontend : JSP, HTML, CSS, JavaScript.
- IDE Tool : NetBeans IDE 8.2.
- Database : MYSQL.
REFERENCE:
Yang Yang, Member, IEEE, Xianghan Zheng, Chunming Rong, Member, IEEE, Wenzhong Guo, Member, IEEE, “Efficient Regular Language Search for Secure Cloud Storage”, IEEE TRANSACTIONS ON CLOUD COMPUTING, 2020.
