Cryptography Stack Exchange
Cryptography Stack Exchange

Questions tagged [searchable-encryption]

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'.

30 questions
8
votes
2 answers

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 implementation. But, those does not answer for my…
Hakan ALTAŞ
  • 183
  • 7
7
votes
1 answer

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) maintaining a plaintext index or b) decrypting…
nw.
  • 173
  • 5
6
votes
3 answers

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 wants search for a particular word in the corpus of…
sashank
  • 6,234
  • 4
  • 36
  • 68
5
votes
2 answers

Searchable encryption vs Homomorphic encryption

For a search algorithm, what are the differences between using searchable encryption (SE) and using homomorphic encryption (HE) ? What are the advantages or disadvantages of using one of the above over the other if the requirement is a method for…
1010101
  • 365
  • 3
  • 10
5
votes
2 answers

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 is Path ORAM. However, and as far as I understand…
DaWNFoRCe
  • 892
  • 7
  • 17
4
votes
1 answer

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 definitions for searchable encryption schemes,…
JRG
  • 71
  • 5
4
votes
1 answer

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 number of bits of the word being encrypted. For…
sashank
  • 6,234
  • 4
  • 36
  • 68
3
votes
0 answers

Public key encrypted searchable index

I'm trying to implement system for encrypted and searchable audit logs. The system will work in the following manner: There will be an untrusted audit log server, where all the logs will be saved and which will return audit logs corresponding to…
Marmellad
  • 131
  • 2
3
votes
1 answer

Why use indexing for searchable encryption?

Searchable encryption can be separated into sequential scan and indexing. Besides increasing search speed, why do we use indexing in searchable encryption? As an end-user, we do not usually make a keyword list of our document. So, if we don't build…
Piao
  • 47
  • 3
3
votes
1 answer

Searchable Symmetric Encryption VS Deterministic encryption?

I am a beginner learning about encryption. The Searchable Symmetric Encryption is better than Deterministic encryption? When I say better I mean smaller leakage.
Robert
  • 31
  • 2
2
votes
1 answer

Which encryption technique should be adopted to keep the search functionalities?

I am in exactly the same situation as described in this post. I must be able to encrypt data from a client workstation then send it to an untrusted server (encrypted at rest), then decrypt it only on the same client workstation. However, the client…
Marc Alves
  • 31
  • 3
2
votes
2 answers

Search Over Encrypted Data

I'm doing a research about how to search over encrypted data as the title said. And, I saw cryptDB used a cryptographic scheme from Song et.al's article Practical Techniques for Searches on Encrypted Data to search for words on encrypted data. But…
Simão Dolores
  • 35
  • 2
2
votes
1 answer

Unsure of syntax used in Searchable Encryption

This image is taken from Algorithm 1 from "Σoφoς – Forward Secure Searchable Encryption, CCS '16". On line 4 there seems to be a new variable, M, that is never defined throughout the rest of the paper. Should I attain a random byte[] and set that…
Stilton
  • 93
  • 3
2
votes
2 answers

Is Discrete Logarithmic assumption enough to design a secure searchable encryption scheme?

I have a basic question in my mind which is "Can we develop a scheme based on Discrete Logarithmic (DL) assumption only? " Most of the "Searchable Encryption" schemes use assumptions like Decisional Bilinear Diffie–Hellman (DBDH) in their formal…
Naz
  • 95
  • 7
2
votes
0 answers

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 order to decrypt and search. [Note that…
Mike Lawrence
  • 121
  • 2
1
2