论文标题:信息安全中的秘密共享研究
Study on Secret Sharing in Information Security
论文作者
论文导师 许春香,论文学位 硕士,论文专业 管理科学与工程
论文单位 西安电子科技大学,点击次数 100,论文页数 52页File Size937K
2007-01-01论文网 http://www.lw23.com/lunwen_38891152/
threshold secret sharing; vector space secret sharing; dynamic secret sharing; security
本文阐述了秘密共享体制的概念、研究现状及背景,并对秘密共享方案进行了安全性分析,提出了可能存在的一些安全隐患,针对这些安全隐患构造了安全秘密共享方案。此外,将证书及身份的思想应用到秘密共享方案中,提出了基于证书的动态矢量空间秘密共享方案及基于身份的动态门限秘密共享方案。 针对敌手的重恢复(Repeat-Recovery)攻击给出了一个预防欺诈的安全秘密共享方案。每个参与者对接收到的子秘密进行公式验证,以防止秘密分发者的不诚实。恢复秘密时,每个参与者从各自拥有的多个秘密对中任选一对提交,有效阻止了敌手窃取秘密或子秘密。 基于证书的动态秘密共享方案将每个参与者的证书公钥对应的秘密密钥作为子秘密。该方案中,秘密分发者不需要给任何参与者传递秘密信息,因而不需要安全通道。此方案是动态的,即可用来共享任意多个秘密,而不必修改参与者的子秘密。该体制的安全性是基于大数分解的困难性及离散对数的难解性。 在基于身份的密码体制的基础之上,提出了一个基于身份的动态门限秘密共享方案。该方案中,一群参与者利用密钥分发中心初始化建立的基于各自身份的私钥可以共享多个秘密。利用解离散对数和计算Diffie-Hellman问题的困难性防止敌手的欺诈行为,双线性对运算以及基于身份的密钥管理使得该方案简单易行。
This dissertation expatiates the concepts、research actualities and background of secret sharing system, analyses the security of secret sharing schemes, and puts forward some security hidden troubles that are likely to exist, then constructs secure secret sharing schemes in allusion to the security hidden troubles. Furthermore, the ideas of certificate and indentity are applied in secret sharing schemes, thus, dynamic secret sharing schemes based on certificate and based on identity are put forward. A secure secret sharing scheme that can resist cheating is presented in allusion to the adversaries’Repeat-Recovery attack. Each participant validates his received shadow by using a formula in order to prevent the dealer’s dishonesty. At the pooling time, each participant chooses and submits one pair of shadow among his many pairs at random, which holds back the adversaries’filching the secret or the shadows effectively. In dynamic secret sharing schemes based on certificate, each participant’s certificate public-key’s corresponding private-key is his shadow. The dealer need not transfer secret information to any participant, thus, safe channels are not needed. This system is dynamic, that is to say, multi-secrets can be shared when each participant’s shadow has no need to be modified. This system’s security is based on the difficulty of large number’s factoring and the intractability discrete logarithm problem. An ID-based dynamic threshold secret sharing scheme is proposed based on identity-based cryptography. In this scheme, a group of participants can use each ID-based private key initialized from Key Distribution Centre to share and resume different secrets. The difficulties of solving DLP and computing Diffie-Hellman problems can prevent cheaters’cheating behaviors, and bilinear pairings and ID-based key management makes this scheme operate simply.
|
