arXiv:2610.01421
Robust and leakage-resilient device-independent oblivious transfer in MiniQCrypt
Rishabh Batra, Zhili Chen, Rahul Jain, YaoNan Zhang
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 $λ$ and a prescribed total leakage budget $\ell$, one complete one-bit oblivious transfer uses $Θ(\ell+\log^2λ)$ 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).
AI Summary
The paper asks whether post-quantum one-way functions suffice for simulation-secure oblivious transfer (OT) with untrusted quantum devices, without bounded quantum storage or sequential-attack restrictions. It constructs device-independent OT and bit commitment using trusted classical controllers and parallel Magic Square correlations, allowing arbitrary entanglement, non-IID behavior, and joint receiver measurements. For security parameter $\lambda$ and prescribed total leakage budget $\ell$, one complete one-bit OT uses $\Theta(\ell+\log^2\lambda)$ device coordinates in at most three single-use device windows, including commitment preprocessing. Security and correctness errors are negligible against quantum polynomial-time adversaries. The construction simultaneously tolerates fixed positive rates of independent honest coordinate faults and adaptive bidirectional quantum communication between laboratories; the leakage budget is shared across windows. Simulators are efficient, and security composes sequentially. One-window commitments yield coin tossing with abort; OT completeness yields classical multiparty computation with abort for a fixed number of parties under per-call admissibility conditions. The proofs combine code-based choice masking, a global audit, field-symbol error correction, and global Fourier analysis. A selector-aware Magic Square repetition bound is derived from a two-round anchored threshold theorem. Commitment extraction changes a classical code coset without changing device execution or leakage. The model requires isolated trusted storage, fresh batches that never communicate with other batches, and permanent device retirement. The ideal experiment retains access to the same honest device share through its prescribed interface. Corruption is static, classical interaction remains polynomial-round, and the fixed noise and leakage constants need not be practically useful.
We used OpenAI's ChatGPT interactively to assist with literature searches, exploring proof strategies, examining commitment assumptions and security simulations, identifying potential gaps and inconsistencies, drafting and revising the manuscript, and preparing the LaTeX source.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- v3: Improved robustness and leakage tolerance, now allowing constant rates of noise and leakage