Skip to main content
placeholder image

Identity-based trapdoor mercurial commitments and applications

Journal Article


Abstract


  • In this paper, we first introduce the notion of identity-based trapdoor mercurial commitment which enjoys the advantages of both the identity-based trapdoor commitment and trapdoor mercurial commitment, while using the idea of “Customized Identity”. Inherently, an identity-based trapdoor mercurial commitment is an underlying building block for constructing identity-based (non-interactive) zero-knowledge sets. That is, a prover can commit to a set S in a way that reveals nothing about S and prove to a verifier, in zero-knowledge, statements of the form x∈S and x∉S. Besides, although the (non-interactive) proof is publicly verifiable, it is also bound to the identity of the prover in a way which is recognizable to any verifier.

UOW Authors


  •   Chen, Xiaofeng (external author)
  •   Susilo, Willy
  •   Zhang, Fangguo (external author)
  •   Tian, Haibo (external author)
  •   Li, Jianbo (external author)

Publication Date


  • 2011

Citation


  • Chen, X., Susilo, W., Zhang, F., Tian, H. & Li, J. (2011). Identity-based trapdoor mercurial commitments and applications. Theoretical Computer Science, 412 (39), 5498-5512.

Scopus Eid


  • 2-s2.0-80051666286

Ro Metadata Url


  • http://ro.uow.edu.au/infopapers/3643

Number Of Pages


  • 14

Start Page


  • 5498

End Page


  • 5512

Volume


  • 412

Issue


  • 39

Abstract


  • In this paper, we first introduce the notion of identity-based trapdoor mercurial commitment which enjoys the advantages of both the identity-based trapdoor commitment and trapdoor mercurial commitment, while using the idea of “Customized Identity”. Inherently, an identity-based trapdoor mercurial commitment is an underlying building block for constructing identity-based (non-interactive) zero-knowledge sets. That is, a prover can commit to a set S in a way that reveals nothing about S and prove to a verifier, in zero-knowledge, statements of the form x∈S and x∉S. Besides, although the (non-interactive) proof is publicly verifiable, it is also bound to the identity of the prover in a way which is recognizable to any verifier.

UOW Authors


  •   Chen, Xiaofeng (external author)
  •   Susilo, Willy
  •   Zhang, Fangguo (external author)
  •   Tian, Haibo (external author)
  •   Li, Jianbo (external author)

Publication Date


  • 2011

Citation


  • Chen, X., Susilo, W., Zhang, F., Tian, H. & Li, J. (2011). Identity-based trapdoor mercurial commitments and applications. Theoretical Computer Science, 412 (39), 5498-5512.

Scopus Eid


  • 2-s2.0-80051666286

Ro Metadata Url


  • http://ro.uow.edu.au/infopapers/3643

Number Of Pages


  • 14

Start Page


  • 5498

End Page


  • 5512

Volume


  • 412

Issue


  • 39