The Non-interactive Equivocable Non-malleable Commitment and its Applications


Under the assumption of the existence of one-way functions, we prove that it is possible to construct the non-interactive equivocable non-malleable commitment scheme. Especially importantly, we succeed in implementing concurrent zero-knowledge using our commitment scheme, analysising properties of this concurrent zero-knowledge proof system, comparing it… (More)


  • Presentations referencing similar topics