Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
复制标题
自适应安全、通用可组合、恒定轮次多方计算
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
V. Rao
中科院分区：
文献类型：
--
作者：
Dana Dachman;Jonathan Katz;V. Rao
具有自适应安全性的加密协议确保了安全性能够抵御对手，后者可以在协议进行过程中甚至在协议完成后动态确定要破坏哪些方。在所有各方都可能被破坏，且不假设安全擦除的情况下，设计具有恒定轮次自适应安全性的安全计算协议一直是一个悬而未决的问题。
Cryptographic protocols with adaptive security ensure that security holds against an adversary who can dynamically determine which parties to corrupt as the protocol progresses—or even after the protocol is finished. In the setting where all parties may potentially be corrupted, and secure erasure is not assumed, it has been a long-standing open question to design secure-computation protocols with adaptive security running in constant rounds.