摘要
现有的门限多秘密共享方案中,大多数存在着参与者的秘密份额由秘密中心生成、具有固定的门限值、需要安全通道、有固定的庄家或秘密中心(Dealer)等安全缺陷问题。为了解决这些问题,本文中提出了一种分布式动态(t,n)门限多秘密共享方案。此方案具有如下特点:1)参与者的秘密份额由自己选取;2)不需建立安全信道;3)无固定庄家或秘密中心(Dealer),每个参与者都可以做秘密分发者进行多秘密的分发,而且在分发、恢复、更新和验证等操作时能一次完成;4)能方便的增加或删除参与共享的成员;5)参与者之间能有效地检测和识别其成员的欺骗行为;因而具有较高的安全性和实用性。
In the most present threshold multisecret sharing scheme,there were some problems such as each participant's shadow was generated by the dealer,aptotic threshold,need of the secure channels. To overcome these problems,it was proposed that a distributed dynamic(t,n) threshold multi-secret sharing scheme in this paper,This scheme has the following properties:1) Each participant selected his shadow by himself;2) There was no secure channel 3) There was no aptotic dealer,each participant may be dealer to distri...
出处
《微计算机信息》
北大核心
2008年第6期225-227,共3页
Control & Automation
基金
国家863计划(2006AA01Z440)
关键词
多秘密共享
离散对数
动态门限
拉格朗日插值公式
Multi-secret sharing
discrete logarithm
dynamic threshold
Lagrange interpolation formula
