Timeline for "shared" variant of 1-out-of-N oblivious transfer
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 25, 2022 at 11:52 | comment | added | Dylan | Hi @knaccc, "two parties cannot learn anything about the accessed element and specified index" means: either Alice or Bob cannot learn the entire A[i] and the entire i. They only know their own share of A[i] or i ( say $A[i]_{Alice}$, $A[i]_{Bob}$ and $i_{Alice}$, $i_{Bob}$ ) | |
| May 24, 2022 at 22:52 | answer | added | knaccc | timeline score: 1 | |
| May 24, 2022 at 22:09 | comment | added | knaccc | One of the parties decides on the index and learns the shared secret at the index. I don't understand what you mean by "two parties cannot learn anything", when one of them is clearly learning something. | |
| May 24, 2022 at 22:07 | comment | added | Dylan | Yes, I got it wrong. It should be: two parties cannot learn anything about the accessed element and specified index. | |
| May 24, 2022 at 22:02 | history | edited | Dylan | CC BY-SA 4.0 |
added 483 characters in body
|
| May 24, 2022 at 22:01 | comment | added | knaccc | I'm confused that you just said "two parties cannot learn anything about the shared array element and index". Doesn't that mean that neither of them learn anything? Maybe you misspoke. I think I have a solution that allows one person to query and discover one of the DH secrets, without the other party learning which secret or which index has been requested. It's also impossible for one of them to cheat, because they will commit to their shares beforehand. | |
| May 24, 2022 at 21:57 | comment | added | Dylan | @knaccc Yep! To recap the above question: in the 2PC setting, obliviously select an element from the shared array at a shared index while two parties cannot learn anything about the shared array element and index. Like warforgad said below: it's quite different from regular OT, but has similar functionality as the "shared" variant of OT. | |
| May 23, 2022 at 19:19 | comment | added | knaccc | Can your question be stated as: How can Alice and Bob each commit to their own list of public keys (which they do not initially share with one another), where a list of Diffie-Hellman shared secrets would result if Alice and Bob intentionally collaborated to determine those shared secrets. Then, how can either party gain knowledge of one of those shared secrets at a specified index, without the other party discovering either the index or the shared secret at that index? | |
| May 23, 2022 at 13:25 | answer | added | warforgad | timeline score: 1 | |
| May 23, 2022 at 8:58 | history | asked | Dylan | CC BY-SA 4.0 |