Affiliation:
1. Department of Mathematics, Universitat de Lleida , C. Jaume II 69, E-25001 Lleida , Spain
Abstract
AbstractA ‘1-out-of-n’ oblivious transfer (OT) protocol involves two participants: a sender, who provides a set of items as input, and a receiver. The protocol guarantees that the receiver gets exactly one of the items of the input set, while the sender is unable to determine which. Priced OT (POT) protocols further allow each item of the input set to be assigned a price in such a way that, after a proper execution of the protocol, the receiver gets the requested item if and only if the corresponding sum of money has been paid. In this paper, we present a construction which takes a ‘1-out-of-n’ OT protocol and transform it into a POT one. Moreover, the resulting system is unlinkable in the sense that the sender is unable to determine whether two executions of the protocol were run by the same receiver or not. When compared to existing unlinkable POT protocols, our construction offers a lower conceptual complexity as it does not involve the use of zero-knowledge proofs.
Funder
Spanish Ministry of Science and Innovation
Publisher
Oxford University Press (OUP)
Reference21 articles.
1. How to Exchange Secrets with Oblivious Transfer;Rabin;Cryptology ePrint Archive,2005
2. A randomized protocol for signing contracts;Even;Commun. ACM,1985
3. Oblivious polynomial evaluation;Naor;SIAM J. Computing,2006
4. Efficient Batched Oblivious PRF with Applications to Private Set Intersection;Kolesnikov,2016
5. All-or-Nothing Disclosure of Secrets;Brassard,1986
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献