Towards Unclonable Cryptography in the Plain Model
arxiv(2023)
摘要
By leveraging the no-cloning principle of quantum mechanics, unclonable
cryptography enables us to achieve novel cryptographic protocols that are
otherwise impossible classically. Two most notable examples of unclonable
cryptography are quantum copy-protection and unclonable encryption. Most known
constructions rely on the quantum random oracle model (as opposed to the plain
model). Despite receiving a lot of attention in recent years, two important
open questions still remain: copy-protection for point functions in the plain
model, which is usually considered as feasibility demonstration, and unclonable
encryption with unclonable indistinguishability security in the plain model. A
core ingredient of these protocols is the so-called monogamy-of-entanglement
(MoE) property. Such games allow quantifying the correlations between the
outcomes of multiple non-communicating parties sharing entanglement in a
particular context. Specifically, we define the games between a challenger and
three players in which the first player is asked to split and share a quantum
state between the two others, who are then simultaneously asked a question and
need to output the correct answer.
In this work, by relying on previous works of Coladangelo, Liu, Liu, and
Zhandry (Crypto'21) and Culf and Vidick (Quantum'22), we establish a new MoE
property for subspace coset states, which allows us to progress towards the
aforementioned goals. However, it is not sufficient on its own, and we present
two conjectures that would allow first to show that copy-protection of point
functions exists in the plain model, with different challenge distributions
(including arguably the most natural ones), and then that unclonable encryption
with unclonable indistinguishability security exists in the plain model. We
believe that our new MoE to be of independent interest, and it could be useful
in other applications as well.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要