Security of Blind Signatures under Aborts

被引:0
|
作者
Fischlin, Marc [1 ]
Schroeder, Dominique [1 ]
机构
[1] Tech Univ Darmstadt, Darmstadt, Germany
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We explore the security of blind signatures under aborts where the user or the signer may stop the interactive signature issue protocol prematurely. Several works on blind signatures discuss security only in regard of completed executions and usually do not impose strong security requirements in case of aborts. One of the exceptions is the paper of Camenisch, Neven and shelat (Eurocrypt 2007) where the notion of selective-failure blindness has been introduced. Roughly speaking, selective-failure blindness says that blindness should also hold in case the signer is able to learn that some executions have aborted. Here we augment the work of Camenisch et al. by showing how to turn every secure blind signature scheme into a selective-failure blind signature scheme. Our transformation only requires an additional computation of a commitment and therefore adds only a negligible overhead. We also study the case of multiple executions and notions of selective failure blindness in this setting. We then discuss the case of user aborts and unforgeability under such aborts. We show that every three-move blind signature scheme remains unforgeable tinder such user aborts. Together with our transformation for selective-failure blindness we thus obtain an easy solution to ensure security tinder aborts of either party and which is applicable for example to the schemes of Pointcheval and Stern (Journal of Cryptology, 2000). We, finally revisit; the construction of Camenisch et al. for simulatable adaptive oblivious transfer protocols, starting from selective-failure blind Signatures where each message only has one valid signature (uniqueness). While our transformation to achieve selective-failure blindness does not preserve uniqueness, it can still be combined with a modified version of their protocol. Hence, we can derive such oblivious transfer protocols based on unique blind signature schemes only (in the random oracle model), without necessarily requiring selective-failure blindness from scratch.
引用
收藏
页码:297 / 316
页数:20
相关论文
共 50 条
  • [41] On Composable Security for Digital Signatures
    Badertscher, Christian
    Maurer, Ueli
    Tackmann, Bjorn
    [J]. PUBLIC-KEY CRYPTOGRAPHY - PKC 2018, PT I, 2018, 10769 : 494 - 523
  • [42] Security of Sanitizable Signatures Revisited
    Brzuska, Christina
    Fischlin, Marc
    Freudenreich, Tobias
    Lehmann, Anja
    Page, Marcus
    Schelbert, Jakob
    Schroeder, Dominique
    Volk, Florian
    [J]. PUBLIC KEY CRYPTOGRAPHY-PKC 2009, PROCEEDINGS, 2009, 5443 : 317 - 336
  • [43] On the Security Loss of Unique Signatures
    Morgan, Andrew
    Pass, Rafael
    [J]. THEORY OF CRYPTOGRAPHY, TCC 2018, PT I, 2018, 11239 : 507 - 536
  • [44] Security mediated certificateless signatures
    Yap, Nvun-She
    Chow, Sherman S. M.
    Heng, Swee-Huay
    Goi, Bok-Min
    [J]. APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS, 2007, 4521 : 459 - +
  • [45] Stronger Security for Sanitizable Signatures
    Krenn, Stephan
    Samelin, Kai
    Sommer, Dieter
    [J]. DATA PRIVACY MANAGEMENT, AND SECURITY ASSURANCE, 2016, 9481 : 100 - 117
  • [46] Round-Optimal Blind Signatures from Waters Signatures
    Gjosteen, Kristian
    Krakmo, Lillian
    [J]. PROVABLE SECURITY, 2008, 5324 : 112 - 126
  • [47] Threshold Structure-Preserving Signatures: Strong and Adaptive Security Under Standard Assumptions
    Mitrokotsa, Aikaterini
    Mukherjee, Sayantan
    Sedaghat, Mandi
    Slamanig, Daniel
    Tomy, Jenit
    [J]. PUBLIC-KEY CRYPTOGRAPHY, PT I, PKC 2024, 2024, 14601 : 163 - 195
  • [48] BENEFITS AND THE BLIND - RIGHTS AND REQUIREMENTS UNDER THE SOCIAL-SECURITY DISABILITY INSURANCE
    ERISMAN, CM
    [J]. NEW OUTLOOK FOR THE BLIND, 1962, 56 (08): : 267 - 270
  • [49] Efficient leakage-resilient blind and partially blind signatures
    Dai, Shuguang
    Jiang, Zhengjun
    Zhang, Fangguo
    [J]. INTERNATIONAL JOURNAL OF EMBEDDED SYSTEMS, 2018, 10 (01) : 52 - 61
  • [50] Efficient blind and partially blind signatures without random oracles
    Okamoto, Tatsuaki
    [J]. THEORY OF CRYPTOGRAPHY, PROCEEDINGS, 2006, 3876 : 80 - 99