A NON-REPUDIABLE BIASED BITSTRING COMMITMENT SCHEME ON A POSTQUANTUM CRYPTOSYSTEM USING NON-ABELIAN GROUP

[摘要] Commitment schemes are fundamental bricks for guaranteeing fairness in upper level cryptographic protocols. Most commitment schemes in the literature rely on hash functions, which should be strongly collision free for the scheme to be secure. We present a commitment scheme, which avoids hash functions by using a public-key cryptosystem based on braid root problem instead.

[关键词] Biased bit string commitment;braid group;root problem;non abelian group.