具有认证删除的可组合安全设备无关加密
Composably secure device-independent encryption with certified deletion
AI总结：
本文在设备无关场景下研究具有认证删除的加密任务，基于魔方非局域博弈的并行DIQKD协议构建ECD方案，并通过证明两轮非局域博弈的并行重复定理实现任意长消息的可组合认证删除安全性。
摘要：
我们研究由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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
