Concurrent non-malleable statistically hiding commitment

详细信息	查看全文 | 推荐本文 |

• 作者：Zongyang Zhang¹ ; ^{zongyangzhang@gmail.com} ; Zhenfu Cao ; ^{zfcao@cs.sjtu.edu.cn}
• 关键词：Cryptography ; Concurrent non-malleability with respect to opening ; Statistically hiding commitment ; Concurrent non-malleable zero-knowledge
• 刊名：Information Processing Letters
• 出版年：2012
• 期刊代码：61_00200190
• 类别：cp
• 出版时间：15 June, 2012
• 卷：112
• 期：11
• 页码：443-448
• 文件大小：160 K

摘要

We present a modular construction of non-malleable statistically hiding commitment schemes that retains its properties when concurrently executed a polynomial number of times. Our protocol is based on a statistically hiding commitment scheme and a concurrent non-malleable zero-knowledge protocol for all of . Our result is achieved in the plain model without relying on any set-up assumptions. The proof of security only uses black-box techniques.