Non-interactive and non-malleable commitment scheme based on q-one way group homomorphisms

被引:0
|
作者
Zhang Z.-Y. [1 ]
Dong X.-L. [1 ]
Cao Z.-F. [1 ]
机构
[1] Computer Science and Engineering Department, Shanghai Jiaotong University
关键词
Commitment scheme; Non-interactive; Non-malleable; Q-one way group homomorphisms (q-OWGH);
D O I
10.1007/s12204-008-0574-x
中图分类号
学科分类号
摘要
Commitment scheme is a basic component of many cryptographic protocols, such as coin-tossing, identification schemes, zero-knowledge and multi-party computation. In order to prevent man-in-middle attacks, non-malleability is taken into account. Many forming works focus on designing non-malleable commitments schemes based on number theory assumptions. In this paper we give a general framework to construct non-interactive and non-malleable commitment scheme with respect to opening based on more general assumptions called q-one way group homomorphisms (q-OWGH). Our scheme is more general since many existing commitment schemes can be deduced from our scheme.
引用
下载
收藏
页码:574 / 578
页数:4
相关论文
共 50 条
  • [1] Non-interactive and Non-malleable Commitment Scheme Based on q-one Way Group Homomorphisms
    张宗洋
    董晓蕾
    曹珍富
    Journal of Shanghai Jiaotong University(Science), 2008, (05) : 574 - 578
  • [2] Efficient and non-interactive non-malleable commitment
    Di Crescenzo, G
    Katz, J
    Ostrovsky, R
    Smith, A
    ADVANCES IN CRYPTOLOGY-EUROCRYPT 2001, PROCEEDINGS, 2001, 2045 : 40 - 59
  • [3] A discrete-logarithm based non-interactive non-malleable commitment scheme with an online knowledge extractor
    Ding, Ning
    Gu, Dawu
    INFORMATION SECURITY AND CRYPTOLOGY, 2008, 4990 : 153 - 166
  • [4] Non-interactive Distributional Indistinguishability (NIDI) and Non-malleable Commitments
    Khurana, Dakshita
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2021, PT III, 2021, 12698 : 186 - 215
  • [5] Black-Box Non-interactive Non-malleable Commitments
    Garg, Rachit
    Khurana, Dakshita
    Lu, George
    Waters, Brent
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2021, PT III, 2021, 12698 : 159 - 185
  • [6] Unbounded Non-Malleable Non-Interactive Zero Knowledge Protocols for NP
    Huang Guifang
    Lin Dongdai
    CHINESE JOURNAL OF ELECTRONICS, 2009, 18 (03): : 400 - 404
  • [7] Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
    Pass, Rafael
    COMPUTATIONAL COMPLEXITY, 2016, 25 (03) : 607 - 666
  • [8] Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
    Rafael Pass
    computational complexity, 2016, 25 : 607 - 666
  • [9] Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
    Pass, Rafael
    THEORY OF CRYPTOGRAPHY (TCC 2013), 2013, 7785 : 334 - 354
  • [10] Non-Malleable Non-Interactive Zero Knowledge Proof Using InstD-VRF
    Huang, Guifang
    Hu, Lei
    Lin, Dongdai
    THIRD INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND COMPUTATIONAL TECHNOLOGY (ISCSCT 2010), 2010, : 466 - 470