Pattern Matching on Encrypted Streams

Desmoulins, Nicolas; Fouque, Pierre-Alain; Onete, Cristina; Sanders, Olivier

doi:10.1007/978-3-030-03326-2_5

Cited by 22 publications

(70 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To solve this problem, many searchable encryption (SE) techniques have been presented since 2000. SE does not only store users' encrypted data securely but also allows information search over ciphertext [7,8,9,11,12,16,19,22,32].…”

Section: Introduction 11 Backgroundmentioning

confidence: 99%

“…In SSE, only private key holders can create encrypted data and produce trapdoors for search. In SAE, users who have the public key can make ciphertexts but only private key holders can generate trapdoors [7,8,12,16,32].…”

Section: Introduction 11 Backgroundmentioning

confidence: 99%

“…Second way is to do a sequential search without an index. Recently, to perform search more flexibly and keep away from wrong or no matching results, apart from traditional solutions only providing exact keyword search, the development of new methods supporting approximate (fuzzy) keyword search has been also studied [7,8,9,11,12,13,16,19,22,25,32].…”

Section: Introduction 11 Backgroundmentioning

confidence: 99%

“…Then searching for new keywords can follow false results, even if the user data contains these keywords but not mentioned in the set of defined keywords. Furthermore, for the index base SE, very large indexes would make the efficiency of keyword search low [7,12,13,19].…”

Section: Introduction 11 Backgroundmentioning

confidence: 99%

“…To deal with the above problem, there are some SE techniques proposed such as supporting file update functionality [9,12,16,32], creating index file small [19] and providing pattern matching for search pattern is only asked at search time [7,13,25].…”

Section: Introduction 11 Backgroundmentioning

confidence: 99%

See 4 more Smart Citations

A Novel Cryptosystem Based on Steganography and Automata Technique for Searchable Encryption

2020

KSII TIIS

View full text Add to dashboard Cite

In this paper we first propose a new cryptosystem based on our data hiding scheme (2,9,8) introduced in 2019 with high security, where encrypting and hiding are done at once, the ciphertext does not depend on the input image size as existing hybrid techniques of cryptography and steganography. We then exploit our automata approach presented in 2019 to design two algorithms for exact and approximate pattern matching on secret data encrypted by our cryptosystem. Theoretical analyses remark that these algorithms both have O(n) time complexity in the worst case, where for the approximate algorithm, we assume that it uses (1 ) ) m ε −     processors, where ε , m and n are the error of our string similarity measure and lengths of the pattern and secret data, respectively. In searchable encryption, our cryptosystem is used by users and our pattern matching algorithms are performed by cloud providers.

show abstract

Section: Introduction 11 Backgroundmentioning

confidence: 99%

Section: Introduction 11 Backgroundmentioning

confidence: 99%

Section: Introduction 11 Backgroundmentioning

confidence: 99%

Section: Introduction 11 Backgroundmentioning

confidence: 99%

Section: Introduction 11 Backgroundmentioning

confidence: 99%

See 3 more Smart Citations

A Novel Cryptosystem Based on Steganography and Automata Technique for Searchable Encryption

2020

KSII TIIS

View full text Add to dashboard Cite

show abstract

Pattern Matching on Encrypted Streams

Desmoulins

Fouque

Onete

et al. 2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Privacy-Preserving Pattern Matching on Encrypted Data

Bkakria

Cuppens

2020

Advances in Cryptology – ASIACRYPT 2020

View full text Add to dashboard Cite

Pattern matching is one of the most fundamental and important paradigms in several application domains such as digital forensics, cyber threat intelligence, or genomic and medical data analysis. While it is a straightforward operation when performed on plaintext data, it becomes a challenging task when the privacy of both the analyzed data and the analysis patterns must be preserved. In this paper, we propose new provably correct, secure, and relatively efficient (compared to similar existing schemes) public and private key based constructions that allow arbitrary pattern matching over encrypted data while protecting both the data to be analyzed and the patterns to be matched. That is, except the pattern provider (resp. the data owner), all other involved parties in the proposed constructions will learn nothing about the patterns to be searched (resp. the data to be inspected). Compared to existing solutions, the constructions we propose has some interesting properties: (1) the size of the ciphertext is linear to the size of plaintext and independent of the sizes and the number of the analysis patterns; (2) the sizes of the issued trapdoors are constant on the size of the data to be analyzed; and (3) the search complexity is linear on the size of the data to be inspected and is constant on the sizes of the analysis patterns. The conducted evaluations show that our constructions drastically improve the performance of the most efficient state of the art solution.

show abstract

Pattern Matching on Encrypted Streams

Cited by 22 publications

References 32 publications

A Novel Cryptosystem Based on Steganography and Automata Technique for Searchable Encryption

A Novel Cryptosystem Based on Steganography and Automata Technique for Searchable Encryption

Pattern Matching on Encrypted Streams

Privacy-Preserving Pattern Matching on Encrypted Data

Contact Info

Product

Resources

About