Questions tagged [homomorphic-encryption]

Cryptosystems which support computation on encrypted data. They might be partially homomorphic (support for one operation such as + or *) or they might be fully homomorphic (any sequence of + and *).

Filter by
Sorted by
Tagged with
0
votes
1answer
48 views

Decryption in Goldwasser-Micali Scheme

Referring to the following URL: http://cryptowiki.net/index.php?title=Goldwasser_Micali_cryptosystem The decryption of the message is based on wether the bit is a QRn or not, but how do we know/...
0
votes
0answers
16 views

LSIM library based on LibScarab

In a book called: "Intelligent,Secure and Dependable Systems in Distributed and Cloud Systems" where we can find some of its pages on the following URL: https://books.google.com.lb/books?id=...
0
votes
0answers
75 views

How to combine homomorphic encryption with secure multi-party computing?

I admit that I am a novice in cryptography, and I temporarily received a project that requires the use of homomorphic encryption technology and secure multiparty computing technology. Our team plans ...
1
vote
0answers
32 views

Bubble sort in Fully Homomorphic Encryption [duplicate]

I've read in a pdf written by Ayantika Chatterjee and Khin Mi Mi Aung whose title is "Fully Homomorphic Encryption in Real World Applications" that it is possible to implement a bubble sort algorithm ...
1
vote
0answers
105 views

Bootstrapping vs Recryption

In the context of fully homomorphic encryption, what is the difference between bootstrapping and recryption, since both offer the same result which is trying to eliminate/decrease the noise budget. ...
0
votes
0answers
86 views

What's the deal with conditional and jump operations in homomorphic encryption?

I'm doing some research about full homomorphic encryption (FHE). As I figured out, algorithms are implemented in circuits. I suppose that they are called circuits because the Holy Grail is to realize ...
0
votes
0answers
34 views

Homomorphic Encryption Verification

How much is it possibile to devide $E(m_1+m_2)$ by $E (m_1)$ to obtain $E (m_2)$ based on the fully Homomorphic-encryption property which says; $$E (m_1) * E (m_2) = E (m_1 + m_2)$$. And if yes what ...
0
votes
0answers
84 views

How do I prove that a user encrypted the data?

I am using homomorphic encryption, and I need to check whether or not a user's data is actually encrypted. For example, an eCommerce website pulls data from a user called Alice and wants to prove to ...
3
votes
1answer
239 views

Vector dot product in Microsoft SEAL using the CKKS scheme

I'm trying to use the Microsoft SEAL library in order to do Matrix multiplication. That's why I'm trying to find a way to compute the Dot Product of 2 vectors. My issue is that the CKKS encoder in ...
1
vote
1answer
47 views

Does Goldwasser-Micali only encrypts only 1-bit or multiple?

I've read online that the Goldwasser-Micali scheme can only encrypt 1-bit then I read that in another pdf that that scheme can encrypt a message of multiple bits so I'm confused. Can anyone clarify ...
0
votes
1answer
32 views

how to get top 10 numbers after using Pallier cryptosystem

Assume I encrypted 1000 Integers using the pallier cryptosystem. Since each time I encrypt a number using pallier I'm using a random ...
5
votes
1answer
187 views

Advantages of Pallier vs Goldwasser-Micali

It is easy to see that both Pallier and Goldwasser-Micali are homomorphic addition schemes and are secure but what would be the advantages of choosing one over the other?
6
votes
0answers
68 views

Is it possible to derive a homomorphic signature from homomorphic encryption

At the moment I am trying to find a practical way to implement a linearly homomorphic signature. Background: "In a homomorphic signature scheme, a user Alice signs some large dataset x using her ...
3
votes
1answer
60 views

How does Flatten really make the coefficients of a vector matrix small in LWE

In Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based, Gentry et. al defined Flattening as follows; Let $\vec{a},\vec{b}$ be vectors of ...
3
votes
0answers
91 views

Homomorphic Encryption Roadmap

I'm looking for some suggestions on what to read (papers, notes, book chapters?) on homomorphic encryption in order to understand the most recent (more optimal) schemes, as well as optimized use cases ...
2
votes
1answer
138 views

Threshold decryption in multi-key homomorphic encryption

I have a problem understanding the security of threshold decryption in multi-key homomorphic encryption (MKHE) with so called "noise flooding". In particular I think that it is not secure, so probably ...
1
vote
1answer
149 views

Fully Homomorphic Encryption - state of the art

What are the latest advances in fully homomorphic encryption? First of all, I am interested in cryptosystems based on LWE / RLWE and NTRU problems.
2
votes
1answer
42 views

Security of somewhat homomorphic encryption via LSB encoding?

I'm reading this paper https://eprint.iacr.org/2011/344.pdf It says that "The secret-key encryption scheme whose security is based on the LWE assumption is rather straightforward. To encrypt a bit, $...
4
votes
2answers
105 views

Proving the right encrypted message was sent

Total amateur to crypto here but I've searched and searched and am at the extent of my knowledge. I've gone down several avenues to satisfy what I'm looking for but I'm just going to describe what I'd ...
2
votes
1answer
73 views

Does the relationship between plaintext and ciphertext moduli affect the security of BGV/BV SwHE?

The SwHE schemes due to Brakerski and Vaikuntanathan (BV) and Brakerski-Gentry-Vaikuntanathan (BGV) have common concept in which the message bit is put in the least significant bit of the ciphertext. ...
1
vote
0answers
60 views

Is there a way to perform a one way function on encrypted data?

Does the following scheme exist? Let f be a one-way function (say, an encryption scheme). Let $Enc_{sk}(x)$ be an encryption of x. We then have $Eval_{pk}(f, Enc_{sk}(x)) = f(x)$. Note that this is ...
2
votes
0answers
70 views

Multi-party computation with only 1 party?

MPC is $f(E_1(a), E_2(b)) = c$, where $E$ is encryption by different keys $k_1$ and $k_2$. Homomorphic encryption is $f(E_1(a)) = E_1(c)$, where the input and output are encrypted. I want $f(E_1(a)) ...
1
vote
1answer
89 views

Paillier's Cryptosystem - Homomorphism

I'm lacking quite some mathematical knowledge here, but could anyone please explain to me why the Paillier cryptosystem is still (additive/multiplicative) homomorphic despite introducing a random ...
1
vote
1answer
160 views

Complexity of computing zk-SNARK Proofs

Disclaimer: I have no background in cryptography, and everything I'm asking about is what I've learnt from last couple of days of frantic reading on this topic. Any help is much appreciated. Q: What ...
1
vote
1answer
44 views

Range query on array of encrypted data using homomorphic encryption

Given an array or database entries of encrypted data is it possible given a min/mix value to get a range of encrypted entries? The min and max values would also be encrypted.
1
vote
0answers
49 views

What is the current state-of-the-art of function-private functional encryption?

Are there any known constructions of functional encryption with function-privacy for arbitrary functions (e.g. not just inner-product)? If so, are these constructions currently feasible or for now ...
2
votes
1answer
80 views

How the FHE encrypts a k-bit message just with one-bit encryption scheme?

I'm reading "Fully Homomorphic Encryption over the Integers"——the first generation of FHE. However, this paper seems to detail a scheme to encrypt each bit in a message. I'm very confused about how to ...
3
votes
2answers
194 views

Homomorphic Modular Reduction for Secure Storage

My question is quite similar to Homomorphic modulo, but I want to give a context where the operation is carried in an outsourced environment. Are there any specific homomorphic cryptographic schemes ...
0
votes
0answers
57 views

Question about Gentry's “Computing Arbitrary Functions of Encrypted Data”

I am working through the "Computing Arbitrary Functions of Encrypted Data" by Gentry, trying to understand more about Fully Homomorphic Encryption. I'm stuck trying to understand why his "Somewhat ...
0
votes
1answer
57 views

difference between function f in eval and dec of homomorphic authenticated encryption

In the homomorphic authenticated encryption, as described 1, there are Eval and Dec PPT algorithms: In Eval, f is the function to be performed on the encrypted data. However, I need to know why it ...
2
votes
1answer
196 views

Do any NIST PQC have “homomorphic” public keys, in the sense that any two pubkeys derive a combination pubkey?

Background: The MathMesh crypto platform (refs at the bottom) is a newly-proposed technology stack which has been somewhat cheekily called a "Grand Unified Theory of Security on the Internet". Its "...
5
votes
2answers
196 views

Does homomorphic encryption hide the algorithm itself?

The question is rather simple, but finding resources and answers quite tricky. Homomorphic encryption should enable us to compute over encrypted data. What if the algorithm for computing should be ...
1
vote
2answers
84 views

Meaning of “integers modulo 4 ” in “Fully homomorphic encryption modulo Fermat numbers” scheme

My question refers to the paper "Fully homomorphic encryption modulo Fermat numbers" by Antoine Joux. On page 3, the author describes a basic concept of the system: As many FHE systems, we deal ...
0
votes
0answers
27 views

Is there any implementation of threshold BGN homomorphic encryption?

The BGN paper (Evaluating 2-DNF Formulas on Ciphertexts) used a threshold variant of BGN. I also want to use this cryptosystem, however, I cannot find any open-source implementation. Is there any such ...
1
vote
0answers
48 views

Key derivation scheme with shared secrets?

I want to derive a list of sub-keys derived[t] from a master key mk by a key derivation function ...
1
vote
1answer
51 views

Retrieving correct ciphertext from additive ElGamal

I have been studying additive ElGamal and I think I have the hang of it except the part where the message $M$ must be retrieved by computing the discrete log of $g^M$. From what I've read, the ...
2
votes
1answer
194 views

Is there a cryptosystem which allows slicing and concatenating strings without decryption?

I want a cryptosystem with the following four functions: ...
0
votes
1answer
54 views

One-way Functions for Floating Points

Are there any commutative one-way functions for floating points? I tried to explain why I need these functions. First, I describe the problem on a high level and then I further formalize it; There ...
1
vote
1answer
94 views

Sum vector elements homorphically

I'm looking for the homomorphic version of the following (I'm using Python here): $ a = [1,2,3] $ s = sum(a) $ print(s) 6 Is there an open source fully ...
2
votes
1answer
45 views

Reference for the Security Analysis of Ring-LWE

Can someone please share a link of any research paper or web-page analyzing the security of Ring-LWE? Essentially, how should I choose my parameters to get security equivalent to 128-bit or 256-bit?
1
vote
0answers
69 views

Homomorphic Public/Private Key Encryption Scheme for Floating Numbers

Is there any public/private homomorphic encryption scheme that directly works on floating numbers or vectors of floating numbers? In our application, we want to find out if $$v_1 \approx v_2, \qquad\...
3
votes
1answer
55 views

Is it possible to sample HE ciphertexts using pseudo-random generator?

I'm trying to sample HE ciphertexts which serve as ciphertexts encrypting some random values. I have realized a example program using Microsoft SEAL, which implements a variant of BFV scheme. ...
0
votes
0answers
78 views

Hash function over numbers that preserve addition and multiplication

I wonder if there is a known hash function that for any $x$, $y$ which are numbers in a certain range with certain accuracy (I guess one can think of them as integers?), you can define two functions ...
1
vote
1answer
114 views

Can homomorphic encryption be used to exchange keys?

Fully Homomorphic Encryption (FHE) allows computations be done on ciphertexts. Can this technique be used to exchange keys? For example, Alice and Bob need to agree on a 4-bit secret key. Alice sends ...
0
votes
0answers
52 views

Why is the Paillier cryptosystem not considered fully homomorphic encryption? [duplicate]

Paillier is an additive homomorphic encryption system that can achieve the encrypted version of its sums. However, we can calculate the encrypted version of their multiplications by raising an ...
1
vote
0answers
40 views

Is there a standard benchmark data set for “Homomorphic Encryption” implementations?

Both in terms of statistical analysis (mean/variance, histograms, contingency tables, etc) and machine learning data sets. The question has also been asked here.
3
votes
1answer
145 views

Why is the Domingo-Ferrer cryptosystem not used in practice?

The Domingo-Ferrer cryptosystem is a fully homomorphic cryptosystem. It works fast enough. I have only seen known-plaintext attacks. Is this a reason not to use it in practice? Or are there more ...
1
vote
0answers
38 views

Are biases narrowed towards the provenance of hard NP complete problems relevant?

I hear of randomized reduction, deterministic reduction and non-deterministic reduction of complexity from A to B problems. This could make things impossible for polynomial time adversary prying into ...
2
votes
1answer
53 views

Maintaining validity of ZKP throughout re-randomization of homomorphic ciphertext without linkability to previous ciphertext

Question: How is it possible to adapt a ZKP for a homomorphic ciphertext to still be valid after said ciphertext has been re-randomized? Context: In a lot of e-voting systems homomorphic encryption ...
2
votes
0answers
62 views

Compute ln function of a Paillier encrypted value [closed]

If I have an encrypted value $Enc(x)$ with Paillier cryptosystem, is it feasible to compute an encryption form of $\ln(x)$ or its approximation using homomorphic properties? The input $x$ is always ...

1
2
3 4 5
13