Efficient Regular Language Search For Secure

Cloud Storage
1
R Meghana, 2 Likhith Reddy, 3 N Deepak, 4 K Sreedevi
1,2,3
UG Scholars, 4 Associate Professor
1,2,3,4
Department of Computer Science and Engineering,

1,2,3,4
Guru Nanak Institutions Technical Campus , Hyderabad, Telangana, India.

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 extend ability 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.

Keywords: Cloud computing, Searchable encryption, Privacy-preserving, Regular language encryption,

Deterministic finite automata (DFA), Keyword guessing attack (KGA).

I. INTRODUCTION

Cloud computing offers flexible data management and access from anywhere, at any time, on any device.
This convenience extends to groups, allowing easy synchronization and management of shared documents,
reducing the need for expensive storage infrastructure.
However, cloud storage poses significant security and privacy challenges. Users have limited control over
their data stored on cloud servers, leading to concerns about potential breaches and misuse by hackers or
internal staff. While encryption can protect data confidentiality, it introduces the challenge of efficient data
retrieval from large volumes of encrypted data. Downloading and decrypting all stored information for
search purposes is impractical due to high transmission costs and long waiting times.
Searchable encryption addresses this by enabling secure and private data retrieval. In this paper, we propose
an efficient large universe regular language searchable encryption scheme for cloud storage. Our scheme is
privacy-preserving and secure against offline keyword guessing attacks (KGA). It supports regular
language encryption and deterministic finite automata (DFA) based data retrieval, allowing for complex
search queries. The large universe construction ensures system scalability without predefined symbol sets.
Multiple users can generate DFA tokens using their private keys without a central key generation authority.
Our scheme is efficient and formally proven secure. Extensive comparisons and simulations show it
outperforms existing solutions in functionality and performance.
II. NEED OF THE STUDY

The need for the study of this project arises from the increasing reliance on cloud storage services for
data management and access, which presents significant concerns regarding the security and privacy of
sensitive information stored in the cloud. While cloud computing offers flexibility and convenience,
the trustworthiness of cloud servers remains a critical issue for customers. The study addresses this by
focusing on searchable encryption, which is crucial for protecting the confidentiality of data while still
enabling efficient and privacy- preserving data retrieval.
Specifically, the project proposes a large universe regular language searchable encryption scheme for
cloud storage, which has several key benefits:

1. Privacy and Security: It ensures data confidentiality and protection against attacks like the offline
keyword guessing attack (KGA), which can compromise the security of traditional encryption
methods.

2. Efficiency and Scalability: The large universe construction allows the system to scale without
needing to predefine the symbol set, enabling efficient searching in larger data spaces. This is
particularly useful for real-world applications that need to handle diverse and expanding data sets.

3. Support for Multiple Users: The system allows multiple users to interact with the encrypted cloud
data, ensuring that each user can securely generate their own decryption keys and tokens using
private keys without needing to communicate with a central key generation authority.

4. Deterministic Finite Automata (DFA) Based Data Retrieval: By using DFAs for data retrieval,
the proposal offers a more structured and secure way to perform searches over encrypted data,
making it more efficient than existing schemes.

III. METHODOLOGY - ALGORITHMS USED

.
The methodology of the proposed system involves implementing a Searchable Encryption scheme
that supports privacy-preserving data retrieval and efficient searches on encrypted data. The system
utilizes the following key algorithms:

1. Searchable Encryption Algorithm:

• Allows data searches on encrypted content without decryption.
• Users generate search tokens with their private keys; the cloud server performs searches using
these tokens without accessing plaintext data.

2. Deterministic Finite Automata (DFA) Based Data Retrieval:

• Enables complex multi-keyword searches.
• Uses DFA to process search queries efficiently over large encrypted datasets.

3. Large Universe Construction:

• No need for predefined symbol sets.
• Ensures scalability and adaptability of the system.

4. Protects Against KGA:

• Safeguards against offline keyword guessing attacks.
 • Ensures that search patterns and keywords remain private.

These algorithms together ensure secure, efficient, and scalable data retrieval in cloud storage.

Figure 1. System Architecture for Efficient Regular Language Search For Secure Cloud Storage

IV. RESULTS

The proposed scheme was compared extensively with existing solutions. Simulations demonstrated
superior performance in terms of function and efficiency, with secure and privacy-preserving data
retrieval capabilities.
V. CONCLUSION
The proposed scheme is efficient in terms of computation and transmission overhead, supports
a large universe of symbols without predefined sets, and is proven secure against offline keyword
guessing attacks (KGA). It enhances user experience by allowing complex search queries, thus
improving usability and functionality compared to existing schemes.
VI. REFERENCES
[1] Erl T, Cope R, Naserpour A. Cloud computing design patterns[M]. Prentice Hall Press, 2015.
[2] Li Z, Dai Y, Chen G, et al. Toward network-level efficiency for cloud storage services[M]//Content
Distribution for Mobile Internet: A Cloud-based Approach. Springer Singapore, 2016: 167-196.
[3] Sookhak M, Gani A, KhanMK, et al. Dynamic remote data auditing for securing big data storage in
cloud computing[J]. Information Sciences, 2017, 380: 101-116.
[4] Zhang Q, Yang L T, Chen Z, Li P. Privacy-preserving double projection deep computation model
with crowd sourcing on cloud for big data feature learning[J]. IEEE Internet of Things Journal,
2017, DOI: 10.1109/JIOT.2017.2732735.
[5] Zhang Q, Yang L T, Chen Z, Li P. PPHOPCM: Privacy-preserving High-order Possibilistic cMeans
Algorithm for Big Data Clustering with Cloud Computing[J]. IEEE Transactions on Big Data,
2017, DOI: 10.1109/TBDATA.2017.2701816.
[6] Liu J K, Liang K, Susilo W, et al. Two-factor data security protection mechanism for cloud storage
system[J]. IEEE Transactions on Computers, 2016, 65(6): 1992-2004.
[7] Boneh D, Waters B. Conjunctive, subset, and range queries on encrypted data[C]//Theory of
Cryptography Conference. Springer Berlin Heidelberg, 2007: 535-554.
[8] Q. Zheng, S. Xu, and G. Ateniese. VABKS: verifiable attribute-based keyword search over
outsourced encrypted data. In INFOCOM, pp. 522C530. IEEE, 2014.
[9] Liang K, Huang X, Guo F, et al. Privacy-Preserving and Regular Language Search Over Encrypted
Cloud Data[J]. IEEE Transactions on Information Forensics and Security, 2016, 11(10): 2365-2376.
[10] Chang V, Ramachandran M. Towards achieving data security with the cloud computing adoption
framework [J]. IEEE Transactions on Services Computing, 2016, 9(1): 138-151.
[11] Zheng X H, Chen N, Chen Z, et al. Mobile cloud based framework for remote-resident
multimedia discovery and access[J]. Journal of Internet Technology, 2014, 15(6): 1043-1050.
[12] Chang V, Kuo Y H, Ramachandran M. Cloud computing adoption framework: A security
framework for business clouds [J]. Future Generation Computer Systems, 2016, 57: 24-41.
[13] Barsoum A. Provable data possession in single cloud server: A survey, classification and
comparative study[J]. International Journal of Computer Applications, 2015, 123(9).
[14] Wang H. Identity-based distributed provable data possession in multicolour storage[J]. IEEE
Transactions on Services Computing, 2015, 8(2): 328-340.
[15] J, Tan X, Chen X, et al. Opor: Enabling proof of irretrievability in cloud computing with
resourceconstrained devices[J]. IEEE Transactions on cloud computing, 2015, 3(2): 195-205.