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

DOI10.1007/978-3-031-07085-3_21MaRDI QIDQ2170064zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the Security of the Schnorr Scheme using Preprocessing
• Security of BLS and BGLS signatures in a multi-user setting
• On Schnorr's preprocessing for digital signature schemes
• Security of signature schemes in a multi-user setting
• Publication:4934716

Cites work

• A taxonomy of pairing-friendly elliptic curves
• Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Another look at generic groups
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Complexity of a determinate algorithm for the discrete logarithm
• Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
• Computing elliptic curve discrete logarithms with the negation map
• Constructive and destructive facets of Weil descent on elliptic curves
• Hash function requirements for Schnorr signatures
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• How to use indistinguishability obfuscation
• scientific article; zbMATH DE number 1583771 (Why is no real title available?)
• scientific article; zbMATH DE number 1583798 (Why is no real title available?)
• scientific article; zbMATH DE number 6488034 (Why is no real title available?)
• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 3353398 (Why is no real title available?)
• Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
• Monte Carlo Methods for Index Computation (mod p)
• MuSig2: simple two-round Schnorr multi-signatures
• On the Equivalence of Generic Group Models
• On the exact security of Schnorr-type signatures in the random oracle model
• On tight security proofs for Schnorr signatures
• Optimal security proofs for signatures from identification schemes
• Public key signatures in the multi-user setting.
• Reducing elliptic curve logarithms to logarithms in a finite field
• Security proofs for signature schemes
• Short signatures from the Weil pairing
• Simple Schnorr multi-signatures with applications to bitcoin
• The discrete logarithm problem on elliptic curves of trace one
• The Discrete Logarithm problem with preprocessing
• The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Two-round trip Schnorr multi-signatures via delinearized witnesses

Cited in

(6)

• Reusing nonces in Schnorr signatures (and keeping it secure...)
• On the Security of the Schnorr Scheme using Preprocessing
• To label, or not to label (in generic groups)
• Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing
• Truncator: time-space tradeoff of cryptographic primitives
• Putting multi into multi-signatures: tight security for multiple signers

Describes a project that uses

Uses Software

• MuSig2

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

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