Certified Randomness implies Secure Classical Position-Verification

• URL: http://arxiv.org/abs/2410.03982v2
• Date: Mon, 21 Oct 2024 17:57:34 GMT
• Title: Certified Randomness implies Secure Classical Position-Verification
• Authors: Omar Amer, Kaushik Chakraborty, David Cui, Fatih Kaleoglu, Charles Lim, Minzhao Liu, Marco Pistoia,
• Abstract summary: We provide a new generic compiler that can convert any single round proof of quantumness-based certified randomness protocol to a secure communication-based position verification scheme. We instantiate our compiler with a random circuit sampling (RCS)-based certified randomness protocol proposed by Aaronson and Hung (STOC 23)
• Score: 1.5391321019692432
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Liu et al. (ITCS22) initiated the study of designing a secure position verification protocol based on a specific proof of quantumness protocol and classical communication. In this paper, we study this interesting topic further and answer some of the open questions that are left in that paper. We provide a new generic compiler that can convert any single round proof of quantumness-based certified randomness protocol to a secure classical communication-based position verification scheme. Later, we extend our compiler to different kinds of multi-round proof of quantumness-based certified randomness protocols. Moreover, we instantiate our compiler with a random circuit sampling (RCS)-based certified randomness protocol proposed by Aaronson and Hung (STOC 23). RCS-based techniques are within reach of today's NISQ devices; therefore, our design overcomes the limitation of the Liu et al. protocol that would require a fault-tolerant quantum computer to realize. Moreover, this is one of the first cryptographic applications of RCS-based techniques other than certified randomness.

Related papers

• Practical hybrid PQC-QKD protocols with enhanced security and performance [44.8840598334124]
  We develop hybrid protocols by which QKD and PQC inter-operate within a joint quantum-classical network. In particular, we consider different hybrid designs that may offer enhanced speed and/or security over the individual performance of either approach.
  arXiv  Detail & Related papers  (2024-11-02T00:02:01Z)
• Towards efficient and secure quantum-classical communication networks [47.27205216718476]
  There are two primary approaches to achieving quantum-resistant security: quantum key distribution (QKD) and post-quantum cryptography (PQC) We introduce the pros and cons of these protocols and explore how they can be combined to achieve a higher level of security and/or improved performance in key distribution. We hope our discussion inspires further research into the design of hybrid cryptographic protocols for quantum-classical communication networks.
  arXiv  Detail & Related papers  (2024-11-01T23:36:19Z)
• Increasing Interference Detection in Quantum Cryptography using the Quantum Fourier Transform [0.0]
  We present two quantum cryptographic protocols leveraging the quantum Fourier transform (QFT) The foremost of these protocols is a novel QKD method that leverages this effectiveness of the QFT. We additionally show how existing quantum encryption methods can be augmented with a QFT-based approach to improve eavesdropping detection.
  arXiv  Detail & Related papers  (2024-04-18T21:04:03Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet [49.8449750761258]
  Quantum secure direct communication (QSDC) is provably secure and overcomes the threat of quantum computing. We will detail the associated point-to-point communication protocols and show how information is protected and transmitted.
  arXiv  Detail & Related papers  (2023-11-23T12:40:47Z)
• Entropy Accumulation under Post-Quantum Cryptographic Assumptions [4.416484585765028]
  In device-independent (DI) quantum protocols, the security statements are oblivious to the characterization of the quantum apparatus. We present a flexible framework for proving the security of such protocols by utilizing a combination of tools from quantum information theory.
  arXiv  Detail & Related papers  (2023-07-02T12:52:54Z)
• Practical quantum secure direct communication with squeezed states [55.41644538483948]
  We report the first table-top experimental demonstration of a CV-QSDC system and assess its security. This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
  arXiv  Detail & Related papers  (2023-06-25T19:23:42Z)
• From Auditable Quantum Authentication to Best-of-Both-Worlds Multiparty Quantum Computation with Public Verifiable Identifiable Abort [0.5076419064097734]
  We construct the first secure multiparty quantum computation with public verifiable identifiable abort (MPQC-PVIA) protocol. MPQC is the first quantum setting to provide Best-of-Both-Worlds (BoBW) security, which attains full security with an honest majority.
  arXiv  Detail & Related papers  (2022-11-03T09:12:48Z)
• On Certified Randomness from Fourier Sampling or Random Circuit Sampling [0.1631115063641726]
  Certified randomness has a long history in quantum information, with many potential applications. Aaronson proposed a novel public certified randomness protocol based on existing random circuit sampling (RCS) experiments. We study certified randomness in the quantum random oracle model (QROM)
  arXiv  Detail & Related papers  (2021-11-29T18:51:50Z)
• Quantum Secure Direct Communication with Mutual Authentication using a Single Basis [2.9542356825059715]
  We propose a new theoretical scheme for quantum secure direct communication (QSDC) with user authentication. The present protocol uses only one orthogonal basis of single-qubit states to encode the secret message. We discuss the security of the proposed protocol against some common attacks and show that no eaves-dropper can get any information from the quantum and classical channels.
  arXiv  Detail & Related papers  (2021-01-10T16:32:42Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)

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.