On the multi-user security of short Schnorr signatures with preprocessing

DOI10.1007/978-3-031-07085-3_21zbMath1496.94075OpenAlexW3212090083MaRDI QIDQ2170064

Jeremiah Blocki, Seunghoon Lee

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-07085-3_21

zbMATH Keywords

Chaum-Pedersen signaturesKatz-Wang signaturesprogrammable random oracle modelShoup's generic group model

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

To label, or not to label (in generic groups)

Uses Software

• MuSig2

Cites Work

• Computing elliptic curve discrete logarithms with the negation map
• Another look at generic groups
• The discrete logarithm problem on elliptic curves of trace one
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Constructive and destructive facets of Weil descent on elliptic curves
• The Discrete Logarithm problem with preprocessing
• Short signatures from the Weil pairing
• Public key signatures in the multi-user setting.
• Complexity of a determinate algorithm for the discrete logarithm
• Two-round trip Schnorr multi-signatures via delinearized witnesses
• MuSig2: simple two-round Schnorr multi-signatures
• The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
• A taxonomy of pairing-friendly elliptic curves
• Simple Schnorr multi-signatures with applications to bitcoin
• Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
• Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Optimal Security Proofs for Signatures from Identification Schemes
• Security Proofs for Signature Schemes
• On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model
• On Tight Security Proofs for Schnorr Signatures
• Hash function requirements for Schnorr signatures
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Monte Carlo Methods for Index Computation (mod p)
• Reducing elliptic curve logarithms to logarithms in a finite field
• Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
• How to use indistinguishability obfuscation
• On the Equivalence of Generic Group Models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the multi-user security of short Schnorr signatures with preprocessing