论文标题

与经过认证的删除相结合的安全无关加密

Composably secure device-independent encryption with certified deletion

论文作者

Kundu, Srijita, Tan, Ernest Y. -Z.

论文摘要

我们研究了Broadbent和Islam(2020)引入的认证删除(ECD)的加密任务,但在独立于设备的环境中:我们表明即使诚实的当事方不信任他们的量子设备,也可以实现此任务。此外,我们以合并的方式为ECD任务定义安全性,并表明我们的ECD协议满足导致可组合安全性的条件。我们的协议基于与设备无关的量子密钥分布(DIQKD),尤其是基于Jain,Miller和Shi(2020)给出的基于魔术方形非本地游戏的并行DIQKD协议。为了获得经过认证的删除,我们使用Fu和Miller(2018)观察到的魔法方形游戏的属性,即游戏的两轮变体可用于证明单个随机位的删除。为了获得该属性任意长消息的认证删除安全性,我们证明了两轮非本地游戏的并行重复定理,这可能具有独立的兴趣。

We study the task of encryption with certified deletion (ECD) introduced by Broadbent and Islam (2020), but in a device-independent setting: we show that it is possible to achieve this task even when the honest parties do not trust their quantum devices. Moreover, we define security for the ECD task in a composable manner and show that our ECD protocol satisfies conditions that lead to composable security. Our protocol is based on device-independent quantum key distribution (DIQKD), and in particular the parallel DIQKD protocol based on the magic square non-local game, given by Jain, Miller and Shi (2020). To achieve certified deletion, we use a property of the magic square game observed by Fu and Miller (2018), namely that a two-round variant of the game can be used to certify deletion of a single random bit. In order to achieve certified deletion security for arbitrarily long messages from this property, we prove a parallel repetition theorem for two-round non-local games, which may be of independent interest.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源