Nonmalleable encryption of quantum information

Investor logo

Warning

This publication doesn't include Faculty of Medicine. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

AMBAINIS Andris BOUDA Jan WINTER Andreas

Year of publication 2009
Type Article in Periodical
Magazine / Source Journal of Mathematical Physics
MU Faculty or unit

Faculty of Informatics

Citation
Field Informatics
Keywords quantum information processing; encryption; non-malleability; unitary k-design
Description We introduce the notion of nonmalleability 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., e-print arXiv:quant-ph/0606161], as opposed to normal encryption which is a unitary 1-design. Our other main results include a new proof of the lower bound of (d2-1)2+1 on the number of unitaries in a 2-design [Gross, et al., J. Math. Phys. 48, 052104 (2007)], which lends itself to a generalization to approximate 2-design. Furthermore, while in prime power dimension there is a unitary 2-design with <=d5 elements, we show that there are always approximate 2-designs with O(\epsilon-2d4 log d) elements.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info