Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10333900 | Theoretical Computer Science | 2011 | 9 Pages |
Abstract
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 recent years: cryptosystems which are both multiplicatively and additively homomorphic. Our second generic construction is based on secret sharing schemes.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Javier Herranz,