International Research Journal of Engineering and Technology (IRJET)
e-ISSN: 2395-0056
Volume: 11 Issue: 08 | Aug 2024
p-ISSN: 2395-0072
www.irjet.net
Efficient, Accurate, and Forward Secure (EAFS) Searchable encryption Supporting Range Search Jaba Blessy W.U1, I.Siva Prasad Manivannan., M.E., M.B.A., 2 1PG Student, Dept. of Computer Science Engineering, Rohini College of Engineering and Technology, Kanniyakumari
Tamil Nadu, India 2Professor, Dept. of Computer Science Engineering, Rohini College of Engineering and Technology,
Kanniyakumari, Tamil Nadu, India. ---------------------------------------------------------------------------***-----------------------------------------------------------------------------instances. There are known security and protection issues Abstract — In the era of cloud computing, consumers
related with the reevaluating of information, for example, the cloud specialist co-op (CSP) gaining admittance to client contents without their unequivocal authorization. This supports the significance of accessible encryption (SE), a cryptography based plot that empowers looking in the ciphertext space without releasing any data to untrusted servers. There are a wide range of SE plans, with shifting functionalities (e.g., watchword searches and likeness look). Range look are one more typical capability in data sets that spotlights on numeric correlations, for instance to find clients somewhere in the range of 20 and 40 years of age.
like users, businesses, and organizations prefer to subcontract massive geographical data to public clouds after encryption for privacy and security in order to achieve convenient location-based service (LBS). Be that as it may, various hurtful digital assaults occur on those public mists in an unpredicted and hourly way. In existing framework propose a lightweight and forward-secure reach question (LS-RQ) on geologically encoded information, which sufficiently balances among security and productivity. It was costly and can be satisfactory by and by since the exact outcome just included a couple of focuses ordinarily. In this task propose the meaning of the forward protection for secure reach look. Likewise, show how three broadly utilized cryptographic devices — request safeguarding encryption (OPE), pseudorandom capability, and once cushion can be utilized to plan a proficient, precise, and forward secure (EAFS) accessible encryption conspire supporting reach search in encoded mathematical data sets. In the proposed EAFS conspire, a hidden entrance just matches the last information record that fulfills the pursuit range, and different outcomes are found iteratively utilizing the past outcome. OPE's efficiency, forward privacy, and accuracy are simultaneously guaranteed by its chain-like search and embedded ciphertexts.
The data may be processed to fit a particular data structure, such as a B-tree, in which the data are stored in order, to improve range search efficiency. This is not difficult to accomplish in the plaintext space, however not the situation when data sets are encoded. First, there is insufficient semantic information in the encrypted environment to allow for numerical comparisons. In addition, in order to verify equality, it is impractical to list all possible cases for the entire range in a search request. Second, the request between various information records is likewise touchy data. All in all, the information proprietor (DO) for the most part doesn't believe the CS should be familiar with the request between various information records, and the list shouldn't uncover the request data preceding looking. As a result, range searching in the ciphertext domain is difficult.
Key Words: Cipher Text, Location Based Service (LBS), Cyber-attacks, Order preserving encryption.
Bijit Hore et al. [1] proposed Secure multi-faceted reach questions over reevaluated information. Questions are assessed in a rough way where the returned set of records might contain a few misleading up-sides. These records then, at that point, should be gotten rid of by the client which contains the computational above of our plan. We foster a bucketization system for noting multi-faceted reach questions on complex information. We estimate the client's computational overhead and disclosure risk for a given bucketization scheme using cost and disclosure risk metrics. Shabnam Kasra Kermanshahi et al. [2] proposed
1. INTRODUCTION For a variety of reasons, including the ability to access our data from any location at any time with any computing device, higher service quality, and lower costs associated with data management, cloud servers (CSs) are increasingly being used to store data. Data on our laptops and mobile devices may be automatically transferred to CSs like iCloud or OneDrive in some
© 2024, IRJET
|
Impact Factor value: 8.226
|
ISO 9001:2008 Certified Journal
|
Page 155