Skip to content
Preprint

Robust and leakage-resilient device-independent oblivious transfer in MiniQCrypt

Oct 2026 · 0 citations
Physics Computer Science

TL;DR

Assuming post-quantum one-way functions, this work constructs device-independent oblivious transfer and bit commitment that tolerate independent honest faults at a constant rate and adaptive, bidirectional quantum leakage between the laboratories at a constant rate.

Abstract

Assuming post-quantum one-way functions, we construct device-independent oblivious transfer and bit commitment that tolerate independent honest faults at a constant rate and adaptive, bidirectional quantum leakage between the laboratories at a constant rate. Honest parties use trusted classical computation to operate untrusted quantum devices, which may share arbitrary entanglement and perform joint measurements without assumptions of independence or identical distribution. Security is simulation-based against quantum polynomial-time adversaries and composes sequentially with efficient simulators. For security parameter $\lambda$ and a prescribed total leakage budget $\ell$, one complete one-bit oblivious transfer uses $\Theta(\ell+\log^2\lambda)$ device coordinates in at most three single-use device windows, including preprocessing, and polynomial classical computation and communication. The leakage budget is shared across these windows. The commitment has efficient simulators against both parties and yields device-independent coin tossing with abort; each uses one window. Completeness of oblivious transfer gives device-independent secure computation with abort for every efficiently computable classical functionality on a fixed number of parties, against static corruption of any proper subset, provided each reached call to oblivious transfer satisfies the device and budget conditions. The construction combines short selectors with code-based choice masking, a global audit, and error correction across field symbols. The commitment extractor changes a classical code coset while leaving the device execution and its leakage unchanged. Sender security uses a global Fourier analysis and a selector-aware Magic Square repetition bound derived from the two-round threshold theorem of Kundu and Tan (2023).

View source

Similar papers

Sep 2026

Quantum Leakage Resilience of Shamir Secret Sharing

The study of quantum leakage resilience of unmodified Shamir secret sharing over prime fields shows that the maximum number of devices that may share arbitrary entanglement with one another and with the adversary while preserving security is linear in $n$ up to constant factors, although the optimal support fraction re...

Rishabh Batra, Fuyuki Kitagawa, Ryo Nishimaki et al. · 1 citation · ⚡1
Preprint Oct 2026

Quantum-State Oblivious Transfer over Quantum Erasure Channels

We study quantum-state oblivious transfer over the quantum erasure channel under information-theoretic security guarantees. Specifically, Alice holds two quantum systems, Bob wishes to recover one of them, and the parties have access to independent channel uses and authenticated public classical communication, with no...

Re-Mi A. Chou · 0 citations
Preprint Oct 2026

Big Secrets Small Shares: Revisiting Secure Multi-Party Computation

A new modification of the ramp secret sharing scheme, called compact sharing, is introduced, and the MPC protocol is tailored to accommodate this modification, which provides perfect security against static semi-honest adversaries under an explicit tradeoff between the corruption threshold and the extension degree.

Wilton Kim, Van Long Phuoc Pham, S. Kruglik et al. · 0 citations
Preprint Nov 2026

Leakage-Resilient Computation via Matrix Refreshing

It is proved that a simple refresh, in which the left party multiplies its share by a uniform invertible matrix $M$ and the right party multiplies its share by $M^{-1}$, is secure under continual local leakage.

S. Dziembowski, Sebastian Faust · 0 citations
Preprint Oct 2026

Quantum Leakage from Shamir Sharing with Correlated Resources

We bound local quantum leakage from Shamir sharing uniformly over prime fields and permitted share-dependent channels. The adversary receives all outputs and a reference to a resource independent of the secret and sharing randomness. For independent device-reference pairs at fixed output dimension, we determine the exa...

Isaac Barouch Essayag, Aryeh Lev Zabokritskiy · 0 citations
Preprint Sep 2026

Quantum key distribution using generalized contextuality against post-quantum eavesdroppers

Bell nonlocality allows secret key to be certified without trusting the internal operation of the devices, and even against eavesdroppers constrained only by the no-signaling principle. We ask whether generalized contextuality, a notion of nonclassicality available in prepare-and-measure experiments on a single system,...

Daniel Centeno, Roberto D. Baldijão, Maria Ciudad Alan'on et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.