Everlasting Multi-party Computation
Everlasting Multi-party Computation
复制标题
永恒的多方计算
DOI：
10.1007/s00145-018-9278-z
复制
发表时间：
2013
影响因子：
3
通讯作者：
Dominique Unruh
中科院分区：
文献类型：
--
作者：
Dominique Unruh
如果协议在执行后对计算无限的对手安全，则协议具有永久的安全性。这个模型表明，我们无法预测哪些加密方案会被破解，比如说，在协议执行几十年后。在经典密码学中，持久的安全性很难实现：即使使用可信设置（如公共引用字符串或签名卡），许多任务（如安全通信和遗忘传输）也无法通过持久的安全性实现。量子设置中的类似结果排除基于公共引用字符串的协议，但不排除使用签名卡的协议。我们定义了通用可组合性框架的一种变体——永久量子uc，并表明在该模型中，我们可以使用签名卡作为可信设置来实现安全通信和通用多方计算。
A protocol has everlasting security if it is secure against adversaries that are computationally unlimited after the protocol execution. This models the fact that we cannot predict which cryptographic schemes will be broken, say, several decades after the protocol execution. In classical cryptography, everlasting security is difficult to achieve: even using trusted setup like common reference strings or signature cards, many tasks such as secure communication and oblivious transfer cannot be achieved with everlasting security. An analogous result in the quantum setting excludes protocols based on common reference strings, but not protocols using a signature card. We define a variant of the Universal Composability framework, everlasting quantum-UC, and show that in this model, we can implement secure communication and general multi-party computation using signature cards as trusted setup.