Timeline for Interactive Homomorphic Encryption
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 21, 2018 at 21:02 | comment | added | dilot | Yes, B learns. But the matter is, B cannot learn m1+m2, only learns k*(m1+m2). This does not mean that B learns data itself, the one B learns is the blinded one. | |
| Nov 21, 2018 at 1:24 | answer | added | Geoffroy Couteau | timeline score: 1 | |
| Nov 20, 2018 at 19:23 | comment | added | eventeal | @dtoprakhishar I'm confused. You say Party B decrypts the two inputs before performing the division. That would mean B learns the inputs. Right? | |
| Nov 18, 2018 at 19:25 | comment | added | dilot | @kiwidrew Not necessarily reactive, I think. Party B does not need to keep memory. | |
| Nov 18, 2018 at 16:33 | comment | added | dilot | No no. Let's say that Party A has c1 and c2 and wants to compute (c1+c2)/(c1*c2). Addition and multiplication are easy with homomorphic encryption schemes. But for division, I would use approximation function and this means lots of multiplications. So, requires lots of time. For this reason, I want to send (c1+c2) and (c1*c2) to Party B. I may use blinding. Then, Party B decrypts these two inputs, performs the division and sends the result back after encrypting. Party B learns anything, Party A gets the division result pretty fast. | |
| Nov 18, 2018 at 16:32 | comment | added | kiwidrew | I think the term you're looking for is "reactive functionality". Multiparty computation is often framed as parties having decided the function in advance and with all of their inputs ready at the start of the protocol... but some MPC protocols are reactive, meaning parties may choose step-by-step which inputs to share and which functions to perform. | |
| Nov 18, 2018 at 16:00 | comment | added | abacabadabacaba | Why can't Party A perform the computation by itself? If this is because Party B knows something that Party A doesn't, why can't Party B share this information with Party A? | |
| Nov 18, 2018 at 15:39 | history | edited | dilot | CC BY-SA 4.0 |
added 37 characters in body
|
| Nov 18, 2018 at 15:03 | comment | added | dilot | In my case, both parties do not have input. Party A, when it gets stuck with a computation just sends it to Party B. And, Party B sends the result of this particular computation to Party A. | |
| Nov 17, 2018 at 22:09 | comment | added | abacabadabacaba | How is what you want different from Secure multi-party computation? | |
| Nov 17, 2018 at 20:44 | history | asked | dilot | CC BY-SA 4.0 |