Scribd
Upload
58 views1 page

A New Lightweight Symmetric Searchable Encryption Scheme For String Identification

This paper proposes a new lightweight symmetric searchable encryption scheme for string identification that requires only one round of communication and O(n) computations over n documents. Unlike previous schemes, it uses hash-chaining instead of chain encryption for index generation, making it suitable for lightweight applications. It is the first to introduce probabilistic trapdoors in SSE for string search and proves security against an honest-but-curious server while leaking only frequency and position information from search history. Modifications allow protection against active adversaries with additional communication rounds and memory.

Uploaded by

Sindhu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
58 views1 page

A New Lightweight Symmetric Searchable Encryption Scheme For String Identification

This paper proposes a new lightweight symmetric searchable encryption scheme for string identification that requires only one round of communication and O(n) computations over n documents. Unlike previous schemes, it uses hash-chaining instead of chain encryption for index generation, making it suitable for lightweight applications. It is the first to introduce probabilistic trapdoors in SSE for string search and proves security against an honest-but-curious server while leaking only frequency and position information from search history. Modifications allow protection against active adversaries with additional communication rounds and memory.

Uploaded by

Sindhu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

A New Lightweight Symmetric Searchable Encryption

Scheme for String Identification


Abstract:
In this paper, we provide an efficient and easy-to-implement symmetric searchable
encryption scheme (SSE) for string search, which takes one round of
communication, O(n) times of computations over n documents. Unlike previous
schemes, we use hash-chaining instead of chain of encryption operations for index
generation, which makes it suitable for lightweight applications. Unlike the
previous SSE schemes for string search, with our scheme, server learns nothing
about the frequency and the relative positions of the words being searched except
what it can learn from the history. We are the first to propose probabilistic
trapdoors in SSE for string search. We provide concrete proof of non-adaptive
security of our scheme against honest-but-curious server based on the definitions.
We also introduce a new notion of search pattern privacy, which gives a measure
of security against the leakage from trapdoor. We have shown that our scheme is
secure under search pattern in distinguish ability definition. We show why SSE
scheme for string search cannot attain adaptive in distinguish ability criteria as
mentioned. We also propose modifications of our scheme so that the scheme can
be used against active adversaries at the cost of more rounds of communications
and memory space. We validate our scheme against two different commercial
datasets.

You might also like