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 条
  • [1] Short Convertible Undeniable Signature in the Standard Model
    Huang, Qiong
    Wong, Duncan S.
    INFORMATION SECURITY PRACTICE AND EXPERIENCE, 2011, 6672 : 257 - 272
  • [2] (Convertible) undeniable signatures without random oracles
    Yuen, Tsz Hon
    Au, Man Ho
    Liu, Joseph K.
    Susilo, Willy
    INFORMATION AND COMMUNICATIONS SECURITY, PROCEEDINGS, 2007, 4681 : 83 - +
  • [3] Tight Security for Signature Schemes Without Random Oracles
    Schaege, Sven
    JOURNAL OF CRYPTOLOGY, 2015, 28 (03) : 641 - 670
  • [4] Tight Security for Signature Schemes Without Random Oracles
    Sven Schäge
    Journal of Cryptology, 2015, 28 : 641 - 670
  • [5] Tight Proofs for Signature Schemes without Random Oracles
    Schaege, Sven
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2011, 2011, 6632 : 189 - 206
  • [6] Short group signature without random oracles
    Liang, Xiaohui
    Cao, Zhenfu
    Shao, Jun
    Lin, Huang
    INFORMATION AND COMMUNICATIONS SECURITY, PROCEEDINGS, 2007, 4681 : 69 - 82
  • [7] Proxy re-signature schemes without random oracles
    Shao, Jun
    Cao, Zhenfu
    Wang, Licheng
    Liang, Xiaohui
    PROGRESS IN CRYPTOLOGY - INDOCRYPT 2007, 2007, 4859 : 197 - 209
  • [8] 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
  • [9] New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
    Phong, Le Trieu
    Kurosawa, Kaoru
    Ogata, Wakaha
    PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2009, 2009, 5580 : 116 - +
  • [10] Convertible undeniable signature with subliminal channels
    Lee, NY
    Ho, PH
    APPLIED MATHEMATICS AND COMPUTATION, 2004, 158 (01) : 169 - 175