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 条
  • [21] Non-interactive Commitment from Non-transitive Group Actions
    D'Alconzo, Giuseppe
    Flamini, Andrea
    Gangemi, Andrea
    ADVANCES IN CRYPTOLOGY, ASIACRYPT 2023, PT VII, 2023, 14444 : 222 - 252
  • [22] TWO-ROUND AND NON-INTERACTIVE CONCURRENT NON-MALLEABLE COMMITMENTS FROM TIME-LOCK PUZZLES
    Lin, Huijia
    Pass, Rafael
    Soni, Pratik
    SIAM JOURNAL ON COMPUTING, 2020, 49 (04)
  • [23] Constant Round Non-Malleable Protocols using One Way Functions
    Goyal, Vipul
    STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING, 2011, : 695 - 704
  • [24] An efficient non-interactive deniable authentication scheme based on trapdoor commitment schemes
    Youn, Taek-Young
    Lee, Changhoon
    Park, Young-Ho
    COMPUTER COMMUNICATIONS, 2011, 34 (03) : 353 - 357
  • [25] Concurrent non-malleable commitments from any one-way function
    Lin, Huijia
    Pass, Rafael
    Venkitasubramaniam, Muthuramakrishnan
    THEORY OF CRYPTOGRAPHY, 2008, 4948 : 571 - 588
  • [26] Construction of a non-malleable encryption scheme from any semantically secure one
    Pass, Rafael
    shelat, abhi
    Vaikuntanathan, Vinod
    ADVANCES IN CRYPTOLOGY - CRYPTO 2006, PROCEEDINGS, 2006, 4117 : 271 - 289
  • [27] An Efficient Non-interactive Universally Composable String-Commitment Scheme
    Nishimaki, Ryo
    Fujisaki, Eiichiro
    Tanaka, Keisuke
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2012, E95A (01) : 167 - 175
  • [28] Non-interactive identity based deniable authentication scheme
    Kuo, Wen-Chung
    Huang, Yu-Chih
    PROCEEDING OF THE SEVENTH INTERNATIONAL CONFERENCE ON INFORMATION AND MANAGEMENT SCIENCES, 2008, 7 : 353 - 356
  • [29] Constant-Round Non-malleable Commitments from Any One-Way Function
    Lin, Huijia
    Pass, Rafael
    STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING, 2011, : 705 - 714
  • [30] Four-Round Concurrent Non-Malleable Commitments from One-Way Functions
    Ciampi, Michele
    Ostrovsky, Rafail
    Siniscalchi, Luisa
    Visconti, Ivan
    ADVANCES IN CRYPTOLOGY - CRYPTO 2017, PART II, 2017, 10402 : 127 - 157