Group signatures and more from isogenies and lattices: generic, simple, and efficient

DOI10.1007/s10623-023-01192-xzbMath1530.94050OpenAlexW4322492328MaRDI QIDQ6041582

Samuel Dobson, Ward Beullens, Shuichi Katsumata, Federico Pintore, Yi-Fu Lai

Publication date: 31 May 2023

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-023-01192-x

zbMATH Keywords

elliptic curveslattice-based cryptographypost-quantum cryptographyisogeny-based cryptographylinkable ring signature

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves (14H52) Isogeny (14K02) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the concrete hardness of learning with errors
• Security arguments for digital signatures and blind signatures
• Floppy-sized group signatures from lattices
• CSIDH: an efficient post-quantum commutative group action
• A new constant-size accountable ring signature scheme without random oracles
• Constant-size group signatures from lattices
• Attribute-based signatures for unbounded circuits in the ROM and efficient instantiations from lattices
• Estimate all the {LWE, NTRU} schemes!
• Signatures from sequential-OR proofs
• Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
• Compact, efficient and UC-secure isogeny-based oblivious transfer
• Breaking the decisional Diffie-Hellman problem for class group actions using genus theory
• Practical product proofs for lattice commitments
• He gives C-sieves on the CSIDH
• Quantum security analysis of CSIDH
• SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
• Group signatures and more from isogenies and lattices: generic, simple, and efficient
• Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
• Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
• Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
• CSI-FiSh: efficient isogeny based signatures through class group computations
• Group signatures without NIZK: from lattices in the standard model
• Multi-target attacks on the picnic signature scheme and related protocols
• SeaSign: compact isogeny signatures from class group actions
• Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies
• Worst-case to average-case reductions for module lattices
• Group signature without random oracles from randomizable signatures
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
• Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
• A Provably Secure Group Signature Scheme from Code-Based Assumptions
• Foundations of Fully Dynamic Group Signatures
• Lattice-Based Group Signatures with Logarithmic Signature Size
• Dynamic Fully Anonymous Short Group Signatures
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Lattice Signatures without Trapdoors
• Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
• Adaptive Proofs of Knowledge in the Random Oracle Model
• Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
• Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• A Group Signature Scheme from Lattice Assumptions
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
• Trapdoors for hard lattices and new cryptographic constructions
• Get Shorty via Group Signatures without Encryption
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Group Signatures
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• 1-out-of-n Signatures from a Variety of Keys
• A Toolkit for Ring-LWE Cryptography
• Secure integration of asymmetric and symmetric encryption schemes
• Short Accountable Ring Signatures Based on DDH
• Advances in Cryptology – CRYPTO 2004
• Fully Anonymous Group Signatures Without Random Oracles
• An Improved Compression Technique for Signatures Based on Learning with Errors
• Advances in Cryptology - CRYPTO 2003
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Topics in Cryptology – CT-RSA 2005
• Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
• On Signatures of Knowledge

This page was built for publication: Group signatures and more from isogenies and lattices: generic, simple, and efficient