Short undeniable signatures without random oracles: The missing link

被引:0
|
作者
Laguillaumie, F [1 ]
Vergnaud, D
机构
[1] Ecole Polytech, Lab Informat, LIX, INRIA Futurs,Projet TANC, F-91128 Palaiseau, France
[2] Univ Caen, Lab Math Nicolas Oresme, F-14032 Caen, France
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We introduce a new undeniable signature scheme which is existentially unforgeable and anonymous under chosen message attacks in the standard model. The scheme is an embedding of Boneh and Boyen's recent short signature scheme in a group where the decisional Diffie-Hellman problem is assumed to be difficult. The anonymity of our scheme relies on a decisional variant of the strong Diffie-Hellman assumption, while its unforgeability relies on the strong Diffie-Hellman assumption.
引用
收藏
页码:283 / 296
页数:14
相关论文
共 50 条
  • [1] (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 - +
  • [2] Short signatures without random oracles
    Boneh, D
    Boyen, X
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2004, PROCEEDINGS, 2004, 3027 : 56 - 73
  • [3] Short Group Signatures Without Random Oracles
    秦波
    伍前红
    Willy Susilo
    穆怡
    王育民
    姜正涛
    JournalofComputerScience&Technology, 2007, (06) : 805 - 821
  • [4] Short group signatures without random oracles
    Qin, Bo
    Wu, Qian-Hong
    Susilo, Willy
    Mu, Yi
    Wang, Yu-Min
    Jiang, Zheng-Tao
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2007, 22 (06) : 805 - 821
  • [5] Short Group Signatures Without Random Oracles
    Bo Qin
    Qian-Hong Wu
    Willy Susilo
    Yi Mu
    Yu-Min Wang
    Zheng-Tao Jiang
    Journal of Computer Science and Technology, 2007, 22 : 805 - 821
  • [6] Short and efficient convertible undeniable signature schemes without random oracles
    Huang, Qiong
    Wong, Duncan S.
    THEORETICAL COMPUTER SCIENCE, 2013, 476 : 67 - 83
  • [7] Short Signatures with a Tighter Security Reduction Without Random Oracles
    Guo, Fuchun
    Mu, Yi
    Susilo, Willy
    COMPUTER JOURNAL, 2011, 54 (04): : 513 - 524
  • [8] Sequential aggregate signatures with short public keys without random oracles
    Lee, Kwangsu
    Lee, Dong Hoon
    Yung, Moti
    THEORETICAL COMPUTER SCIENCE, 2015, 579 : 100 - 125
  • [9] Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
    Dan Boneh
    Xavier Boyen
    Journal of Cryptology, 2008, 21 : 149 - 177
  • [10] Short signatures without random oracles and the SDH assumption in bilinear groups
    Boneh, Dan
    Boyen, Xavier
    JOURNAL OF CRYPTOLOGY, 2008, 21 (02) : 149 - 177