Unforgeable Quantum Encryption
Unforgeable Quantum Encryption
复制标题
DOI：
10.1007/978-3-319-78372-7_16
复制
发表时间：
2017-09
期刊：
影响因子：
--
通讯作者：
G. Alagic;Tommaso Gagliardoni;Christian Majenz
中科院分区：
文献类型：
--
作者：
G. Alagic;Tommaso Gagliardoni;Christian Majenz
我们研究了在对手存在的情况下加密和认证量子数据的问题，使选择的明文和选择的密文查询自适应。在这种情况下，安全游戏通常使用字符串复制和比较来检测对抗性作弊。从量子角度讲，这种方法违反了“不可克隆”原则。我们开发了新技术来克服这个问题：我们使用纠缠来检测作弊，并依靠最新的结果来表征量子加密方案。我们给出了(i)密文不可伪造性，（ii）自适应选择密文攻击下的不可区分性，以及（iii）认证加密的定义。每个定义对经典背景的限制至少与相应的经典概念一样强烈：(i)意味着，（ii）意味着，（iii）意味着。我们所有的新概念也隐含着隐私。结合一次性认证和经典伪随机，我们为每一种新的安全概念构建了对称密钥量子加密方案，并提供了几个分离的例子。在此过程中，我们还给出了一次性量子认证的新定义，它与所有以前的方法不同，验证密文而不是明文。
We study the problem of encrypting and authenticating quantum data in the presence of adversaries making adaptive chosen plaintext and chosen ciphertext queries. Classically, security games use string copying and comparison to detect adversarial cheating in such scenarios. Quantumly, this approach would violate no-cloning. We develop new techniques to overcome this problem: we use entanglement to detect cheating, and rely on recent results for characterizing quantum encryption schemes. We give definitions for (i) ciphertext unforgeability, (ii) indistinguishability under adaptive chosen-ciphertext attack, and (iii) authenticated encryption. The restriction of each definition to the classical setting is at least as strong as the corresponding classical notion: (i) implies, (ii) implies, and (iii) implies. All of our new notions also implyprivacy. Combining one-time authentication and classical pseudorandomness, we construct symmetric-key quantum encryption schemes for each of these new security notions, and provide several separation examples. Along the way, we also give a new definition of one-time quantum authentication which, unlike all previous approaches, authenticates ciphertexts rather than plaintexts.