Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy
During an adaptive oblivious transfer (OT), a sender has n private documents, and a receiver can adaptively fetch k documents from them such that the sender learns nothing about the receiver’s selection and the receiver learns nothing more than those k documents. Most recent fully simulatable adaptive OT schemes are based on so-called “assisted decryption” or “blind decryption”. In this paper, we revisit another technique, “blind permute-decryption”, for designing adaptive OT. We propose an efficient generic fully simulatable oblivious transfer framework with statistical receiver’s privacy that based on “blind permute-decryption” together with three concrete installations. The first one is based on Elgamal, so the corresponding OT is secure under classical DDH assumption. The second one is based on Paillier, so the corresponding OT is secure under Decisional n-th Residuosity assumption. Besides, we introduce an extended zero-knowledge proof framework with several applications.
KeywordsAdaptive oblivious transfer Zero-knowledge Proof fully simulatable security
Unable to display preview. Download preview PDF.
- [BBS04]Boneh, D., Boyen, X., Shacham, H.: Short Group Signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 227–242. Springer, Heidelberg (2004)Google Scholar
- [GH10]Green, M., Hohenberger, S.: Practical adaptive oblivious transfer from simple assumptions. Cryptology ePrint Archive, Report 2010/109 (2010), http://eprint.iacr.org/
- [Lip05]Lipmaa, H.: An oblivious transfer protocol with log-squared communication, pp. 314–328 (2005)Google Scholar
- [NP99]Naor, M., Pinkas, B.: Oblivious Transfer with Adaptive Queries. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, p. 791. Springer, Heidelberg (1999)Google Scholar