期刊文献+

选择解承诺方案

Selective decommitment scheme
下载PDF
导出
摘要 将抵抗选择解承诺攻击的承诺方案简称为选择解承诺方案,这种方案是通常意义下承诺方案复合的例子.本文给出选择解承诺方案在安全多方计算模型下基于模拟的安全性定义,并证明了新定义与原始定义是等价的.本文证明二义性承诺方案能够满足我们定义的安全性,进而可以构成安全的选择解承诺方案. 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
  • 相关文献

参考文献16

  • 1Crescenzo G, Ishai Y, Ostrovsky R. Non-interactive and non-malleable commitment. In: Proceedings of the 30th Annual Symposium on Theory of Computing. ACM Press, 1998,141 - 150
  • 2Crescenzo G, Katz J, Ostrovsky R, et al. Efficient and non-interactive non-malleable commitments. In:Proceedings of EuroCrypt 2001. Springer-Verlag,2001,40 - 49
  • 3Even S, Goldreich O, Lempel A. A randomized protocol for signing contracts. Communication of the ACM, 1985,28(6):637- 647
  • 4Goldreich O, Micali S, Wigderson A. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 1991,38( 1 ) : 691 - 729
  • 5Goldreich O, Micali S, Wigderson A. How to play any mental game. in:Proceedings of 19th STOC. ACM Press, 1987,218- 229
  • 6Dwork C, Naor M, Reiugold O, et al. Magic functions. In: 40th Annual Symposium on Foundations of Computer Science. IEEE Computer Society,1999,523 - 534
  • 7Canetti R, Fischlin M. Universally composable commitments. In :Advances in Cryptology-CRYPTO 2001. Springer-vedag,2001,19 - 40
  • 8Canetti R. Security and composition of multi-party cryptographic protocols. Journal of Cryptology, 2000,13( 1 ) : 143 - 202
  • 9Canetti R. Universal composable security: A new paradigm for cryptographic protocoh. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science. IEEE Computer Society,2001,136- 145
  • 10Canetti R,Lindell Y,Ostrovsky R, et al. Universally Composable Tram-party and Multi-party Secure Computation. In: Proceedings of Thirty-Fourth Annual ACM Symposium on Theory of Computing. ACM Press,2002,494 - 503

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部