Robust and leakage-resilient device-independent oblivious transfer in MiniQCrypt
Abstract
Assuming post-quantum one-way functions, we construct device-independent (DI) oblivious transfer (OT) and bit commitment: honest parties use only trusted classical computation to operate untrusted quantum devices, which may share arbitrary entanglement and behave non-IID. Security is simulation-based against quantum polynomial-time adversaries and composes sequentially with efficient simulators. One protocol skeleton serves both, in two regimes. With isolated laboratories and coordinate-local measurements in the honest receiver's device, it tolerates a constant rate of honest-device faults. With polylogarithmically many qubits of adaptive leakage between the laboratories and arbitrary joint measurements, it tolerates an inverse-polylogarithmic rate. Each elementary DI call uses a fresh, isolated batch of polylogarithmically many device coordinates, and total device use in the compiled OT protocol is polynomial. The commitment has efficient simulators against both parties and yields DI coin tossing with abort. Because OT is complete for secure computation, the construction yields a DI protocol, with abort, for every efficiently computable classical functionality on a fixed number of parties, secure against static corruption of any proper subset of them. The commitment's extractor changes a public parity relation through classical equivocation and leaves the device execution, hence its leakage, unchanged. A commit-and-prove functionality, disjoint audits, and an affine consistency check link the certified correlations to ideal OT. Sender security rests on a selector-aware parallel-repetition bound for the Magic Square game, which we derive from the two-round threshold theorem of Kundu and Tan.
Related
- Quantum-State Oblivious Transfer over Quantum Erasure Channels
- Mixed States in Quantum Rabin Oblivious Transfer
- In-Memory AM Demodulation Using an All-Silicon Independent-Dual-Gate Gain-Cell Memory with <10−22 A Leakage Determined by Single-Electron Counting
- Configuration-Independent Low-Energy Gaps in Graphene Nanoribbons: A δ-Scatterer Transfer-Matrix Approach
- Leakage current evolution in LHCb VELO sensors during Run 1-2 LHC data taking period
BibTeX
@misc{chen2026robust,
title = {{Robust and leakage-resilient device-independent oblivious transfer in MiniQCrypt}},
author = {Zhili Chen and Rahul Jain and YaoNan Zhang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.01421},
eprint = {2610.01421},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.01421},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Robust and leakage-resilient device-independent oblivious transfer in MiniQCrypt
AU - Zhili Chen
AU - Rahul Jain
AU - YaoNan Zhang
PY - 2026
DA - 2026/10/02
PB - arXiv
DO - 10.48550/arxiv.2610.01421
UR - https://arxiv.org/abs/2610.01421
AB - Assuming post-quantum one-way functions, we construct device-independent (DI) oblivious transfer (OT) and bit commitment: honest parties use only trusted classical computation to operate untrusted quantum devices, which may share arbitrary entanglement and behave non-IID. Security is simulation-based against quantum polynomial-time adversaries and composes sequentially with efficient simulators. One protocol skeleton serves both, in two regimes. With isolated laboratories and coordinate-local measurements in the honest receiver's device, it tolerates a constant rate of honest-device faults. With polylogarithmically many qubits of adaptive leakage between the laboratories and arbitrary joint measurements, it tolerates an inverse-polylogarithmic rate. Each elementary DI call uses a fresh, isolated batch of polylogarithmically many device coordinates, and total device use in the compiled OT protocol is polynomial. The commitment has efficient simulators against both parties and yields DI coin tossing with abort. Because OT is complete for secure computation, the construction yields a DI protocol, with abort, for every efficiently computable classical functionality on a fixed number of parties, secure against static corruption of any proper subset of them. The commitment's extractor changes a public parity relation through classical equivocation and leaves the device execution, hence its leakage, unchanged. A commit-and-prove functionality, disjoint audits, and an affine consistency check link the certified correlations to ideal OT. Sender security rests on a selector-aware parallel-repetition bound for the Magic Square game, which we derive from the two-round threshold theorem of Kundu and Tan.
ER -