A robust and composable device-independent protocol for oblivious transfer using (fully) untrusted quantum devices in the bounded storage model

[2404.11283] A robust and composable device-independent protocol for oblivious transfer using (fully) untrusted quantum devices in the bounded storage model Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Quantum Physics arXiv:2404.11283 (quant-ph) [Submitted on 17 Apr 2024 ( v1 ), last revised 10 Apr 2026 (this version, v4)] Title: A robust and composable device-independent protocol for oblivious transfer using (fully) untrusted quantum devices in the bounded storage model Authors: Rishabh Batra , Sayantan Chakraborty , Rahul Jain , Upendra Kapshikar View a PDF of the paper titled A robust and composable device-independent protocol for oblivious transfer using (fully) untrusted quantum devices in the bounded storage model, by Rishabh Batra and Sayantan Chakraborty and Rahul Jain and Upendra Kapshikar View PDF HTML (experimental) Abstract: We present a robust and composable device-independent (DI) quantum protocol between two parties for oblivious transfer (OT) using Magic Square devices in the bounded storage model in which the (honest and cheating) devices and parties have no long-term quantum memory. After a fixed constant (real-world) time interval, referred to as DELAY, the quantum states decohere completely. The adversary (cheating party), with full control over the devices, is allowed joint (non-IID) quantum operations on the devices, and there are no time and space complexity bounds placed on its powers. The running time of the honest parties is polylog({\lambda}) (where {\lambda} is the security parameter). Our protocol has negligible (in {\lambda}) correctness and security errors and can be implemented in the NISQ (Noisy Intermediate Scale Quantum) era. By robustness, we mean that our protocol is correct even when devices are slightly off (by a small constant) from their ideal specification. This is an important property since small manufacturing errors in the real-world devices are inevitable. Our protocol is sequentially composable and, hence, can be used as a building block to construct larger protocols (including DI bit-commitment and DI secure multi-party computation) while still preserving correctness and security guarantees. None of the known DI protocols for OT in the literature are robust and secure against joint quantum attacks. This was a major open question in device-independent two-party distrustful cryptography, which we resolve. We prove a parallel repetition theorem for a certain class of entangled games with a hybrid (quantum-classical) strategy to show the security of our protocol. The hybrid strategy helps to incorporate DELAY in our protocol. This parallel repetition theorem is a main technical contribution of our work. Comments: Major improvement in the main result (security against non-IID devices) Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2404.11283 [quant-ph] (or arXiv:2404.11283v4 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2404.11283 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Sayantan Chakraborty [ view email ] [v1] Wed, 17 Apr 2024 11:46:36 UTC (66 KB) [v2] Wed, 23 Apr 2025 15:47:40 UTC (58 KB) [v3] Tue, 19 Aug 2025 02:09:12 UTC (60 KB) [v4] Fri, 10 Apr 2026 09:57:16 UTC (61 KB) Full-text links: Access Paper: View a PDF of the paper titled A robust and composable device-independent protocol for oblivious transfer using (fully) untrusted quantum devices in the bounded storage model, by Rishabh Batra and Sayantan Chakraborty and Rahul Jain and Upendra Kapshikar View PDF HTML (experimental) TeX Source view license Current browse context: quant-ph < prev | next > new | recent | 2024-04 References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

• Powerful Primitives in the Bounded Quantum Storage Model#1049560
• The security of practical quantum key distribution#6600
• Secure quantum key distribution against correlated leakage source.#1140
• Robust and leakage-resilient device-independent oblivious transfer in MiniQCryp#1160940
• Robust and leakage-resilient device-independent oblivious transfer in MiniQCryp#1156693