2 research outputs found
Post-Quantum UC-Secure Oblivious Transfer in the Standard Model with Adaptive Corruptions
Since the seminal result of Kilian, Oblivious Transfer has proven to be a
fundamental primitive in cryptography. In such a scheme, a user is able
to gain access to an element owned by a server, without learning more than
this single element, and without the server learning which element the user
has accessed. This primitive has received a lot of study in the literature,
among which very few schemes are based on lattices.
The recent NIST call for post-quantum encryption and signature
schemes has revived the interest for cryptographic protocols based on
post-quantum assumptions and the need for a secure post-quantum
oblivious transfer scheme.
In this paper, we show how to construct an oblivious transfer
scheme based on lattices, from a collision-resistant chameleon hash
scheme (CH) and a CCA encryption scheme accepting a smooth projective
hash function (SPHF). Note that our scheme does not rely on random
oracles and provides UC security against adaptive corruptions assuming
reliable erasures