Universally composable adaptive priced oblivious transfer

Abstract. 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, un-like 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 prop-erties, we design the first efficient non-interactive proof of knowledge that a value lies in a given interval we are aware of