Converses For Secret Key Agreement and Secure Computing
Converses For Secret Key Agreement and Secure Computing
复制标题
DOI：
10.1109/tit.2015.2457926
复制
发表时间：
2014-04
影响因子：
2.5
通讯作者：
Himanshu Tyagi;Shun Watanabe
中科院分区：
文献类型：
--
作者：
Himanshu Tyagi;Shun Watanabe
我们认为信息理论的秘密密钥（SK）协议和安全的功能计算多方观察相关的数据，访问一个交互式的公共通信信道。我们的主要结果是上界的SK长度，这是使用减少二进制假设检验多方SK协议。在此基础上，我们得到了新的多方SK协议的转换。此外，我们推导出的不经意传输问题和比特承诺问题的匡威结果，将它们与SK协议。最后，我们得出了一个必要条件的可行性安全计算的可信方，寻求计算他们的集体数据的函数，使用交互式的公共通信，本身不放弃的功能的值。在许多情况下，我们加强和改进以前已知的匡威界。我们的结果是单次的，并且只使用相关观测的给定联合分布。对于相关观测由独立和同分布（在时间上）序列组成的情况，我们得到了强版本的先前已知的转换。
We consider information theoretic secret key (SK) agreement and secure function computation by multiple parties observing correlated data, with access to an interactive public communication channel. Our main result is an upper bound on the SK length, which is derived using a reduction of binary hypothesis testing to multiparty SK agreement. Building on this basic result, we derive new converses for multiparty SK agreement. Furthermore, we derive converse results for the oblivious transfer problem and the bit commitment problem by relating them to SK agreement. Finally, we derive a necessary condition for the feasibility of secure computation by trusted parties that seek to compute a function of their collective data, using an interactive public communication that by itself does not give away the value of the function. In many cases, we strengthen and improve upon previously known converse bounds. Our results are single-shot and use only the given joint distribution of the correlated observations. For the case when the correlated observations consist of independent and identically distributed (in time) sequences, we derive strong versions of previously known converses.