Cryptology ePrint Archive: Report 2014/584

Universally Composable Efficient Priced Oblivious Transfer from a Flexible Membership Encryption

Pratish Datta and Ratna Dutta and Sourav Mukhopadhyay

Abstract: Membership encryption is a newly developed cryptographic primitive that combines membership proof and encryption into an unified setting. This paper presents a new flexible membership encryption scheme which is provably secure and significantly more efficient than the previous scheme. Further we apply our proposed membership encryption to construct a round optimal 1-out-of-$n$ priced oblivious transfer (POT) protocol which, unlike the existing 1-out-of-n POT schemes,is proven secure under the universally composable (UC) security model and thus preserves security when it is executed with multiple protocol instances that run concurrently in an adversarily controlled way. Moreover, using our membership encryption, the POT protocol exhibits constant communication complexity on the buyer's side and $O(n)$ communication cost on the vendor's side, which is so far the best known in the literature.

Category / Keywords: cryptographic protocols / membership encryption, priced oblivious transfer, universally composable security, bilinear maps, non-interactive proof of knowledge, P-Signature, non-interactive range proof.

Original Publication (with major differences): Acisp 2014
DOI: http://link.springer.com/chapter/10.1007%2F978-3-319-08344-5_7

Date: received 28 Jul 2014

Contact author: pratishdatta at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20140730:081703 (All versions of this report)

Short URL: ia.cr/2014/584

Discussion forum: Show discussion | Start new discussion