Performance of Practical Quantum Oblivious Key Distribution

• URL: http://arxiv.org/abs/2501.03973v1
• Date: Tue, 07 Jan 2025 18:24:06 GMT
• Title: Performance of Practical Quantum Oblivious Key Distribution
• Authors: Mariano Lemus, Peter Schiansky, Manuel Goulão, Mathieu Bozzio, David Elkouss, Nikola Paunković, Paulo Mateus, Philip Walther,
• Abstract summary: We propose a practical realization of randomized quantum oblivious transfer. We show that the protocol is secure under an indistinguishability-based notion of security.
• Score: 0.7528462379265576
• License:
• Abstract: Motivated by the applications of secure multiparty computation as a privacy-protecting data analysis tool, and identifying oblivious transfer as one of its main practical enablers, we propose a practical realization of randomized quantum oblivious transfer. By using only symmetric cryptography primitives to implement commitments, we construct computationally-secure randomized oblivious transfer without the need for public-key cryptography or assumptions imposing limitations on the adversarial devices. We show that the protocol is secure under an indistinguishability-based notion of security and demonstrate an experimental implementation to test its real-world performance. Its security and performance are then compared to both quantum and classical alternatives, showing potential advantages over existing solutions based on the noisy storage model and public-key cryptography.

Related papers

• Experimental Secure Multiparty Computation from Quantum Oblivious Transfer with Bit Commitment [13.244842672008811]
  Secure multiparty computation can be realized using oblivious transfer as a primitive function. We present an experimental implementation of a quantum-secure quantum oblivious transfer protocol. In our experiments, two banks can identify common suspicious accounts without disclosing any other data.
  arXiv  Detail & Related papers  (2024-11-07T09:29:12Z)
• (Quantum) Indifferentiability and Pre-Computation [50.06591179629447]
  Indifferentiability is a cryptographic paradigm for analyzing the security of ideal objects. Despite its strength, indifferentiability is not known to offer security against pre-processing attacks. We propose a strengthening of indifferentiability which is not only composable but also takes arbitrary pre-computation into account.
  arXiv  Detail & Related papers  (2024-10-22T00:41:47Z)
• Simulations of distributed-phase-reference quantum key distribution protocols [0.1398098625978622]
  Quantum key distribution protocols provide a secret key between two users with security guaranteed by the laws of quantum mechanics. We perform simulations on the Interconnect platform to characterise the practical implementation of these devices. We briefly describe and simulate some possible eavesdropping attempts, backflash attack, trojan-horse attack and detector-blinding attack exploiting the device imperfections.
  arXiv  Detail & Related papers  (2024-06-13T13:19:04Z)
• A Survey and Comparative Analysis of Security Properties of CAN Authentication Protocols [92.81385447582882]
  The Controller Area Network (CAN) bus leaves in-vehicle communications inherently non-secure. This paper reviews and compares the 15 most prominent authentication protocols for the CAN bus. We evaluate protocols based on essential operational criteria that contribute to ease of implementation.
  arXiv  Detail & Related papers  (2024-01-19T14:52:04Z)
• Is Vertical Logistic Regression Privacy-Preserving? A Comprehensive Privacy Analysis and Beyond [57.10914865054868]
  We consider vertical logistic regression (VLR) trained with mini-batch descent gradient. We provide a comprehensive and rigorous privacy analysis of VLR in a class of open-source Federated Learning frameworks.
  arXiv  Detail & Related papers  (2022-07-19T05:47:30Z)
• Demonstration of Entanglement-Enhanced Covert Sensing [3.516093069612194]
  We present the theory and experiment for entanglement-enhanced covert sensing. We show that entanglement offers a performance boost in estimating the imparted phase by a probed object. Our work is expected to create ample opportunities for quantum information processing at unprecedented security and performance levels.
  arXiv  Detail & Related papers  (2022-05-25T16:20:34Z)
• Decentralized Stochastic Optimization with Inherent Privacy Protection [103.62463469366557]
  Decentralized optimization is the basic building block of modern collaborative machine learning, distributed estimation and control, and large-scale sensing. Since involved data, privacy protection has become an increasingly pressing need in the implementation of decentralized optimization algorithms.
  arXiv  Detail & Related papers  (2022-05-08T14:38:23Z)
• NEQRX: Efficient Quantum Image Encryption with Reduced Circuit Complexity [2.7985570786346745]
  We propose an efficient implementation scheme for a quantum image encryption algorithm combining the generalized affine transform and logistic map. We achieve a remarkable 50% reduction in cost while maintaining security and efficiency.
  arXiv  Detail & Related papers  (2022-04-14T10:15:23Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Experimental quantum key distribution certified by Bell's theorem [0.0]
  cryptographic key exchange protocols traditionally rely on computational conjectures to provide security against eavesdropping attacks. quantum key distribution protocols provide information-theoretic security against such attacks. However, quantum protocols are subject to a new class of attacks exploiting implementation defects in the physical devices involved. We present here the experimental realisation of a complete quantum key distribution protocol immune to these vulnerabilities.
  arXiv  Detail & Related papers  (2021-09-29T17:52:48Z)
• Semantic Security for Quantum Wiretap Channels [68.24747267214373]
  We consider the problem of semantic security via classical-quantum and quantum wiretap channels. We use explicit constructions to transform a non-secure code into a semantically secure code, achieving capacity by means of biregular irreducible functions.
  arXiv  Detail & Related papers  (2020-01-16T09:55:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.