On the (Im)plausibility of Public-Key Quantum Money from Collision-Resistant Hash Functions

• URL: http://arxiv.org/abs/2301.09236v1
• Date: Mon, 23 Jan 2023 00:44:54 GMT
• Title: On the (Im)plausibility of Public-Key Quantum Money from Collision-Resistant Hash Functions
• Authors: Prabhanjan Ananth, Zihan Hu, Henry Yuen
• Abstract summary: We present the first black-box separation of quantum money and cryptographic primitives. Specifically, we show that collision-resistant hash functions cannot be used as a black-box to construct public-key quantum money schemes.
• Score: 6.164147034988822
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Public-key quantum money is a cryptographic proposal for using highly entangled quantum states as currency that is publicly verifiable yet resistant to counterfeiting due to the laws of physics. Despite significant interest, constructing provably-secure public-key quantum money schemes based on standard cryptographic assumptions has remained an elusive goal. Even proposing plausibly-secure candidate schemes has been a challenge. These difficulties call for a deeper and systematic study of the structure of public-key quantum money schemes and the assumptions they can be based on. Motivated by this, we present the first black-box separation of quantum money and cryptographic primitives. Specifically, we show that collision-resistant hash functions cannot be used as a black-box to construct public-key quantum money schemes where the banknote verification makes classical queries to the hash function. Our result involves a novel combination of state synthesis techniques from quantum complexity theory and simulation techniques, including Zhandry's compressed oracle technique.

Related papers

• Anonymous Public-Key Quantum Money and Quantum Voting [15.80411915665245]
  We develop the formal definitions of privacy for quantum money schemes. We then construct the first public-key quantum money schemes that satisfy these security notions. We show that the no-cloning principle, a result of quantum mechanics, allows us to construct schemes, with security guarantees that are classically impossible.
  arXiv  Detail & Related papers  (2024-11-07T07:21:28Z)
• Hard Quantum Extrapolations in Quantum Cryptography [9.214658764451348]
  We study the quantum analogues of the universal extrapolation task. We show that it is hard if quantum commitments exist, and it is easy for quantum space.
  arXiv  Detail & Related papers  (2024-09-25T00:09:42Z)
• Deploying hybrid quantum-secured infrastructure for applications: When quantum and post-quantum can work together [0.8702432681310401]
  Quantum key distribution is secure against unforeseen technological developments. Post-quantum cryptography is believed to be secure even against attacks with both classical and quantum computing technologies. Various directions in the further development of the full-stack quantum-secured infrastructure are also indicated.
  arXiv  Detail & Related papers  (2023-04-10T13:44:21Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• Another Round of Breaking and Making Quantum Money: How to Not Build It from Lattices, and More [13.02553999059921]
  We provide both negative and positive results for publicly verifiable quantum money. We propose a framework for building quantum money and quantum lightning. We discuss potential instantiations of our framework.
  arXiv  Detail & Related papers  (2022-11-22T04:17:32Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)
• A Quantum Money Solution to the Blockchain Scalability Problem [3.89615163169501]
  We give the first example of the use of smart contracts in a quantum setting. We describe a simple hybrid classical-quantum payment system whose main ingredients are a classical blockchain capable of handling stateful smart contracts. Our hybrid payment system employs quantum states as banknotes and a classical blockchain to settle disputes and to keep track of the valid serial numbers.
  arXiv  Detail & Related papers  (2020-02-27T09:40:18Z)

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.