Post-quantum UC-secure oblivious transfer in the standard model with adaptive corruptions

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Since the seminal result of Kilian, Oblivious Transfer (OT) 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. The 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 secure post-quantum OT schemes. In this paper, we show how to construct an OT 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.

Original languageEnglish
Title of host publicationProceedings of the 14th International Conference on Availability, Reliability and Security, ARES 2019
PublisherAssociation for Computing Machinery
ISBN (Electronic)9781450371643
DOIs
Publication statusPublished - 26 Aug 2019
Externally publishedYes
Event14th International Conference on Availability, Reliability and Security, ARES 2019 - Canterbury, United Kingdom
Duration: 26 Aug 201929 Aug 2019

Publication series

NameACM International Conference Proceeding Series

Conference

Conference14th International Conference on Availability, Reliability and Security, ARES 2019
Country/TerritoryUnited Kingdom
CityCanterbury
Period26/08/1929/08/19

Keywords

  • Lattices
  • Oblivious Transfer

Fingerprint

Dive into the research topics of 'Post-quantum UC-secure oblivious transfer in the standard model with adaptive corruptions'. Together they form a unique fingerprint.

Cite this