Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Efficient Post Quantum Random Oblivious Transfer Based on Lattice

Lidong Xu, Mingqiang Wang

Published Jan 1, 2022• 0 citations
Publisher
DOI
10.1007/978-3-031-19208-1_40

Related papers

A post-quantum light weight 1-out-n oblivious transfer protocol

Bo Mi, Darong Huang, Shaohua Wan +2 more

Computers & Electrical Engineering•Feb 21, 2019•24 citations

Practical Quantum Oblivious Transfer

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

Springer eBooks•Aug 11, 2007•230 citations

Post-Quantum Oblivious Transfer for Oblivious Inference on Resource-Constrained Devices

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.

•Oct 19, 2026•0 citations

An efficient quantum oblivious transfer protocol

Sushmita Sarkar, Vikas Srivastava, Tapaswini Mohanty +2 more

Cluster Computing•Jul 8, 2024•6 citations

Post-Quantum UC-Secure Oblivious Transfer in the Standard Model with Adaptive Corruptions

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.

International Conference on Availability, Reliability and Security (ARES)•Aug 9, 2019•10 citations

Randomized Oblivious Transfer for Secure Multiparty Computation in the Quantum Setting

Bruno Costa, Pedro Costa Branco, Manuel Goulão +2 more

Secure computation is a powerful cryptographic tool that encompasses the evaluation of any multivariate function with arbitrary inputs from mutually distrusting parties. The oblivious transfer primitive serves is a basic building block for the general task of secure multi-party computation. Therefore, analyzing the security in the universal composability framework becomes mandatory when dealing with multi-party computation protocols composed of oblivious transfer subroutines. Furthermore, since the required number of oblivious transfer instances scales with the size of the circuits, oblivious transfer remains as a bottleneck for large-scale multi-party computation implementations. Techniques that allow one to extend a small number of oblivious transfers into a larger one in an efficient way make use of the oblivious transfer variant called randomized oblivious transfer. In this work, we present randomized versions of two known oblivious transfer protocols, one quantum and another post-quantum with ring learning with an error assumption. We then prove their security in the quantum universal composability framework, in a common reference string model.

Entropy•Jul 31, 2021•13 citations
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.
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.
Secure computation is a powerful cryptographic tool that encompasses the evaluation of any multivariate function with arbitrary inputs from mutually distrusting parties. The oblivious transfer primitive serves is a basic building block for the general task of secure multi-party computation. Therefore, analyzing the security in the universal composability framework becomes mandatory when dealing with multi-party computation protocols composed of oblivious transfer subroutines. Furthermore, since the required number of oblivious transfer instances scales with the size of the circuits, oblivious transfer remains as a bottleneck for large-scale multi-party computation implementations. Techniques that allow one to extend a small number of oblivious transfers into a larger one in an efficient way make use of the oblivious transfer variant called randomized oblivious transfer. In this work, we present randomized versions of two known oblivious transfer protocols, one quantum and another post-quantum with ring learning with an error assumption. We then prove their security in the quantum universal composability framework, in a common reference string model.