Paper 2008/182 Original: eprint.iacr.org/2008/182 ↗
Restricted Adaptive Oblivious Transfer
Abstract
In this work we consider the following primitive, that we call {\it restricted adaptive oblivious transfer}. On the one hand, the owner of a database wants to restrict the access of users to this data according to some policy, in such a way that a user can only obtain information satisfying the restrictions imposed by the owner. On the other hand, a legitimate user wants to privately retrieve allowed parts of the data, in a sequential and adaptive way, without letting the owner know which part of the data is being obtained. After having formally described the components and required properties of a protocol for restricted adaptive oblivious transfer, we propose two generic ways to realize this primitive. The first one uses a cryptographic tool which has received a lot of attention from the literature in the last years: cryptosystems which are both multiplicatively and additively homomorphic. Our second generic construction is based on secret sharing schemes.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2011-09-27: last updated
- 2008-04-21: published
- Short URL
- https://ia.cr/2008/182
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2008/182,
author = {Javier Herranz},
title = {Restricted Adaptive Oblivious Transfer},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/182},
year = {2008},
url = {https://eprint.iacr.org/2008/182}
}