Fair Blind Signatures without Random Oracles

被引:0
|
作者
Fuchsbauer, Georg [1 ]
Vergnaud, Damien [1 ]
机构
[1] Ecole Normale Super, CNRS, INRIA, Liens, Paris, France
来源
PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2010 | 2010年 / 6055卷
关键词
Blind signatures; revocable anonymity; standard model; Groth-Sahai proof system;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A fair blind signature is a blind signature with revocable anonymity and unlinkability, i.e. an authority can link an issuing session to the resulting signature and trace a signature to the user who requested it. In this paper we first revisit the security model for fair blind signatures given by Hufschmitt and Traore in 2007. We then give the first practical fair blind signature scheme with a security proof in the standard model. Our scheme satisfies a stronger variant of the Hufschmitt-Traore model.
引用
收藏
页码:16 / 33
页数:18
相关论文
共 50 条
  • [1] Short Group Signatures Without Random Oracles
    秦波
    伍前红
    Willy Susilo
    穆怡
    王育民
    姜正涛
    Journal of Computer Science & Technology, 2007, (06) : 805 - 821
  • [2] 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
  • [3] 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
  • [4] Practical verifiably encrypted signatures without random oracles
    Shao, Zuhua
    Gao, Yipeng
    INFORMATION SCIENCES, 2014, 278 : 793 - 801
  • [5] A generic construction of secure signatures without random oracles
    Li, Jin
    Chan, Yuen-Yan
    Wang, Yanming
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 3, 2006, 3982 : 309 - 317
  • [6] Efficient intrusion-resilient signatures without random oracles
    Libert, Benoit
    Quisquater, Jean-Jacques
    Yung, Moti
    INFORMATION SECURITY AND CRYPTOLOGY, PROCEEDINGS, 2006, 4318 : 27 - +
  • [7] Efficient digital signatures from RSA without random oracles
    Seo, Jae Hong
    INFORMATION SCIENCES, 2020, 512 (512) : 471 - 480
  • [8] A new efficient optimistic fair exchange protocol without random oracles
    Huang, Qiong
    Yang, Guomin
    Wong, Duncan S.
    Susilo, Willy
    INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2012, 11 (01) : 53 - 63
  • [9] A new efficient optimistic fair exchange protocol without random oracles
    Qiong Huang
    Guomin Yang
    Duncan S. Wong
    Willy Susilo
    International Journal of Information Security, 2012, 11 : 53 - 63
  • [10] Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs
    Rueckert, Markus
    Schneider, Michael
    Schroeder, Dominique
    APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, 2010, 6123 : 69 - 86