Security of hedged Fiat-Shamir signatures under fault attacks
type: Item
instance of: scholarly article
title: Security of hedged Fiat-Shamir signatures under fault attacks
zbMATH Open document ID: 1479.94290
DOI: 10.1007/978-3-030-45721-1_23
author: Diego F. Aranha
author: Claudio Orlandi
author: Akira Takahashi
author: Greg Zaverucha
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7436934
zbMATH Keywords: formal security analysis
zbMATH Keywords: fault resilience of signature schemes
MaRDI profile type: Publication
full work available at URL: 978-3-030-45721-1 23
OpenAlex ID: W3003185916
cites work: Q4737261
cites work: Differential attacks on deterministic signatures
cites work: GLV/GLS Decomposition, Power Analysis, and Attacks on ECDSA Signatures with Single-Bit Nonce Bias
cites work: On the impossibility of cryptography with tamperable randomness
cites work: A note on fault attacks against deterministic signature schemes (short paper)
cites work: Making RSA–PSS Provably Secure against Non-random Faults
cites work: Hedged Public-Key Encryption: How to Protect against Bad Randomness
cites work: Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model
cites work: Q4434895
cites work: From Identification to Signatures, Tightly: A Framework and Generic Transforms
cites work: Nonce-Based Cryptography: Retaining Security When Randomness Fails
cites work: The lattice-based digital signature scheme qTESLA
cites work: Hedging public-key encryption in the real world
cites work: Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
cites work: Improved OR-Composition of Sigma-Protocols
cites work: A formal security analysis of the Signal messaging protocol
cites work: PSS Is Secure against Random Fault Attacks
cites work: Statistical ineffective fault attacks on masked AES with fault countermeasures
cites work: Bounded tamper resilience: how to go beyond the algebraic barrier
cites work: Non-Malleable Codes
cites work: Continuously non-malleable codes with split-state refresh
cites work: Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience
cites work: Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Modeling memory faults in signature and authenticated encryption schemes
cites work: Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions
cites work: Theory of Cryptography
cites work: Q3413440
cites work: Efficient secure two-party protocols. Techniques and constructions
cites work: Hedged nonce-based public-key encryption: adaptive security under randomness failures
cites work: Q3549593
cites work: Private Circuits II: Keeping Secrets in Tamperable Circuits
cites work: Fault analysis in cryptography. Foreword by Dan Boneh
cites work: A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
cites work: Optimal Security Proofs for Signatures from Identification Schemes
cites work: Tamper and Leakage Resilience in the Split-State Model
cites work: On the Security of the Schnorr Signature Scheme and DSA Against Related-Key Attacks
cites work: Q4250807
cites work: Q4249344
cites work: Security arguments for digital signatures and blind signatures
cites work: Practical fault injection on deterministic signatures: the case of EdDSA
cites work: Efficient signature generation by smart cards
cites work: Checking before output may not be enough against fault-based cryptanalysis
description: scientific article; zbMATH DE number 7436934