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
0answers
40 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 ...
9
votes
1answer
661 views

Representing a function as FHE circuit

I am actually trying to study homomorphic encryption (on lattices) but I'm facing a problem. Every paper that I have read so far talk about writing the function to evaluate on ciphertexts as a circuit,...
1
vote
0answers
34 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. ...
1
vote
0answers
25 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 ...
2
votes
1answer
25 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 ...
0
votes
0answers
30 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
30 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 guess, that they are called circuits because the holy grail is to realize a ...
0
votes
0answers
63 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 ...
1
vote
1answer
40 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 ...
5
votes
1answer
161 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?
0
votes
1answer
25 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 ...
1
vote
1answer
69 views

BGV for three multiplication level/depth

Can BGV homomorphic encryption scheme support three multiplication level/depth with the help of key switching and modulus switching? If Yes, how does one set up the parameter to achieve that?
1
vote
1answer
81 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 ...
4
votes
2answers
85 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 ...
3
votes
1answer
88 views

How does the 'Flatten' function reduce the coefficients of a vector/matrix?

Seen here, at the bottom of page 5, $\operatorname{Flatten}(\vec{a})$ is defined as: $\operatorname{Flatten}(\vec{a})=\operatorname{BitDecomp}(\operatorname{BitDecomp}^{-1}(\vec{a}))$ For an n-...
3
votes
1answer
44 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 ...
4
votes
0answers
49 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 ...
2
votes
1answer
48 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. ...
3
votes
0answers
56 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
46 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 ...
3
votes
1answer
85 views

Gentry-Halevi’s Fully-Homomorphic Encryption and hermite factor

In section 7.2, page 18 in Chen-Nguyen paper regarding BKZ 2.0, they point out different Hermite factors related to Gentry-Halevi FHE. More precisely, it is said that the critical Hermite factor for ...
1
vote
0answers
316 views

Complexity of computing homomorphic encrypted matrix multiplication

Given two players $P_1 , P_2$ . In our setting $P_1$ poses two encrypted matrices $M_{1_{k \times k}},M_{2_{k \times k}}$ over field $F$, and the encryption has additive homomorphic property, over ...
0
votes
1answer
106 views

How to implement GSW13 using Helib or SEAL?

I want to implement the homomorphic encryption scheme proposed in GSW13, and make some changes to it, but seems that there is no library that has already been implemented it. Since this is a ...
3
votes
1answer
98 views

ElGamal Homomorphic Encryption Formula Question

With Public Key $(G, q, g, h)$ where $G$ is a group, $q$ prime, $g$ a generator of $G$, Am I right in thinking that: $$\mathrm{Enc}(m;r) := (g^r, h^r \cdot g^m)$$
1
vote
1answer
68 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
39 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, $...
1
vote
0answers
59 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 ...
4
votes
1answer
168 views

Is there any way to check hash of homomorphic encrypted data?

I need some algorithm that satisfies: H - hash function Enc - encryption function (using public key) M - secret data $Enc(H(M)) = H(Enc(M))$ Let this system exist: the First person has a secret ...
5
votes
1answer
274 views

Zero knowledge proof for Paillier addition under multiple keys

Suppose $m_0, m_1, m_2 \in \mathbb{N}$ such that $m_0 = m_1 + m_2$, $m_i > 0$ (none of them can be 0 or lower) Under a Paillier cryptosystem, set $e_0 = E(m_0, r_0)$ for a public key $(g_0, n_0)$ ...
7
votes
1answer
179 views

Two plaintexts map to the same ciphertext in fully homomorphic encryption?

In standard symmetric encryption, we can create an encryption scheme, in which two plaintexts $x_1, x_2$ map to the same ciphertext $y$, by choosing appropriate keys $k_1,k_2$ (!). The most simple ...
11
votes
1answer
5k views

Can Elgamal be made additively homomorphic and how could it be used for E-voting?

Elgamal is a cryptosystem that is homomorphic over multiplication. How can I convert it to an additive homomorphic cryptosystem? How can I use this additive homomorphic Elgamal cryptosystem for E-...
2
votes
0answers
68 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)) ...
0
votes
1answer
43 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 ...
1
vote
1answer
76 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 ...
4
votes
1answer
133 views

Noise of ciphertexts in LWE/RLWE based FHE

Often times $[\langle \textbf{c}, \textbf{s} \rangle]_q$ is referred to as the noise associated to the ciphertext $\textbf{c}$, and that decryption is correct when the norm of the noise is $< q/2$. ...
2
votes
1answer
238 views

Bit decomposing a polynomial in BGV cryptosystem

I'm having trouble with the BitDecomp subroutine on page 9 of the BGV cryptosystem. I'm focusing on the RLWE instantiation so $R_q = \mathbb{Z}[x]/(x^d+1,q)$. I can't see how BitDecomp works for a ...
4
votes
1answer
493 views

SEAL Homomorphic multiplication

In SEAL homomorphic encryption library, there is an internal procedure to decompose a polynomial with large coefficients into a vector of polynomials with smaller coefficients. The procedure is ...
1
vote
1answer
31 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
34 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 ...
90
votes
8answers
26k views

How is CipherCloud doing homomorphic encryption?

Much of the literature and latest papers suggest that homomorphic encryption is still not practical yet. How is CipherCloud able to achieve this? Does anyone have an idea? Their website does not ...
1
vote
2answers
170 views

How to define a FHE scheme whose plaintext space is infinite using boolean circuits?

There are many kinds of fully homomorphic encryption scheme by using boolean circuits. And the plaintext space $\mathcal{P} = \{ 0,1 \}$. If there is a -bit FHE scheme, we can construct a FHE scheme ...
7
votes
3answers
2k views

Can we proxy-re-encrypt using homomorphic encryption schemes?

Homomorphic encryption schemes are PKE schemes with an additional special method Evaluate. The Evaluate method takes input any function (as boolean circuit) and encrypted inputs of the function and ...
2
votes
1answer
54 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
174 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
47 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 ...
5
votes
2answers
157 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 ...
2
votes
1answer
178 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 "...
0
votes
1answer
165 views

SEAL-CKKS max multiplication depth

I am trying to understand how SEAL-CKKS scheme works and I wonder what multiplication level can we achieve using this scheme? Like 100 possible?
1
vote
2answers
63 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 ...
4
votes
3answers
1k views

Proof that a hash matches an encrypted file

Assume that Alice has a file $F$ which she is going to send, in encrypted form to Bob. Alice possesses $F$ and an encryption key $K$. She sends to Bob the encryption of $F$ using $K$, $E(F,K)$ as ...

1 2 3 4 5 12