Research on Verifiable Secret Sharing Based on Chinese Remainder Theorem

摘要：

A Verifiable Secret Sharing scheme is proposed which is based on Chinese Remainder Theorem and properties of modular arithmetic. In the scheme, secret shares are generated by the coordination of dealer and all participants, which can not only identify fraud among the participants, but also prevent from dealers cheating behavior. Secret shares can be verified by using properties of modular arithmetic in the scheme. Finally. the correctness of the verification formula and the security of the scheme are analyzed.

关键词： Verifiable Secret Sharing Chinese Remainder Theorem Discrete Logarithm Anti spoofing

作者: Zhengfeng Hou Qiming Chen Jianghong Han Liang Ding

作者单位: School of Computer and Information Hefei University of Technology Hefei, Anhui, China

会议类型: 国际会议

会议名称: 2010 International Conference on Information Security and Artificial Intelligence(2010年信息安全与人工智能国际会议 ISAI 2010)

会议地点: 成都

会议语种:英文

页码: 127-130

在线出版日期: 2010-12-17（万方平台首次上网日期，不代表论文的发表时间）