Achieving Secure Search over Encrypted Data for e-Commerce

2021 ◽  
Vol 21 (1) ◽  
pp. 1-17
Author(s):  
Zhitao Guan ◽  
Naiyu Wang ◽  
Xunfeng Fan ◽  
Xueyan Liu ◽  
Longfei Wu ◽  
...  
Keyword(s):  
Encrypted Data ◽  
Secure Search

scholarly journals SECURE SEARCH OVER ENCRYPTED DATA TECHNIQUES : SURVEY

2017 ◽  
Vol 8 (7) ◽  
pp. 575-577
Author(s):  
Swati T Harane ◽  
Keyword(s):  
Encrypted Data ◽  
Secure Search

scholarly journals A query privacy-enhanced and secure search scheme over encrypted data in cloud computing

2017 ◽  
Vol 90 ◽  
pp. 14-27 ◽  
Author(s):  
Hui Yin ◽  
Zheng Qin ◽  
Lu Ou ◽  
Keqin Li
Keyword(s):  
Cloud Computing ◽  
Encrypted Data ◽  
Secure Search ◽  
Query Privacy

Secure Search Over Encrypted Data in Cloud Computing

2013 ◽  
Author(s):  
Majid Bakhtiari ◽  
Majid Nateghizad ◽  
Anazida Zainal
Keyword(s):  
Cloud Computing ◽  
Encrypted Data ◽  
Secure Search

scholarly journals Survey on secure search over encrypted data on the cloud

2019 ◽  
pp. e5284 ◽  
Author(s):  
Hoang Pham ◽  
Jason Woodworth ◽  
Mohsen Amini Salehi
Keyword(s):  
Encrypted Data ◽  
Secure Search

scholarly journals Setup-Free Secure Search on Encrypted Data: Faster and Post-Processing Free

2019 ◽  
Vol 2019 (3) ◽  
pp. 87-107 ◽  
Author(s):  
Adi Akavia ◽  
Craig Gentry ◽  
Shai Halevi ◽  
Max Leibovich
Keyword(s):  
Homomorphic Encryption ◽  
Success Probability ◽  
Post Processing ◽  
Fully Homomorphic Encryption ◽  
Matching Criterion ◽  
Encrypted Data ◽  
Multiple Data ◽  
Secure Search ◽  
Order Of Magnitude ◽  
Factor C

Abstract We present a novel secure search protocol on data and queries encrypted with Fully Homomorphic Encryption (FHE). Our protocol enables organizations (client) to (1) securely upload an unsorted data array x = (x[1], . . . , x[n]) to an untrusted honest-but-curious sever, where data may be uploaded over time and from multiple data-sources; and (2) securely issue repeated search queries q for retrieving the first element (i*, x[i*]) satisfying an agreed matching criterion i* = min { i ∈ [n] | IsMatch(x[i], q) = 1 }, as well as fetching the next matching elements with further interaction. For security, the client encrypts the data and queries with FHE prior to uploading, and the server processes the ciphertexts to produce the result ciphertext for the client to decrypt. Our secure search protocol improves over the prior state-of-the-art for secure search on FHE encrypted data (Akavia, Feldman, Shaul (AFS), CCS’2018) in achieving: – Post-processing free protocol where the server produces a ciphertext for the correct search outcome with overwhelming success probability. This is in contrast to returning a list of candidates for the client to postprocess, or suffering from a noticeable error probability, in AFS. Our post-processing freeness enables the server to use secure search as a sub-component in a larger computation without interaction with the client. – Faster protocol: (a) Client time and communication bandwidth are improved by a log2 n/ log log n factor. (b) Server evaluates a polynomial of degree linear in log n (compare to cubic in AFS), and overall number of multiplications improved by up to log n factor. (c) Employing only GF(2) computations (compare to GF(p) for p ≫ in AFS) to gain both further speedup and compatibility to all current FHE candidates. – Order of magnitude speedup exhibited by extensive benchmarks we executed on identical hardware for implementations of ours versus AFS’s protocols. Additionally, like other FHE based solutions, our solution is setup-free: to outsource elements from the client to the server, no additional actions are performed on x except for encrypting it element by element (each element bit by bit) and uploading the resulted ciphertexts to the server.

scholarly journals Information Leak Identification and Secure Search Over Encrypted Data In Cloud Storage Utilities

2016 ◽  
Author(s):  
A Anusha ◽  
J. Dayanika ◽  
Kranthi Kiran G
Keyword(s):  
Cloud Storage ◽  
Encrypted Data ◽  
Secure Search ◽  
Information Leak

An Efficient Privacy-Preserving Rank Query over Encrypted Data in Cloud Computing

2012 ◽  
Vol 35 (11) ◽  
pp. 2215 ◽  
Author(s):  
Fang-Quan CHENG ◽  
Zhi-Yong PENG ◽  
Wei SONG ◽  
Shu-Lin WANG ◽  
Yi-Hui CUI
Keyword(s):  
Cloud Computing ◽  
Privacy Preserving ◽  
Encrypted Data

Research and design of querying approach for XML encrypted data

2010 ◽  
Vol 30 (4) ◽  
pp. 1099-1102
Author(s):  
Yu-yi KE ◽  
Shi-xiong XIA ◽  
Chu-jiao WANG
Keyword(s):  
Encrypted Data ◽  
Research And Design

A New User-controlled and Efficient Encrypted Data Sharing Model in Cloud Storage

2019 ◽  
Vol 13 (4) ◽  
pp. 356-363
Author(s):  
Yuezhong Wu ◽  
Wei Chen ◽  
Shuhong Chen ◽  
Guojun Wang ◽  
Changyun Li
Keyword(s):  
Data Sharing ◽  
Data Security ◽  
Cloud Storage ◽  
Screening Program ◽  
Original Data ◽  
Third Party ◽  
Active System ◽  
Encrypted Data ◽  
Active User ◽  
User Data

Background: Cloud storage is generally used to provide on-demand services with sufficient scalability in an efficient network environment, and various encryption algorithms are typically applied to protect the data in the cloud. However, it is non-trivial to obtain the original data after encryption and efficient methods are needed to access the original data. Methods: In this paper, we propose a new user-controlled and efficient encrypted data sharing model in cloud storage. It preprocesses user data to ensure the confidentiality and integrity based on triple encryption scheme of CP-ABE ciphertext access control mechanism and integrity verification. Moreover, it adopts secondary screening program to achieve efficient ciphertext retrieval by using distributed Lucene technology and fine-grained decision tree. In this way, when a trustworthy third party is introduced, the security and reliability of data sharing can be guaranteed. To provide data security and efficient retrieval, we also combine active user with active system. Results: Experimental results show that the proposed model can ensure data security in cloud storage services platform as well as enhance the operational performance of data sharing. Conclusion: The proposed security sharing mechanism works well in an actual cloud storage environment.

Sign in / Sign up

Export Citation Format

Share Document