Simple Adaptive Oblivious Transfer without Random Oracle

Adaptive oblivious transfer (OT) is a two-party protocol which simulates an ideal world such that the sender sends M 1 , *** , M n to the trusted third party (TTP), and the receiver receives $M_{\sigma_i}$ from TTP adaptively for i = 1,2, *** k . This paper shows the first pairing-free fully simulatable adaptive OT. It is also the first fully simulatable scheme which does not rely on dynamic assumptions. Indeed our scheme holds under the DDH assumption.

[1]  Matthew Green,et al.  Universally Composable Adaptive Oblivious Transfer , 2008, IACR Cryptol. ePrint Arch..

[2]  Yehuda Lindell,et al.  Efficient Fully-Simulatable Oblivious Transfer , 2008, Chic. J. Theor. Comput. Sci..

[3]  Ivan Damgård,et al.  Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols , 1994, CRYPTO.

[4]  Xiaomin Liu,et al.  Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection , 2009, TCC.

[5]  Gilles Brassard,et al.  All-or-Nothing Disclosure of Secrets , 1986, CRYPTO.

[6]  Moni Naor,et al.  Efficient oblivious transfer protocols , 2001, SODA '01.

[7]  Oded Goldreich,et al.  A randomized protocol for signing contracts , 1985, CACM.

[8]  Moni Naor,et al.  Oblivious transfer and polynomial evaluation , 1999, STOC '99.

[9]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[10]  Abhi Shelat,et al.  Simulatable Adaptive Oblivious Transfer , 2007, EUROCRYPT.

[11]  Matthew Green,et al.  Blind Identity-Based Encryption and Simulatable Oblivious Transfer , 2007, ASIACRYPT.

[12]  Claus-Peter Schnorr,et al.  Efficient signature generation by smart cards , 2004, Journal of Cryptology.

[13]  Yael Tauman Kalai,et al.  Smooth Projective Hashing and Two-Message Oblivious Transfer , 2005, Journal of Cryptology.

[14]  Moni Naor,et al.  Number-theoretic constructions of efficient pseudo-random functions , 2004, JACM.

[15]  Joe Kilian,et al.  Founding crytpography on oblivious transfer , 1988, STOC '88.

[16]  A. Yao,et al.  Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.

[17]  David Chaum,et al.  Zero-Knowledge Undeniable Signatures , 1991, EUROCRYPT.

[18]  Ivan Damgård,et al.  Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions , 2000, Public Key Cryptography.

[19]  Kaoru Kurosawa,et al.  Multi-recipient Public-Key Encryption with Shortened Ciphertext , 2002, Public Key Cryptography.

[20]  Kaoru Kurosawa,et al.  Oblivious keyword search , 2004, J. Complex..

[21]  Yuval Ishai,et al.  Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.

[22]  Moni Naor,et al.  Oblivious Transfer with Adaptive Queries , 1999, CRYPTO.