Blind \textsf{ECDSA} from the \textsf{ECDSA} assumption

DOI10.62056/AHJBHEE-3MaRDI QIDQ7390799zbMATH OpenFDO

Authors Jules Maire, Alan Pulval-Dady

Publication date 2025

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/AHJBHEE-3

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites work

• \textsf{ZKAttest}: ring and group signatures for existing ECDSA keys
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A public key cryptosystem and a signature scheme based on discrete logarithms
• CDLS: proving knowledge of committed discrete logarithms with soundness
• Commitments with efficient zero-knowledge arguments from subset sum problems
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Compact zero-knowledge arguments for Blum integers
• Concurrently secure blind Schnorr signatures
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• Efficient signature generation by smart cards
• Exponent-VRFs and their applications
• Generic groups, collision resistance, and ECDSA
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 3825707 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• Ligero: lightweight sublinear arguments without a trusted setup
• Limits in the provable security of ECDSA signatures
• Linearly homomorphic encryption from \(\mathsf {DDH}\)
• On the security of ECDSA with additive key derivation and presignatures
• One-more unforgeability of blind ECDSA
• Secure conversion between Boolean and arithmetic masking of any order
• Security arguments for digital signatures and blind signatures
• The algebraic group model and its applications
• The Knowledge Complexity of Interactive Proof Systems
• The return of the SDitH
• Threshold computation in the head: improved framework for post-quantum signatures and zero-knowledge arguments
• Threshold linear secret sharing to the rescue of MPC-in-the-head
• Zero-knowledge proofs from secure multiparty computation
• Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection

This page was built for publication: Blind \textsf{ECDSA} from the \textsf{ECDSA} assumption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7390799)