计算机技术与发展2017，Vol.27Issue(5)：108-112,5.DOI:10.3969/j.issn.1673-629X.2017.05.023
具有不可关联性的承诺方案
Non-malleable Commitment Schemes
摘要
Abstract
Commitment scheme is a basic scheme in cryptography and has been important application in other agreements of cryptography like secure multi-party computation,encryption scheme,signature scheme,key exchange protocols and so on.Non-malleable commitment scheme is one focus in the international cryptographic community and the theoretical basis of electronic auction,which is also an important building block of secure multi-party computation and has important applications in cryptography and practice.At present,most studies focus on improving the security and the efficiency of non-malleable commitment schemes and less difficulty hypothesis,etc.So,two non-malleable commitment schemes are proposed which can efficiently prevent malleable attack and copy attack.These non-malleable commitment schemes are constructed based on discrete logarithm assumption and one-way hash function.If adversary can successfully attack the scheme,it can compute the discrete logarithm.The computing discrete logarithm in cryptography is a hard problem,and its security proving and efficiencies analysis are given.Study analysis shows that non associated commitment scheme using hash function as a commitment function,efficiency and security are relatively high.关键词
不可关联承诺/离散对数假设/哈希函数/承诺函数Key words
non-malleable commitment/discrete logarithm assumption/hash function/commitment function分类
信息技术与安全科学引用本文复制引用
马丽,窦家维,吴艳梅..具有不可关联性的承诺方案[J].计算机技术与发展,2017,27(5):108-112,5.基金项目
国家自然科学基金资助项目(61272435) （61272435）
