Timeline for Homomorphic Encryption with Addition and Exponentiation
Current License: CC BY-SA 3.0
26 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:48 | history | edited | CommunityBot |
replaced http://crypto.stackexchange.com/ with https://crypto.stackexchange.com/
|
|
| Mar 7, 2016 at 21:22 | comment | added | Geoffroy Couteau | Your question seems essentially the same that this one, you might want to check the answer I gave here, as it provides several alternatives. Also, is it absolutely necessary for you that the scheme directly support those operations, or could they be performed interactively, between two or more players? If so, there are two-party and multiparty protocols for computing Enc(abs(m)) from Enc(m) without disclosing m. | |
| Mar 7, 2016 at 16:45 | answer | added | Daniel Apon | timeline score: 2 | |
| Feb 17, 2016 at 17:10 | comment | added | Hilder Vitor Lima Pereira | I don't understand well what is your problem... Are you working in a bit level and do you just want to eliminate those minus ones? If yes, you can just encrypt each bit, getting a vector and do operations component-wise and at the end multiply each component by itself. But if you are really needing a scheme that permits you to add and power ciphertexts, I think the schemes based on LWE or RLWE are the better for you... | |
| Nov 7, 2015 at 8:49 | answer | added | Jan Leo | timeline score: 0 | |
| Nov 6, 2015 at 14:57 | comment | added | Umer | yet I am not sure will it work or not but in my mind multiplying each bit itself is causing N number of multiplications if there are N bits but still I will give it a hit. | |
| Nov 6, 2015 at 14:55 | comment | added | mikeazo | Check with the poster of this question. I am not aware of any. There is also an LWE variant. | |
| Nov 6, 2015 at 14:49 | comment | added | Umer | Hmm. I will try it. Is there opensource implementation available for BGN ? | |
| Nov 6, 2015 at 14:45 | comment | added | mikeazo | Why, you are adding two things together, then doing one multiplication? | |
| Nov 6, 2015 at 14:44 | comment | added | Umer | Agreed but would it not be considered as more than one multiplications ? | |
| Nov 6, 2015 at 14:43 | comment | added | mikeazo | I was more thinking about the case of subtraction. Subtract two bits, the result will be either 1, 0, or -1. Then multiply by itself. Now the result is either 1 or 0. | |
| Nov 6, 2015 at 14:42 | comment | added | Umer | so you mean i first calculate: A1[i]*A2[i] and then calculate A1[i]+A2[i] ? if this is the case, is not multiplication being performed multiple times ? | |
| Nov 6, 2015 at 14:39 | comment | added | mikeazo | BGN cryptosystem can perform any number of additions and one single multiplication. That may help. | |
| Nov 6, 2015 at 14:29 | comment | added | Umer | I have added more detail in the question. And it is Any of the following. The fact is if you can find any of it then you will be able to find all. | |
| Nov 6, 2015 at 14:27 | comment | added | mikeazo | Do you really mean to "check any of the following" or do you mean "to check all of the following"? | |
| Nov 6, 2015 at 14:27 | history | edited | mikeazo | CC BY-SA 3.0 |
added 5 characters in body
|
| Nov 6, 2015 at 14:24 | comment | added | mikeazo | I have a suggestion for you, as it seems like you aren't getting anywhere with your questions. You have some problem you are trying to solve and you have some direction on a solution (i.e., use homomorphic encryption). You are asking us about a problem with the possible solution, and that is going nowhere. I suggest you better explain the problem you are trying to solve. That context would be very helpful. | |
| Nov 6, 2015 at 14:23 | history | edited | Umer | CC BY-SA 3.0 |
added 246 characters in body
|
| Nov 6, 2015 at 14:18 | comment | added | Umer | by taking square of each bit result. | |
| Nov 6, 2015 at 14:16 | history | edited | Umer | CC BY-SA 3.0 |
linked previous question; added 75 characters in body
|
| Nov 6, 2015 at 14:12 | comment | added | mikeazo |
If it were limited to -1,0,1 I could see where squaring the ciphertext would ensure that $-1\to 1$. If it is not limited, as you say, how does exponentiation help you achieve your goal of making the value positive?
|
|
| Nov 6, 2015 at 14:11 | comment | added | Umer | plain text space is not limited to any value. To achieve my result i can use any values. | |
| Nov 6, 2015 at 14:09 | history | edited | Umer | CC BY-SA 3.0 |
linked previous question
|
| Nov 6, 2015 at 14:09 | comment | added | mikeazo |
Is the plaintext space limited to -1,0,1?
|
|
| Nov 6, 2015 at 13:29 | history | edited | Umer | CC BY-SA 3.0 |
added 237 characters in body
|
| Nov 6, 2015 at 13:20 | history | asked | Umer | CC BY-SA 3.0 |