Round-robin is optimal: lower bounds for group action based protocols
From MaRDI portal
Publication:6587957
DOI10.1007/978-3-031-48624-1_12zbMATH Open1545.94058MaRDI QIDQ6587957
Emanuele Giunta, Daniele Cozzo
Publication date: 15 August 2024
Cites Work
- CSIDH: an efficient post-quantum commutative group action
- Generic-group delay functions require hidden-order groups
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
- Threshold schemes from isogeny assumptions
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- \textsf{CSI-RAShi}: distributed key generation for CSIDH
- Accumulators in (and beyond) generic groups: non-trivial batch verification requires interaction
- Post-quantum adaptor signature for privacy-preserving off-chain payments
- An isogeny-based ID protocol using structured public keys
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- CSI-FiSh: efficient isogeny based signatures through class group computations
- SeaSign: compact isogeny signatures from class group actions
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- SiGamal: a supersingular isogeny-based PKE and its application to a PRF
- On the impossibility of purely algebraic signatures
- Identification scheme and forward-secure signature in identity-based setting from isogenies
- Sashimi: Cutting up CSI-FiSh Secret Keys to Produce an Actively Secure Distributed Signing Protocol
- Cryptography and Coding
- SHealS and HealS: Isogeny-Based PKEs from a Key Validation Method for SIDH
- Generic models for group actions
- An efficient key recovery attack on SIDH
- A direct key recovery attack on SIDH
- Breaking SIDH in polynomial time
- A lower bound on the length of signatures based on group actions and generic isogenies
- On the impossibility of algebraic vector commitments in pairing-free groups
- To label, or not to label (in generic groups)
- On actively secure fine-grained access structures from isogeny assumptions
- On the impossibility of algebraic NIZK in pairing-free groups
- Practical robust DKG protocols for CSIDH
- CSI-SharK: CSI-FiSh with sharing-friendly keys
This page was built for publication: Round-robin is optimal: lower bounds for group action based protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587957)
