Efficient Post Quantum Random Oblivious Transfer Based on Lattice

Bo Mi, Darong Huang, Shaohua Wan +2 more

Aaditya Rengarajan, Lohith Senthilkumar

Oblivious inference (OI) systems such as MiniONN, GAZELLE and DELPHI rely on oblivious transfer (OT) bootstrapped from base OTs whose security rests on CDH or DDH, which Shor’s algorithm breaks; for longlived IIoT deployments, Harvest-Now-Decrypt-Later makes this a current concern. We review post-quantum (PQ) OT protocols published 2008–2026 against five axes: UC security, adversarial model, security model (ROM, QROM, CRS, standard model), round complexity, and reported benchmarks. Within our corpus, only lattice-based OT has measured performance on ARM application-class cores: ROTed reports 191 µs (286.5 k cycles) per ROT on a Cortex-A72, excluding network latency and randomness generation. Isogeny-based OT has the smallest messages but no reported implementation. We find two gaps: no implemented PQ base OT that UC-realises standard or random OT has a QROM proof, while the RO-free UC constructions are unimplemented; and no PQ base OT has been measured on microcontroller-class hardware.

Amit Agarwal, James Bartusek, Dakshita Khurana +1 more

Olivier Blazy, Céline Chevalier, Quoc-Huy Vu

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.

Sushmita Sarkar, Vikas Srivastava, Tapaswini Mohanty +2 more

Charles H. Bennett, Gilles Brassard A, Claude Crépeau +1 more