Optimal Encryption of Quantum Bits
arXiv:quant-ph/0003059 · doi:10.1103/PhysRevA.67.042317
Abstract
We characterize the complete set of protocols that may be used to securely encrypt n quantum bits using secret and random classical bits. In addition to the application of such quantum encryption protocols to quantum data security, our framework allows for generalizations of many classical cryptographic protocols to quantum data. We show that the encrypted state gives no information without the secret classical data, and that 2n random classical bits are the minimum necessary for informationally secure quantum encryption. Moreover, the quantum operations are shown to have a surprising structure in a canonical inner product space. This quantum encryption protocol is a generalization of the classical one time pad concept. A connection is made between quantum encryption and quantum teleportation, and this allows for a new proof of optimality of teleportation.
12 pages, LaTeX. Replacement fixes incorrect reference [15], otherwise identical
References in corpus (2)
Cited by in corpus (91)
- On mutually unbiased bases
- A new proof for the existence of mutually unbiased bases
- Universal blind quantum computation
- Security in Quantum Cryptography
- Randomizing quantum states: Constructions and applications
- Unconditionally verifiable blind computation
- Authentication of Quantum Messages
- Quantum Cryptography Beyond Quantum Key Distribution
- Blind quantum computation protocol in which Alice only makes measurements
- Cryptanalysis of the arbitrated quantum signature protocols
- General paradigm for distilling classical key from quantum states
- Remote preparation of quantum states
- Applications of single-qubit rotations in quantum public-key cryptography
- Security problem on arbitrated quantum signature schemes
- Comment on "Arbitrated quantum-signature scheme"
- Symmetric quantum fully homomorphic encryption with perfect security
- Locking entanglement measures with a single qubit
- Quantum fully homomorphic encryption scheme based on universal quantum circuit
- On the "Security analysis and improvements of arbitrated quantum signature schemes"
- How to reuse a one-time pad and other notes on authentication, encryption and protection of quantum information
- Diagonal quantum circuits: their computational power and applications
- Approximate Randomization of Quantum States With Fewer Bits of Key
- Quantum Encryption of superposition states with Quantum Permutation Pad in IBM Quantum Computers
- Computational Security of Quantum Encryption
- Relational Proofs for Quantum Programs
- The quantum one-time pad in the presence of an eavesdropper
- Catalytic quantum randomness
- Private Quantum Channels and the Cost of Randomizing Quantum Information
- Generating Haar-uniform Randomness using Stochastic Quantum Walks on a Photonic Chip
- Additivity and Distinguishability of Random Unitary Channels
- Secure assisted quantum computation
- Private algebras in quantum information and infinite-dimensional complementarity
- A quantum encryption design featuring confusion, diffusion, and mode of operation
- Quantum cryptography beyond key distribution: theory and experiment
- Entangling and assisted entangling power of bipartite unitary operations
- Private Quantum Subsystems
- Diagonal-unitary 2-designs and their implementations by quantum circuits
- Quantum signature scheme with single photons
- Cryptography in a Quantum World
- The Universal Composable Security of Quantum Message Authentication with Key Recyling
- Quantum messages with signatures forgeable in arbitrated quantum signature schemes
- Optimizing Teleportation Cost in Distributed Quantum Circuits
- Quantum Encryption and Generalized Quantum Shannon Impossibility
- Quantum seals
- Quantum Subsystems: Exploring the Complementarity of Quantum Privacy and Error Correction
- Quantum Privacy and Schur Product Channels
- Private quantum decoupling and secure disposal of information
- Continuous variable private quantum channel
- Randomness for quantum channels:Genericity of catalysis and quantum advantage of uniformness
- On the Power of Quantum Encryption Keys
- Computational Distinguishability of Quantum Channels
- Quantum election scheme based on anonymous quantum key distribution
- Oblivious transfer based on single-qubit rotations
- Public Quantum Communication and Superactivation
- Private Quantum Subsystems and Quasiorthogonal Operator Algebras
- A method of enciphering quantum states
- Quantum authentication with unitary coding sets
- A practical quantum encryption protocol with varying encryption configurations
- Delayed choice relativistic quantum bit commitment with arbitrarily long commitment time
- Quantum k-means algorithm based on Trusted server in Quantum Cloud Computing
- Quantum teleportation in the commuting operator framework
- Entropically secure encryption with faster key expansion
- Quantum Digital Signature based on Quantum One-way Functions
- Quantum cryptography -- an information theoretic security
- Forgeable quantum messages in arbitrated quantum signature schemes
- Quantum McEliece public-key encryption scheme
- Simpler Quantum Counting
- Implementing Semiclassical Szegedy Walks in Classical-Quantum Circuits for Homomorphic Encryption
- Testing quantum circuits and detecting insecure encryption
- Quantum no-key protocols for secret transmission of quantum and classical message
- A note on quantum McEliece public-key cryptosystem
- Quantum Complementarity and Operator Structures
- Security enhanced memory for quantum state
- Limits and restrictions of private quantum channel
- Private quantum codes: introduction and connection with higher rank numerical ranges
- Diagrammatic security proof for 8-state encoding
- Indistinguishability and semantic security for quantum encryption scheme
- Quantum public-key algorithms to encrypt and authenticate quantum messages with information-theoretic security
- Structure Theorem for Quantum Replacer Codes
- Nullspaces of Entanglement Breaking Channels and Applications
- Partial Blind Quantum Computation: A Framework for Selective Circuit Protection
- An efficient and provably secure arbitrated quantum signature scheme
- A Quantum Interpretation of Bunched Logic for Quantum Separation Logic
- Approximate Private Quantum Channels
- The Classification of Quantum Symmetric-Key Encryption Protocols
- Quantum deletion is possible via a partial randomization procedure
- On the Information of the Second Moments Between Random Variables Using Mutually Unbiased Bases
- Quantum Search on Encrypted Data Based on Quantum Homomorphic Encryption
- Quantum Private Broadcasting
- Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security
- Bit-oriented quantum public-key encryption