科研之友
微信
新浪微博
Facebook
分享链接
摘要
Non-malleable commitment represents a central research focuses in the international cryptographic community, with many important applications in e-commerce, e-government, and in constructing other cryptographic protocols etc. Existing non-malleable commitments schemes suffer from computational and communication complexity and cannot prevent copying commitment attack. Based on discrete logarithm assumption and RSA assumption, this study proposed a new method for constructing non-malleable commitment schemes, which required that different committers make their commitment computation on the base of their own public parameters. Two efficient, non-malleable commitment protocols showed that this new method offers low computational and communication complexity and can prevent copying commitment attack.
