摘要
将抵抗选择解承诺攻击的承诺方案简称为选择解承诺方案,这种方案是通常意义下承诺方案复合的例子.本文给出选择解承诺方案在安全多方计算模型下基于模拟的安全性定义,并证明了新定义与原始定义是等价的.本文证明二义性承诺方案能够满足我们定义的安全性,进而可以构成安全的选择解承诺方案.
In this paper, a commitment scheme against selective decommitment attacking was named as a selective decommitment scheme which was composition of general bit commitment schemes. In the secure two party computation-model, we proposed a new definition for selective decommitment scheme which was shown equivalent to the original one. Another main result was composition of bit equivocable commitment scheme satisfied with our new definition and could be composed to a secure selective decommitment scheme.
出处
《中国科学院研究生院学报》
CAS
CSCD
2007年第1期106-113,共8页
Journal of the Graduate School of the Chinese Academy of Sciences
基金
国家自然科学基金(90304013)
国家高技术研究与发展计划(863)(2003AA144151)资助
关键词
选择解承诺方案
二义性
安全多方计算
密码学
selective decommitment scheme,equivocable, secure multi-party computation, cryptography