分布式信息的安全聚合:一组代理如何在间谍面前安全地共享秘密
Secure aggregation of distributed information: How a team of agents can safely share secrets in front of a spy
摘要:
我们认为,安全聚合的分布式信息(SADI),其中几个代理作为一个团队的信息分布在他们之间,通过一个众所周知的甲板上分布的代理,使他们每个人都知道只有她的卡建模的通用问题。代理人必须交换和汇总的信息,关于如何在他们之间分发的卡通过公共公告的不安全的通信渠道,截获的对手“窃听器”,在这样一种方式,对手不知道谁持有任何卡。我们提出了一个组合的协议,提供了一类SADI问题的直接解决方案,并开发了一种技术,SADI问题的迭代减少到较小的最终可直接解决。我们表明,我们的方法提供了一个解决方案,一类大的SADI问题,包括所有的SADI问题,足够大的尺寸和足够平衡的卡分布。
英文摘要:
We consider the generic problem of Secure Aggregation of Distributed Information (SADI), where several agents acting as a team have information distributed among them, modeled by means of a publicly known deck of cards distributed among the agents, so that each of them knows only her cards. The agents have to exchange and aggregate the information about how the cards are distributed among them by means of public announcements over insecure communication channels, intercepted by an adversary "eavesdropper", in such a way that the adversary does not learn who holds any of the cards. We present a combinatorial construction of protocols that provides a direct solution of a class of SADI problems and develop a technique of iterated reduction of SADI problems to smaller ones which are eventually solvable directly. We show that our methods provide a solution to a large class of SADI problems, including all SADI problems with sufficiently large size and sufficiently balanced card distributions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。