Time-selective convertible undeniable signatures

被引:0
|
作者
Laguillaumie, F
Vergnaud, D
机构
[1] France Telecom, Res & Dev, F-14066 Caen, France
[2] Univ Caen, Lab Math Nicolas Oresme, F-14032 Caen, France
关键词
convertible undeniable signatures; bilinear maps; anonymity; exact security; time-selective conversion;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Undeniable signatures were introduced in 1989 by Chaum and van Antwerpen to limit the self-authenticating property of digital signatures. An extended concept - the convertible undeniable signatures - proposed by Boyar, Chaum, Damg (a) over circle rd and Pedersen in 1991, allows the signer to convert undeniable signatures to ordinary digital signatures. We present a new efficient convertible undeniable signature scheme based on bilinear maps. Its unforgeability is tightly related, in the random oracle model, to the computational Diffie-Hellman problem and its anonymity to a non-standard decisional assumption. The advantages of our scheme are the short length of the signatures, the low computational cost of the signature and the receipt generation. Moreover, a variant of our scheme permits the signer to universally convert signatures pertaining only to a specific time period. We formalize this notion as the time-selective conversion.
引用
收藏
页码:154 / 171
页数:18
相关论文
共 50 条
  • [1] An Efficient Construction of Time-Selective Convertible Undeniable Signatures
    Huang, Qiong
    Wong, Duncan S.
    Susilo, Willy
    Yang, Bo
    [J]. INFORMATION SECURITY, 2011, 7001 : 355 - +
  • [2] Time-selective convertible undeniable signatures with short conversion receipts
    Laguillaumie, Fabien
    Vergnaud, Damien
    [J]. INFORMATION SCIENCES, 2010, 180 (12) : 2458 - 2475
  • [3] CONVERTIBLE UNDENIABLE SIGNATURES
    BOYAR, J
    CHAUM, D
    DAMGARD, I
    PEDERSEN, T
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 537 : 189 - 205
  • [4] Convertible group undeniable signatures
    Lyuu, YD
    Wu, ML
    [J]. INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2002, 2002, 2587 : 48 - 61
  • [5] Gradually convertible undeniable signatures - (Michels-Petersen-Horster convertible undeniable signatures revisited)
    El Aimani, Laila
    Vergnaud, Damien
    [J]. APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS, 2007, 4521 : 478 - +
  • [6] A Framework for Constructing Convertible Undeniable Signatures
    Kikuchi, Ryo
    Phong, Le Trieu
    Ogata, Wakaha
    [J]. PROVABLE SECURITY, 2010, 6402 : 70 - +
  • [7] Convertible undeniable partially blind signatures
    Huang, ZJ
    Chen, ZX
    Wang, YM
    [J]. 19TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS, VOL 1, PROCEEDINGS: AINA 2005, 2005, : 609 - 614
  • [8] (Convertible) undeniable signatures without random oracles
    Yuen, Tsz Hon
    Au, Man Ho
    Liu, Joseph K.
    Susilo, Willy
    [J]. INFORMATION AND COMMUNICATIONS SECURITY, PROCEEDINGS, 2007, 4681 : 83 - +
  • [9] Efficient Convertible Undeniable Signatures with Delegatable Verification
    Schuldt, Jacob C. N.
    Matsuura, Kanta
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2011, E94A (01) : 71 - 83
  • [10] Provably Secure Convertible Undeniable Signatures with Unambiguity
    Le Trieu Phong
    Kurosawa, Kaoru
    Ogata, Wakaha
    [J]. SECURITY AND CRYPTOGRAPHY FOR NETWORKS, 2010, 6280 : 291 - 308