Quantum one-time programs. (Extended abstract)
From MaRDI portal
Abstract: One-time programs are modelled after a black box that allows a single evaluation of a function, and then self-destructs. Because software can, in principle, be copied, general one-time programs exists only in the hardware token model: it has been shown that any function admits a one-time program as long as we assume access to physical devices called one-time memories. Quantum information, with its well-known property of no-cloning, would, at first glance, prevent the basic copying attack for classical programs. We show that this intuition is false: one-time programs for both classical and quantum maps, based solely on quantum information, do not exist, even with computational assumptions. We complement this strong impossibility proof by an equally strong possibility result: assuming the same basic one-time memories as used for classical one-time programs, we show that every quantum map has a quantum one-time program that is secure in the universal composability framework. Our construction relies on a new, simpler quantum authentication scheme and corresponding mechanism for computing on authenticated data.
Recommendations
Cited in
(39)- Finite-data-size study on practical universal blind quantum computation
- A quantum evolving secret sharing scheme
- Secure software leasing
- Quantum multi-secret sharing via trap codes and discrete quantum walks
- Round efficient secure multiparty quantum computation with identifiable abort
- Unclonable polymers and their cryptographic applications
- Verification of quantum computation: an overview of existing approaches
- Fault-tolerant quantum error correction code preparation in UBQC
- Quantum public-key encryption schemes based on conjugate coding
- Public verifiable measurement-only blind quantum computation based on entanglement witnesses
- Unclonable encryption, revisited
- Programmable Hamiltonian for one-way patterns
- Single-shot security for one-time memories in the isolated qubits model
- Practical sharing of quantum secrets over untrusted channels
- Computational Security of Quantum Encryption
- Efficient simulation for quantum message authentication
- Optimised resource construction for verifiable quantum computation
- Building one-time memories from isolated qubits (extended abstract)
- One-time programs with limited memory
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Robustness and device independence of verifiable blind quantum computing
- Quantum authentication with key recycling
- scientific article; zbMATH DE number 7651033 (Why is no real title available?)
- Quantum ciphertext authentication and key recycling with the trap code
- Another round of breaking and making quantum money: how to not build it from lattices, and more
- One-time programs from commodity hardware
- Practical multi-party quantum homomorphic encryption
- Cloning games: a general framework for unclonable primitives
- On the (im)plausibility of public-key quantum money from collision-resistant hash functions
- Efficient quantum multi-authority attribute-based encryption and generalizations
- A modular approach to unclonable cryptography
- Zero-knowledge proof systems for QMA
- One-time memories secure against depth-bounded quantum circuits
- Quantum delegation with an off-the-shelf device
- Authentication of continuous-variable quantum messages
- Publicly verifiable quantum homomorphic encryption based on quantum remote control
- An efficient combination of quantum error correction and authentication
- Consumable data via quantum communication
- Quantum cryptography beyond quantum key distribution
This page was built for publication: Quantum one-time programs. (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849405)
