Quantum Private Query (QPQ) is an unconditional secure mistrustful cryptographic primitive which is assumed to be a probabilistic version of the Oblivious Transfer (OT) schemes or an imperfect version of Symmetric Private Information Retrieval (SPIR) schemes. Recently, Maitra et al. (Phys. Rev. A, 2017) identified that the B92 QKD-based QPQ scheme proposed by Yang et al. (Quant. Inf. Process., 2014) is vulnerable whenever the devices involved in that scheme are dubious and to improve the overall security, they suggested a semi-Device Independent (DI) proposal for that QPQ scheme by introducing a local test at the server's end. In this work, we overcome the limitation of the Maitra et al. proposal by removing trustworthiness from all the (involved) devices, and suggest a full DI proposal for the Yang et al. scheme, exploiting a proper self-testing mechanism of observables along with the local version of the tilted CHSH game. We compare the performance of our proposal with a recent full DI-QPQ scheme (arxiv 1901.03042) and discuss their relative advantages. Additionally, we present a DI proposal for a modified version of the Yang et al. scheme, enabling the client to retrieve maximum raw key bits during the oblivious key generation phase. We evaluate the security of all our proposals with a formal analysis.
Abstract We present a device-independent protocol for oblivious transfer (DIOT) and analyse its security under the assumption that the receiver’s quantum storage is bounded during protocol execution and that the device behaves independently and identically in each round. We additionally require that, for each device component, the input corresponding to the choice of measurement basis, and the resulting output, is communicated only with the party holding that component. Our protocol is everlastingly secure and, compared to previous DIOT protocols, it is less strict about the non-communication assumptions that are typical from protocols that use Bell inequality violations; instead, the device-independence comes from a protocol for self-testing of a single (quantum) device which makes use of a post-quantum computational assumption.
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
ℓ, one complete one-bit oblivious transfer uses
Θ(ℓ+log2λ) 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).