期刊文献+

多陷门水银承诺方案(英文) 被引量:1

Multi-trapdoor mercurial commitment scheme
下载PDF
导出
摘要 多陷门承诺方案是指一个陷门承诺族,对于整个族有一个主陷门,族中的每一个承诺方案有各自对应的具体陷门.水银承诺方案是通常意义下承诺方案的一种变形,对承诺方案要求的绑定性质有显著的放松.应用上述2个传统承诺方案的变形给出多陷门水银承诺方案的定义,并构造出基于强Diffie-Hellman假设的多陷门水银承诺方案. We introduce a new notion of multi-trapdoor mercurial commitment scheme which is a combination of multi-trapdoor commitment and(trapdoor)mercurial commitment.Multi-trapdoor commitment is a family of trapdoor commitments which admits a master trapdoor for the whole family and a specific trapdoor for every commitment in the family.Mercurial commitment allows for a noticeable relaxation of the strict binding property of conventional commitment.In our paper,we use the two interesting variation of regular commitments to define multi-trapdoor mercurial commitment and construct a multi-trapdoor mercurial commitment scheme based on the Strong Diffie Hellman Assumption.
出处 《中国科学院研究生院学报》 CAS CSCD 2008年第2期272-278,共7页 Journal of the Graduate School of the Chinese Academy of Sciences
基金 Supported by the National Nature Science Foundation of China(60673073) National 863 Project(2006AA01Z427) Foundation of Graduate University of the Chinese Academy of Sciences(065001G)
关键词 承诺方案 水银 多陷门 commitment,mercurial,multi-trapdoor
  • 引文网络
  • 相关文献

参考文献10

  • 1Goldreich 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
  • 2Goldreich O, Micali S, Wigderson A. How to play any mental game. In:Proceedings of the 19th ACM Symposium on Theory of Computing. ACM Press, 1987.218 - 229
  • 3Even S, Goldreich O, Lempel A. A randomized protocol for signing contracts. Communication of the ACM, 1985, 28(6) : 637 - 647
  • 4Chase M, Healy A, Lysyanskaya A, et al. Mercurial commitment with applications to zero-knowledge sets. In: Advances in Cryptology- EUROCRYPT 2005. Springer-Verlag, 2005.422 - 439
  • 5Micali S, Rabin M, Kilian J. Zero-knowledge sets. In: Proceedings of the 44th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, 2003.80 - 91
  • 6Catalano D, Dodis Y, Visconti I. Mercurial commitments: minimal assumptions and efficient constructions. In:The third Theory of Cryptography Conference TCC. Spinger-Vedag, 2006.120 - 144
  • 7Brassard G, Chaum D, Crepeau C. Minimum disclosure proofs of knowledge.Joutnal of Computer and System Sciences, 1988, 37(2):156- 189
  • 8Gennaro R. Multi-trapdoor commitments and their applications to non-malleable protocols. In: Advances in Cryptology-CRYPTO 2004. Springer-Verlag, 2004.220 - 236
  • 9Boneh D, Boyen X. Short signatures without random oracles. In: Advances in Cryptology-EUROCRYPT 2004. Springer-Vedag, 2004. 382 - 400
  • 10Boneh D, Franklin M. Identity based eneryption from the well pairing. SIAM Journal on Computing, 2003, 32(3) :586 - 615

引证文献1

;
使用帮助 返回顶部