摘要
针对现有的门限秘密共享方案在处理参与者集合动态变化时灵活性差和许多多重秘密共享方案不能一次恢复出多个秘密(需要进行很多轮的计算)这两个缺点,提出了一个新的方案,给出了一个简单实用的La-grange插值的方法。该方案可以动态添加或删除参与者,无须重新分发子秘密,参与者的子秘密由自己选取和保存,可以在不安全的环境中传送;同时公开的只是子秘密的影子,子秘密可以重复再用,在秘密的恢复阶段可以一次恢复多个秘密。
Known threshold secret sharing schemes have limited flexibility when dealing with the dynamic joining and leaving of the participants. Many multiple secret sharing schemes can＇ t recover all the secrets in one time. Proposed a new dynamic muhi-secret sharing scheme and developed an easy utility method to solve the Lagrange interpolation . It was efficient for the scheme to solve the participants join or leave dynamically, without redistributing the subsecrets, and the subsecrets were kept secretly by the participants themselves. And it was the shadows of the subsecrets that were published. The subsecrets could be used repeatedly, and all the secrets could be recovered in one time.
出处
《计算机应用研究》
CSCD
北大核心
2008年第2期516-517,520,共3页
Application Research of Computers
基金
国家自然科学基金资助项目(10571113)
陕西省自然科学基金研究计划项目(2004A114)
