%0 Journal Article
%T A Daynamic (k,n)-threshold secret sharing scheme based on discrete logarithm<br>基于离散对数的动态(k,n)-门限方案
%A Liu Huanping
%A Ji Zhenzhou
%A Hu Mingzeng
%A Fang Binxing
%A Yang Yixian
%A <br>刘焕平
%A 季振洲
%A 胡铭曾
%A 方滨兴
%A 杨义先
%J 电子与信息学报
%D 2002
%I 
%X A dynamic (k,n)-threshold secret sharing scheme based on discrete logarithm is proposed in this paper. It can reconstruct the different system secrets for many times without any restriction. Any cheater can be checked out. When some participants' secret sharing values are revealed, they can be renewed without any effect on the others. It is convenient to add or to delete one or more participants. The system secret can be recovered with a parallel process.
%K Data safety
%K Cryptography
%K Secret sharing
%K Discrete logarithm<br>数据安全
%K 密码学
%K 秘密分布
%K 离散对数
%K 动态－门限方案
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=C1AA62569E873D85&yid=C3ACC247184A22C1&vid=B91E8C6D6FE990DB&iid=0B39A22176CE99FB&sid=44A4891E33BFF455&eid=69E4C201C13601F9&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=4&reference_num=8