摘要
针对现有多秘密共享体制不能预防参与者和秘密分发者之间的相互欺骗攻击问题,提出一种新的可验证的门限多秘密共享体制.该体制的安全性是基于Shamir的秘密共享体制和ECIES加密算法的安全性以及椭圆曲线离散对数问题的求解困难性.参与者的秘密份额由每个参与者自己选取,其秘密份额信息可以通过公开信道发送给秘密分发者;每个参与者的秘密份额可以用于多次秘密共享过程而无须进行更新;能够预防参与者和秘密分发者之间的相互欺骗攻击.
As the further expansion of the multiple secret sharing scheme, the multi-secret sharing scheme can share any number of secrets in one sharing session. In order to prevent the secret dealer＇s and the participant＇s cheating attacks like those in the existing multi-secret sharing schemes, a new verifiable threshold multi-secret sharing scheme is proposed. Each participant＇s secret shadow is selected by himself and it can he transmitted to the secret dealer over a public channel The shadow can he used in multiple sharing sessions without the need to be updated. At the same time, it is allowed to check whether each cooperative participant and the secret dealer have taken a legal action or not. The security of the proposed scheme is based on that of Shamir＇s secret sharing scheme and that of the ECIES cryptosystem, and the difficulty in solving the elliptic curve discrete logarithm.
出处
《西安电子科技大学学报》
EI
CAS
CSCD
北大核心
2008年第1期148-151,共4页
Journal of Xidian University
基金
国家自然科学基金资助(60672112)
陕西省自然科学基金资助(2007F37)
中国博士后科学基金资助(20060401008)
关键词
数据安全
秘密共享
椭圆曲线
data security
secret sharing
elliptic curve
