Efficient General-Adversary Multi-Party Computation

Efficient General-Adversary Multi-Party Computation
复制标题

高效的一般对手多方计算

DOI：
--
复制
发表时间：
2013
期刊：
International Conference on the Theory and Application of Cryptology and Information Security
影响因子：
--
通讯作者：
Daniel Tschudi
Daniel Tschudi
中科院分区：
--
文献类型：
--
作者：
M. Hirt;Daniel Tschudi

文献摘要

被引文献

相似文献

安全多方计算(MPC)允许n个玩家的集合(数学{P})在破坏玩家子集的对手在场的情况下对函数f求值。在这篇文章中，我们考虑主动的，一般的对手，其特征是一个所谓的对手结构(数学{Z})，它列举了所有可能的腐败玩家的子集。特别是，对于小集合的玩家，一般对手比经典的门槛对手更好地捕捉现实世界的需求。
Secure multi-party computation (MPC) allows a set (mathcal{P}) of n players to evaluate a function f in presence of an adversary who corrupts a subset of the players. In this paper we consider active, general adversaries, characterized by a so-called adversary structure (mathcal{Z}) which enumerates all possible subsets of corrupted players. In particular for small sets of players general adversaries better capture real-world requirements than classical threshold adversaries.