Nonmalleable encryption of quantum information

DOI10.1063/1.3094756MaRDI QIDQ3650492zbMATH OpenOpenAlexWikidataFDO

Authors Jan Bouda, Andreas Winter, Andris Ambainis

Publication date 14 December 2009

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0808.0353

zbMATH Keywords

information theoryquantum computingquantum cryptography

Mathematics Subject Classification ID

Other designs, configurations (05B30) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Abstract: We introduce the notion of "non-malleability" of a quantum state encryption scheme (in dimension d): in addition to the requirement that an adversary cannot learn information about the state, here we demand that no controlled modification of the encrypted state can be effected. We show that such a scheme is equivalent to a "unitary 2-design" [Dankert et al.], as opposed to normal encryption which is a unitary 1-design. Our other main results include a new proof of the lower bound of (d^2-1)^2+1 on the number of unitaries in a 2-design [Gross et al.], which lends itself to a generalization to approximate 2-design. Furthermore, while in prime power dimension there is a unitary 2-design with =< d^5 elements, we show that there are always approximate 2-designs with O(epsilon^{-2} d^4 log d) elements.

Recommendations

• Quantum non-malleability and authentication
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Unforgeable quantum encryption
• Quantum encryption and generalized Shannon impossibility
• Uncloneable encryption

Cites work

• A continuity property of the entropy density for spin lattice systems
• An operational approach to quantum probability
• Approximate Randomization of Quantum States With Fewer Bits of Key
• Completely positive linear maps on complex matrices
• Evenly distributed unitaries: On the structure of unitary designs
• Linear transformations which preserve trace and positive semidefiniteness of operators
• Nonmalleable Cryptography
• Optimality of private quantum channels
• Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
• Randomizing quantum states: constructions and applications
• Strong converse for identification via quantum channels
• Unconditionally Secure Key Distribution in Higher Dimensions by Depolarization

Cited in

(13)

• Unitary designs and codes
• Quantum cryptography over non-Markovian channels
• Quantum non-malleability and authentication
• Block encryption of quantum messages
• Efficient unitary designs with a system-size independent number of non-Clifford gates
• A method of enciphering quantum states
• Composite parameterization and Haar measure for all unitary and special unitary groups
• Invertible quantum operations and perfect encryption of quantum states
• Local random quantum circuits are approximate polynomial-designs
• On the explicit constructions of certain unitaryt-designs
• Quantum codes and irreducible products of characters
• Split-state non-malleable codes and secret sharing schemes for quantum messages
• On split-state quantum tamper detection

This page was built for publication: Nonmalleable encryption of quantum information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3650492)