A general construction for fail-stop signature using authentication codes

被引：0
|
作者：
Safavi-Naini, R [1 ]
Susilo, W [1 ]
机构：
[1] Univ Wollongong, Sch Informat Technol & Comp Sci, Ctr Comp Secur Res, Wollongong, NSW 2522, Australia
来源：
CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY | 2001年 / 20卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Security of an ordinary digital signature relies on a computational assumption. Fail-stop signature schemes provide security for a sender against a forger with unlimited computational power by enabling the sender to provide a proof of forgery, if it occurs. In this paper, we describe a method of constructing fail-stop signature schemes from authentication codes. We also give an example that fits this general construction and prove its security.
引用
收藏
页码：343 / 356
页数：14
相关论文
共 50 条
  • [41] Algorithm-Based Fault Tolerance for Fail-Stop Failures
    Chen, Zizhong
    Dongarra, Jack
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2008, 19 (12) : 1628 - 1641
  • [42] Constructions of Fail-Stop Signatures for Multi-Signer Setting
    Kitajima, Nobuaki
    Yanai, Naoto
    Nishide, Takashi
    Hanaoka, Goichiro
    Okamoto, Eiji
    2015 10TH ASIA JOINT CONFERENCE ON INFORMATION SECURITY (ASIAJCIS), 2015, : 112 - 123
  • [43] Optimal resilience patterns to cope with fail-stop and silent errors
    Benoit, Anne
    Cavelan, Aurelien
    Robert, Yves
    Sun, Hongyang
    2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2016), 2016, : 202 - 211
  • [44] Peacenik: Architecture Support for Not Failing under Fail-Stop Memory Consistency
    Zhang, Rui
    Biswas, Swarnendu
    Balaji, Vignesh
    Bond, Michael D.
    Lucia, Brandon
    TWENTY-FIFTH INTERNATIONAL CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS (ASPLOS XXV), 2020, : 317 - 333
  • [45] Coping with silent and fail-stop errors at scale by combining replication and checkpointing
    Benoit, Anne
    Cavelan, Aurelien
    Cappello, Franck
    Raghavan, Padma
    Robert, Yves
    Sun, Hongyang
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2018, 122 : 209 - 225
  • [46] On the existence of statistically hiding bit commitment schemes and fail-stop signatures
    Damgard, IB
    Pedersen, TP
    Pfitzmann, B
    JOURNAL OF CRYPTOLOGY, 1997, 10 (03) : 163 - 194
  • [47] On the existence of statistically hiding bit commitment schemes and fail-stop signatures
    Ivan B. Damgård
    Torben P. Pedersen
    Birgit Pfitzmann
    Journal of Cryptology, 1997, 10 : 163 - 194
  • [48] FAIL-STOP PROCESSORS - AN APPROACH TO DESIGNING FAULT-TOLERANT COMPUTING SYSTEMS
    SCHLICHTING, RD
    SCHNEIDER, FB
    ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1983, 1 (03): : 222 - 238
  • [49] 一种新的Fail-stop盲签名方案
    何金妮
    辛小龙
    高师理科学刊, 2010, 30 (03) : 15 - 16+19
  • [50] Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms
    Anne Benoit
    Louis-Claude Canon
    Emmanuel Jeannot
    Yves Robert
    Journal of Scheduling, 2012, 15 : 615 - 627
12345