Practical algorithm substitution attack on extractable signatures

DOI10.1007/S10623-022-01019-1zbMath1497.94155OpenAlexW4220928246WikidataQ114849779 ScholiaQ114849779MaRDI QIDQ2119943

Yanyan Li

Publication date: 31 March 2022

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-022-01019-1

zbMATH Keywords

discrete logalgorithm substitution attackarbitrary collectionextractable signatures

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Programmable hash functions and their applications
• Security arguments for digital signatures and blind signatures
• Short signatures from the Weil pairing
• Asymmetric subversion attacks on signature schemes
• Subversion-resilient signatures: definitions, constructions and applications
• The Magic of ELFs
• Instantiating Random Oracles via UCEs
• Security of Symmetric Encryption against Mass Surveillance
• Security Proofs for Signature Schemes
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• Cryptographic Reverse Firewalls
• The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone?
• Efficient Chosen-Ciphertext Security via Extractable Hash Proofs
• Towards a Theory of Extractable Functions
• On the existence of extractable one-way functions
• Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
• On the Size of Pairing-Based Non-interactive Arguments

This page was built for publication: Practical algorithm substitution attack on extractable signatures