期刊文献+

普适复合水银承诺方案

Universally Composable Mercurial Commitment Scheme
下载PDF
导出
摘要 水银承诺方案是一般承诺方案的一种有趣变形.水银承诺方案中增加了模糊公开阶段,模糊公开阶段不要求绑定性但是不能与真实的公开阶段冲突.普适复合安全性基本框架最早由Canetti等人提出.普适复合能够保证更高等级的安全性,比如满足普适复合性质即能实现并发安全、自适应安全以及非延展安全等等.文中提出一种普适复合水银承诺方案的构造并且在公共参数模型中证明其安全性.文中的结论一方面深化了水银承诺方案的研究,另一方面回答了Gennaro和Micali提出的一个公开问题. A mercurial commitment scheme is an interesting variation of a regular commitment scheme, which extends to allow for a soft decommit stage. The soft decommitments are not binding but can not conflict with the true decommmitments. The original application of mercurial commitment is to construct zero knowledge sets. The universally composable framework initiated by Canetti is very useful due to its ensuring stronger securities such as concurrent security, adaptive security, non-malleability, etc. This paper proposes a universally composable mercurial commitment scheme and proves its security in the common reference string (CRS) model. On one hand, the research on mercurial commitment scheme is deepened, on the other hand the result answers an open problem presented by Gennaro and Micali.
出处 《计算机学报》 EI CSCD 北大核心 2008年第9期1653-1660,共8页 Chinese Journal of Computers
基金 国家自然科学基金(60673073) 国家"八六三"高技术研究发展计划项目基金(2006AA01Z427) 国家"九七三"重点基础研究发展规划项目基金(2007CB311201 2007CB311202) 中国科学院研究生院院长基金(065001G)资助~~
关键词 普适复合 水银承诺 universally composable mercurial commitment
  • 引文网络
  • 相关文献

参考文献10

  • 1Chase M et al. Mercurial commitment with applications to zero-knowledge sets//Proceedings of the EUROCRYPT'05. Aarhus, Denmark, 2005: 422-439
  • 2Catalano D, Dodis Y, Visconti I. Mercurial commitments: Minimal assumptions and efficient constructions//Proceedings of the TCC 2006. New York, USA, 2006:120-144
  • 3Micali S, Rabin M, Kilian J. Zero-knowledge sets//Proceedings of the 44th FOCS. Cambridge, MA, USA, 2003:80-91
  • 4Gennaro R, Micali S. Independent zero-knowledge Sets// Proceedings of the ICALP 2006. Venice, Italy, 2006:34-45
  • 5Canetti R. Universally composable security.. A new paradigm for cryptographic protocols//Proceedings of the 42nd FOCS. Las Vegas, Nevada, 2001:136-145
  • 6Goldreich O, Micali S, Wigderson A. How to play any mental game or a completness theorem for protocols with honest majority//Proceedings of the 19th Symposium on the Theory of Computing. New York, USA, 1987:218-229
  • 7Canetti R, Fischlin M. Universally composable commitments//Proceedings of the CRYPTO'01. California, USA, 2001:19-40
  • 8Canetti R, Lindell Y, Oatrovsky R, Sahai A. Universally composable two-party and multi-party secure computation// Proceedings of the STOC 2002. Quebec, Canada, 2002:494- 503
  • 9Goldwasser S, Micali S, Rivest R. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 1988, 17(2): 281-308
  • 10Goldreich O. Foundations of Cryptography (Volume 2, Basic Applications ). Cambridge, UK: Cambridge University Press, 2004
;
使用帮助 返回顶部