Public Verifiable Threshold Decryption Scheme Without Trusted Center

摘要：

The paper proposes a publicly verifiable threshold decryption scheme with no center based on the situation that a trust center does not exist in many special occasions. The scheme asks decryption member for submitting commitment in the decryption process in order to make sure the identity is publicly verifiable. Moreover, the scheme has several advantages such as protecting the shadow without revealing and the members can be deleted dynamically.

关键词： public verification decryption independently commitment cheat-proof

作者: Xin Lv Congming Wang

作者单位: College of Computer and Information National Engineering Research Center of Water; Resources Efficie YiShuSi Water Resources Administrative Bureau Huaihe River Commission of the Ministry of Water Resou

会议类型: 国际会议

会议名称: The Ninth International Conference on Grid and Cloud Computing(第九届网格与云计算国际学术会议 GCC 2010)

会议地点: 南京

会议语种:英文

页码: 478-482

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