Score:0

Is there any new progress on the issue of 2-server private information retrieval with secret shared index?

de flag

Recently, I encountered a secret retrieval problem. In my scenario, two parties each holds a secret share of index $i$, and they want to get $bucket_i$ together. I found that CCS17 paper Floram is quite good, they observed that computing PRG with general 2PC method like GC can be avoided when generating FSS correction words, which is a very neat idea. However, they needed to decrypt that encrypted $bucket_i$, which introduces computing PRG with Garbled Circuits again. I am not familiar with this field, so I want to ask if there is any new progress in the decryption part, so that the implementation of PRG by GC can be optimized?

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.