Short and efficient convertible undeniable signature schemes without random oracles

被引:4
|
作者
Huang, Qiong [1 ]
Wong, Duncan S. [2 ]
机构
[1] South China Agr Univ, Guangzhou, Guangdong, Peoples R China
[2] City Univ Hong Kong, Hong Kong, Hong Kong, Peoples R China
基金
高等学校博士学科点专项科研基金; 中国国家自然科学基金;
关键词
Convertible undeniable signature; Standard model; Signature scheme; Strong Diffie-Hellman assumption; Identity-based encryption; IDENTITY-BASED ENCRYPTION; GENERIC TRANSFORMATION; PROOFS; KNOWLEDGE;
D O I
10.1016/j.tcs.2013.01.010
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A convertible undeniable signature allows a signer to confirm or disavow a non-self-authenticating signature and also convert a valid one to a publicly verifiable signature. During the conversion, existing schemes either require the signer to be stateful, or have their security based on the random oracle assumption, or result in getting a large converter. In this work we propose a new construction, which supports both selective conversion and universal conversion, and is provably secure without random oracles. It has the shortest undeniable signature and the smallest converter. A signature consists of three bilinear group elements and just one group element each in a selective converter and a universal converter. The scheme can be extended further to support new features, such as the delegation of conversion and confirmation/disavowal, threshold conversion and others. We also propose an alternative generic construction of stateless convertible undeniable signature. Unlike the conventional 'sign-then-encrypt' paradigm, a signer in this new generic scheme encrypts a signature using identity-based encryption instead of public key encryption. It also enjoys the advantage of a short selective converter. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:67 / 83
页数:17
相关论文
共 50 条
  • [21] Short signature and universal designated verifier signature without random oracles
    Zhang, R
    Furukawa, J
    Imai, H
    APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS, 2005, 3531 : 483 - 498
  • [22] Convertible undeniable signature scheme
    Korea Univ, Seoul, Korea, Republic of
    Proc Conf High Perform Comput Inf Superhighway HPC Asia, (700-703):
  • [23] New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
    Phong, Le Trieu
    Kurosawa, Kaoru
    Ogata, Wakaha
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2010, E93A (01) : 63 - 75
  • [24] Convertible undeniable signature scheme
    Yun, SH
    Kim, TY
    HIGH PERFORMANCE COMPUTING ON THE INFORMATION SUPERHIGHWAY - HPC ASIA '97, PROCEEDINGS, 1997, : 700 - 703
  • [25] New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
    Phong, Le Trieu
    Kurosawa, Kaoru
    Ogata, Wakaha
    PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2009, 2009, 5580 : 116 - +
  • [26] Certificate-based signature schemes without pairings or random oracles
    Liu, Joseph K.
    Baek, Joonsang
    Susilo, Willy
    Zhou, Jianying
    INFORMATION SECURITY, PROCEEDINGS, 2008, 5222 : 285 - +
  • [27] An efficient designated verifier signature scheme without random oracles
    Zhang, Jianhong
    Ji, Cheng
    PROCEEDINGS OF THE FIRST INTERNATIONAL SYMPOSIUM ON DATA, PRIVACY, AND E-COMMERCE, 2007, : 338 - +
  • [28] Efficient Linkable and/or Threshold Ring Signature Without Random Oracles
    University of Hong Kong, Hong Kong, Hong Kong
    不详
    不详
    Liu, J.K. (ksliu@i2r.a-star.edu.sg), 1600, Oxford University Press (56):
  • [29] Efficient verifiably encrypted signature scheme without random oracles
    Yang, Hao-Miao
    Sun, Shi-Xin
    Xu, Ji-You
    Ruan Jian Xue Bao/Journal of Software, 2009, 20 (04): : 1069 - 1076
  • [30] Efficient Linkable and/or Threshold Ring Signature Without Random Oracles
    Yuen, Tsz Hon
    Liu, Joseph K.
    Au, Man Ho
    Susilo, Willy
    Zhou, Jianying
    COMPUTER JOURNAL, 2013, 56 (04): : 407 - 421