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 条
  • [31] A multivariate convertible undeniable signature scheme
    Omar, Satyam
    Padhye, Sahadeo
    Dey, Dhananjoy
    Mehrotra, Devansh
    INFORMATION AND COMPUTATION, 2025, 304
  • [32] Convertible undeniable signature with subliminal channels
    Lee, NY
    Ho, PH
    APPLIED MATHEMATICS AND COMPUTATION, 2004, 158 (01) : 169 - 175
  • [33] Concurrent signature without random oracles
    Tan, Xiao
    Huang, Qiong
    Wong, Duncan S.
    THEORETICAL COMPUTER SCIENCE, 2015, 562 : 194 - 212
  • [34] Key Replacement Attack on Two Certificateless Signature Schemes without Random Oracles
    Xia, Qi
    Xu, Chunxiang
    Yu, Yong
    ADVANCED MEASUREMENT AND TEST, PARTS 1 AND 2, 2010, 439-440 : 1606 - 1611
  • [35] Proxy signature without random oracles
    Huang, Xinyi
    Susilo, Willy
    Mu, Yi
    Wu, Wei
    MOBILE AD-HOC AND SENSOR NETWORKS, PROCEEDINGS, 2006, 4325 : 473 - +
  • [36] New identity-based short signature without random oracles
    Zhang, Leyou
    Hu, Yupu
    Wu, Qing
    CEIS 2011, 2011, 15
  • [37] Provably secure pairing-based convertible undeniable signature with short signature length
    Huang, Xinyi
    Mu, Yi
    Susilo, Willy
    Wu, Wei
    PAIRING-BASED CRYPTOGRAPHY - PAIRING 2007, 2007, 4575 : 367 - +
  • [38] Fine-grained forward-secure signature schemes without random oracles
    Camenisch, J
    Koprowski, M
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (02) : 175 - 188
  • [39] The Convertible Undeniable Multi-Signature Scheme
    Yun, SungHyun
    Lee, Hyung-Woo
    Lee, MyungHo
    ADVANCES IN COGNITIVE NEURODYNAMICS, PROCEEDINGS, 2008, : 805 - +
  • [40] Certificateless Signature Scheme without Random Oracles
    Yuan, Yumin
    Li, Da
    Tian, Liwen
    Zhu, Haishan
    ADVANCES IN INFORMATION SECURITY AND ASSURANCE, 2009, 5576 : 31 - 40