Universally Composable Adaptive Priced Oblivious Transfer

Alfredo Rial, Markulf Kohlweiss, Bart Preneel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

An adaptive k-out-of-N Priced Oblivious Transfer (POT) scheme is a two-party protocol between a vendor and a buyer. The vendor sells a set of messages m1, . . . ,mN with prices p1, . . . , pN . In each transfer phase i = 1, . . . , k, the buyer chooses a selection value σi  ∈ {1, . . . ,N} and interacts with the vendor to buy message m σi in such a way that the vendor does not learn σ i and the buyer does not get any information about the other messages.

We present a POT scheme secure under pairing-related assumptions in the standard model. Our scheme is universally composable and thus, unlike previous results, preserves security when it is executed with multiple protocol instances that run concurrently in an adversarially controlled way. Furthermore, after an initialization phase of complexity O(N), each transfer phase is optimal in terms of rounds of communication and it has constant computational and communication cost. To achieve these properties, we design the first efficient non-interactive proof of knowledge that a value lies in a given interval we are aware of.
Original languageEnglish
Title of host publicationPairing-Based Cryptography - Pairing 2009
Number of pages17
ISBN (Electronic)978-3-642-03298-1
ISBN (Print)978-3-642-03297-4
Publication statusPublished - 2009
Event3rd International Conference on Pairing-based Cryptography - Stanford University, Stanford, United States
Duration: 12 Aug 200914 Aug 2009

Publication series

NameLecture Notes in Computer Science


Conference3rd International Conference on Pairing-based Cryptography
Abbreviated titlePairing 2009
Country/TerritoryUnited States
Internet address


Dive into the research topics of 'Universally Composable Adaptive Priced Oblivious Transfer'. Together they form a unique fingerprint.

Cite this