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

Filter by
Sorted by
Tagged with
1
vote
0answers
30 views

How to compute an identity function on encrypted vector by using a third party?

I want to compute an identity function over encrypted vector on a third party. For example, F(x) = [a1,a2,..,an] where x is a tag. However, i do not want the third ...
2
votes
0answers
75 views

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 ...
0
votes
1answer
58 views

Is it possible to construct dataset for only another party to consult?

Is it possible to construct a dataset made of some kind of probabilistic encrypted indexes such that anyone can update the information contained in the set but only the one with a secret key could be ...
2
votes
1answer
107 views

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 ...
2
votes
2answers
202 views

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 ...
1
vote
1answer
264 views

lookup encrypted text by clear text without decryption

I've implemented vouchers module in my web project where I use it to generate redeem get etc... vouchers. since voucher codes are considered sensitive, I've considered to encrypt them using AES-GCM. ...
2
votes
1answer
56 views

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 ...
1
vote
0answers
235 views

Design flaw in IND-CKA definition of Searchable Symmetric Encryption?

I am a graduate student interested in searchable encryption research. I carefully read the Secure Indexes paper published in 2004, and I was confused about the IND-CKA, the game-based security ...
0
votes
1answer
91 views

The output of experiments Real and Ideal in simulation-based security proof [closed]

For simulation-based security proof in searchable encryption, there are two experiments running for the Real and the Ideal world respectively. I can understand that the Real world experiment taking ...
1
vote
1answer
17 views

Problem in Identifying relevant documents to evaluate Precision in Information Retrieval (IR) Systems

In searching engines, especially for ranked search approaches, How to evaluate the results returned by IR Systems . The precision is evaluated by the below equation: (Number of relevant documents in ...
2
votes
2answers
293 views

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 ...
3
votes
1answer
299 views

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.
5
votes
2answers
2k views

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 ...
5
votes
2answers
314 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 ...
7
votes
2answers
1k 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 ...
5
votes
3answers
626 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
330 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
141 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
192 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
343 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 ...
7
votes
2answers
1k 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) ...