Cutting the GRASS: threshold group action signature schemes

DOI10.1007/978-3-031-58868-6_18MaRDI QIDQ6636123

Alessio Meneghetti, Michele Battagliola, Giacomo Borin, Edoardo Persichetti

Publication date: 12 November 2024

zbMATH Keywords

cryptographic group actionsreplicated secret sharingfull threshold scheme

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• Secure distributed key generation for discrete-log based cryptosystems
• CSIDH: an efficient post-quantum commutative group action
• Threshold ECDSA with an offline recovery party
• Threshold schemes from isogeny assumptions
• LESS-FM: fine-tuning signatures from the code equivalence problem
• \textsf{CSI-RAShi}: distributed key generation for CSIDH
• Sharing the LUOV: threshold post-quantum signatures
• CSI-FiSh: efficient isogeny based signatures through class group computations
• SeaSign: compact isogeny signatures from class group actions
• Using level-1 homomorphic encryption to improve threshold DSA signatures for Bitcoin wallet security
• Revisiting post-quantum Fiat-Shamir
• Security of the Fiat-Shamir transformation in the quantum random-oracle model
• Post-quantum security of Fiat-Shamir
• Cryptographic group actions and applications
• Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
• Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security
• Robust Threshold DSS Signatures
• Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Sashimi: Cutting up CSI-FiSh Secret Keys to Produce an Actively Secure Distributed Signing Protocol
• LESS is More: Code-Based Signatures Without Syndromes
• Fast secure two-party ECDSA signing
• Supersingular curves you can trust
• Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
• On the computational hardness of the code equivalence problem in cryptography
• Take your MEDS: digital signatures from matrix code equivalence
• Tight adaptive reprogramming in the QROM
• On actively secure fine-grained access structures from isogeny assumptions
• A new formulation of the linear equivalence problem and shorter less signatures

This page was built for publication: Cutting the GRASS: threshold group action signature schemes