分野別セミナー

The notion of an important primitive in secure distributed cryptography, known as Generalized Oblivious Transfer (GOT) was introduced by Ishai and Kushilevitz (Proceeding of ISTCS97, IEEE Computer Society, 1997). In a GOT protocol, the sender holds a set M of secrets. The receiver is allowed to learn any qualified subset of secrets from that collection and nothing else, while the sender must remain oblivious regarding the selection that the receiver made. GOT has various applications such as in priced OT, in oblivious multivariate polynomial evaluation etc. However, up to the best of our knowledge all the GOT protocols that are proposed in the literature provide computational security that depends on some hardness assumption i.e., the security of the protocol boils down to some believe. As a result, research on information theoretic security for GOT is essential. Here, we discuss about information-theoretically secure GOT protocol based on secret sharing and distributed oblivious transfer.