标题:Multiparty Computation for Modulo Reduction without Bit-Decomposition and a Generalization to Bit-Decomposition
作者:Qiu, Chao Ning; Xu, Qiuliang
通讯作者:Xu, Q
作者机构:[Qiu, Chao Ning; Xu, Qiuliang] Shandong Univ, Sch Comp Sci & Technol, Jinan 250101, Peoples R China.
会议名称:16th International Conference on the Theory and Application of Cryptology and Information Security
会议日期:DEC 05-09, 2010
来源:ADVANCES IN CRYPTOLOGY - ASIACRYPT 2010
出版年:2010
卷:6477
页码:483-500
DOI:10.1007/978-3-642-17373-8_28
关键词:Multiparty Computation; Constant-Rounds; Modulo Reduction;; Generalization to Bit-Decomposition
摘要:Bit-decomposition, which is proposed by Damgard et al., is a powerful tool for multi-party computation (MPC). Given a sharing of secret a, it allows the parties to compute the sharings of the bits of a in constant rounds. With the help of bit-decomposition, constant-rounds protocols for various MPC problems can be constructed. However, bit-decomposition is relatively expensive, so constructing protocols for MPC problems without relying on bit-decomposition is a meaningful work. In multi-party computation, it remains an open problem whether the modulo reduction problem can be solved in constant; rounds without bit-decomposition.; In this paper, we propose a protocol for (public) modulo reduction without relying on bit-decomposition. This protocol achieves constant round complexity and linear communication complexity. Moreover, we show a generalized bit-decomposition protocol which can, in constant rounds, convert the sharing of secret a into the sharings of the digits of a, along with the sharings of the bits of every digit. The digits can be base-m for any m >= 2.
收录类别:CPCI-S;EI;SCOPUS
Scopus被引频次:11
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-78650804652&doi=10.1007%2f978-3-642-17373-8_28&partnerID=40&md5=4aa3c51c92385d3e90bbd79e17f9a43e
TOP