Bob Investigates Wendy and Needs to Ask Alice
1-to-N Oblivious Transfer
Preface
I was asked by someone about how I got into cryptography, and the answer was rather easy for me. It all happened in 2009 when my Ph.D. student (Zibi Kwecka) outlined a method of using commutative encryption for oblivious transfer [1]:
Zibi used RSA as a commutative encryption method to implement his research [here], and where he told the story of Bob and Alice sharing data, and where Alice could not tell the data that Bob was selecting. I was hooked!
Overall, Zibi used a modified version of RSA and which is known as SRA [here], and where the encryption keys could be used in any order. His scenario made sense to me, and where Bob is investigating Wendy and needs to get data on her from Alice.
So how does Bob get that data, without Alice knowing that Wendy is under investigation? Well, Bob can ask for data on a range of people, and how are indexed. Bob then locks in the index value he wants, but Wendy does not know which one he has selected. Then Alice produces a unique encryption key for each of the people in the index and encrypts them for Bob…
