scispace - formally typeset
Proceedings ArticleDOI

Generalized pattern matching string search on encrypted data in cloud systems

Reads0
Chats0
TLDR
This paper proposes a scheme for Generalized Pattern-matching String-search on Encrypted data (GPSE) in cloud systems and implements two most commonly used pattern matching search functions on encrypted data, the substring matching and the longest-prefix-first matching.
Abstract
Searchable encryption is an important and challenging issue. It allows people to search on encrypted data. This is a very useful function when more and more people choose to host their data in the cloud and the cloud server is not fully trustable. Existing solutions for searchable encryption are only limited to some simple functions of search, such as boolean search or similarity search. In this paper, we propose a scheme for Generalized Pattern-matching String-search on Encrypted data (GPSE) in cloud systems. GPSE allows users to specify their search queries by using generalized wildcard-based string patterns (such as SQL-like patterns). It gives users great expressive power in specifying highly targeted search queries. In the framework of GPSE, we particularly implemented two most commonly used pattern matching search functions on encrypted data, the substring matching and the longest-prefix-first matching. We also prove that GPSE is secure under the known-plaintext model. Experiments over real data sets show that GPSE achieves high search accuracy.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

PVOPM: Verifiable Privacy-Preserving Pattern Matching with Efficient Outsourcing in the Malicious Setting

TL;DR: The proposed PVOPM achieves both verifiability and text/pattern privacy against the collusion between the cloud and malicious receiver/sender, by generating authentication proofs of constant size and executing constant times of any one-way trapdoor permutation, independent to both the text size n and the pattern size m.
Journal ArticleDOI

Middlebox-Based Packet-Level Redundancy Elimination Over Encrypted Network Traffic

TL;DR: This paper presents RE over encrypted traffic (REET), the first middlebox-based system that supports both intra-user and inter-user packet-level RE directly overencrypted traffic and implements a novel protocol with limited overhead that protects end users from honest-but-curious middleboxes.
Proceedings ArticleDOI

A Privacy-Preserving Multi-Pattern Matching Scheme for Searching Strings in Cloud Database

TL;DR: This paper provides solutions to solve the problems of pattern matching and how to determine the value of k automatically of a top-k search for different queries on encrypted data and proves that the scheme is secure against chosen query attack.
Proceedings ArticleDOI

Structured queries with generalized pattern matching on encrypted cloud data

TL;DR: A new searchable encryption scheme that realizes structured queries with generalized pattern matching to Search over Encrypted cloud data (SPSE), which enhances the privacy by introducing two-tier encryption structure for data confidentiality and by hiding the search pattern of attribute fields to resist statistic analysis from untrusted parties.
Journal ArticleDOI

UFETCH: A Unified Searchable Encryption Scheme and Its Saas-Native to Make DBMS Privacy-Preserving

TL;DR: In this article, a unified searchable encryption (SE) scheme named uFETCH is proposed to accommodate both the textual and numerical data types, and it is able to build unified SE indexes for both the types while enabling encrypted search even if the SE indexes built for texts and numbers are mixed.
References
More filters
Proceedings ArticleDOI

How to generate and exchange secrets

TL;DR: A new tool for controlling the knowledge transfer process in cryptographic protocol design is introduced and it is applied to solve a general class of problems which include most of the two-party cryptographic problems in the literature.
Journal ArticleDOI

Fast Pattern Matching in Strings

TL;DR: An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings, showing that the set of concatenations of even palindromes, i.e., the language $\{\alpha \alpha ^R\}^*$, can be recognized in linear time.
Proceedings ArticleDOI

Searchable symmetric encryption: improved definitions and efficient constructions

TL;DR: In this paper, the authors proposed a searchable symmetric encryption (SSE) scheme for the multi-user setting, where queries to the server can be chosen adaptively during the execution of the search.
Proceedings ArticleDOI

Fuzzy Keyword Search over Encrypted Data in Cloud Computing

TL;DR: This paper formalizes and solves the problem of effective fuzzy keyword search over encrypted cloud data while maintaining keyword privacy, and exploits edit distance to quantify keywords similarity and develops an advanced technique on constructing fuzzy keyword sets, which greatly reduces the storage and representation overheads.
Proceedings ArticleDOI

Secure kNN computation on encrypted databases

TL;DR: A new asymmetric scalar-product-preserving encryption (ASPE) that preserves a special type of scalar product and is shown to resist practical attacks of a different background knowledge level, at a different overhead cost.
Related Papers (5)