Searchable encryption is a subfield of cryptography which constructs and analyzes cryptosystems that preserve the ability to 'search' over encrypted data, for some definition of 'search'.

learn more… | top users | synonyms

6
votes
2answers
94 views

ORAM over Third Party DB

Oblivious Ram (ORAM) is a cryptographic technique that is used for secure DB querying without leakage on the access patterns. There are several schemes for ORAM, amongst the most popular ones, there ...
5
votes
3answers
159 views

Searchable Encryption with Substring Search

I want to search substrings in encrypted string. To do that I have read “Implement Rabin-Karp Algorithm” and “Substring-Searchable Symmetric Encryption”. After that, I completed the Rabin-Karp ...
4
votes
3answers
217 views

paradox on fully homomorphic equality checking

Imagine, a client encrypts a corpus of data (say documents of text) with the public key of a Fully Homomorphic Encryption scheme (FHE) and outsources the data to an untrusted server.Now the client ...
4
votes
1answer
99 views

Do Curtmola et al.'s IND-CKA1/2 security definitions protect against search pattern leakage?

In the article Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions, Curtmola et al. propose adaptive and non-adaptive (indistinguishability and simulator-based) security ...
2
votes
0answers
108 views

See any problems with this search-specific homomorphic encoding strategy?

I'm imagining this for use in the scenario of cloud-stored client-encrypted email, where, when seeking to do a string search across messages, you don't want to have to download every stored message in ...
2
votes
0answers
117 views

Does Ciphertext policy ABE support search operation on encrypted data

Basically CP-ABE (or attribute based encryption) allows end-users to encrypt the data with desired access control structure. I was investigating the how to do keyword-search on encrypted data given ...
4
votes
1answer
302 views

reducing false positives in searchable encryption

Practical techniques for searchable encryption proposed by Song et al. [1] have a false positive rate of $l/2^m$ where $l$ is left half of encrypted bits and $m$ is right half and $l+m=n$ where $n$ is ...
3
votes
2answers
561 views

Is it possible to match encrypted documents using user-defined search terms?

Suppose I am storing a number of encrypted documents in a database. I would like to make it possible to identify the subset of documents whose contents match user-specified search terms without a) ...