Round-robin is optimal: lower bounds for group action based protocols

DOI10.1007/978-3-031-48624-1_12MaRDI QIDQ6587957zbMATH OpenFDO

Authors Daniele Cozzo, Emanuele Giunta

Publication date 15 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48624-1_12

zbMATH Keywords

hard homogeneous spaceround-robin protocols

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• An optimal distributed discrete log protocol with applications to homomorphic secret sharing
• An optimal distributed discrete log protocol with applications to homomorphic secret sharing
• Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols

Cites work

• \textsf{CSI-RAShi}: distributed key generation for CSIDH
• A direct key recovery attack on SIDH
• A lower bound on the length of signatures based on group actions and generic isogenies
• Accumulators in (and beyond) generic groups: non-trivial batch verification requires interaction
• An efficient key recovery attack on SIDH
• An isogeny-based ID protocol using structured public keys
• Breaking SIDH in polynomial time
• Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
• Compact, efficient and UC-secure isogeny-based oblivious transfer
• Cryptography and Coding
• CSI-FiSh: efficient isogeny based signatures through class group computations
• CSI-SharK: CSI-FiSh with sharing-friendly keys
• CSIDH: an efficient post-quantum commutative group action
• Generic models for group actions
• Generic-group delay functions require hidden-order groups
• Group signatures and more from isogenies and lattices: generic, simple, and efficient
• Identification scheme and forward-secure signature in identity-based setting from isogenies
• Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
• On actively secure fine-grained access structures from isogeny assumptions
• On the impossibility of algebraic NIZK in pairing-free groups
• On the impossibility of algebraic vector commitments in pairing-free groups
• On the impossibility of purely algebraic signatures
• Post-quantum adaptor signature for privacy-preserving off-chain payments
• Practical robust DKG protocols for CSIDH
• Sashimi: cutting up CSI-FiSh secret keys to produce an actively secure distributed signing protocol
• SeaSign: compact isogeny signatures from class group actions
• SHealS and HealS: Isogeny-Based PKEs from a Key Validation Method for SIDH
• SiGamal: a supersingular isogeny-based PKE and its application to a PRF
• Threshold schemes from isogeny assumptions
• To label, or not to label (in generic groups)

Cited in

(3)

• Short note on a short proof of a variant of the round-robin scheduling problem
• Enhancing threshold group action signature schemes: adaptive security and scalability improvements
• Threshold oblivious pseudorandom functions from isogeny group actions

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)