Group signatures and more from isogenies and lattices: generic, simple, and efficient
From MaRDI portal
Publication:2170040
Recommendations
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Constant-size group signatures from lattices
- Simpler efficient group signatures from lattices
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- Lattice-based group signatures with logarithmic signature size
Cites work
- 1-out-of-n signatures from a variety of keys
- A Group Signature Scheme from Lattice Assumptions
- A new constant-size accountable ring signature scheme without random oracles
- A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
- A provably secure group signature scheme from code-based assumptions
- Adaptive proofs of knowledge in the random oracle model
- Advances in Cryptology - CRYPTO 2003
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Constant-size group signatures from lattices
- CSI-FiSh: efficient isogeny based signatures through class group computations
- CSIDH: an efficient post-quantum commutative group action
- Dynamic fully anonymous short group signatures
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Floppy-sized group signatures from lattices
- Foundations of fully dynamic group signatures
- Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions
- Foundations of group signatures: the case of dynamic groups
- Fully Anonymous Group Signatures Without Random Oracles
- Get shorty via group signatures without encryption
- Group signature without random oracles from randomizable signatures
- Group signatures
- Group signatures without NIZK: from lattices in the standard model
- He gives C-sieves on the CSIDH
- How to leak a secret
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Lattice-based group signatures with logarithmic signature size
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
- Non-interactive zero-knowledge proofs in the quantum random oracle model
- On Signatures of Knowledge
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Practical product proofs for lattice commitments
- Secure integration of asymmetric and symmetric encryption schemes
- Security arguments for digital signatures and blind signatures
- Short accountable ring signatures based on DDH
- Short group signatures
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- Signatures from sequential-OR proofs
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes. (Extended abstract)
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
Cited in
(37)- Skipping the \(q\) in group signatures
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- On the Theoretical Gap between Group Signatures with and without Unlinkability
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Tracing a linear subspace: application to linearly-homomorphic group signatures
- SCALLOP: scaling the CSI-FiSh
- Round-optimal oblivious transfer and MPC from computational CSIDH
- A lower bound on the length of signatures based on group actions and generic isogenies
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
- Obtaining simulation extractable NIZKs in the updatable CRS model generically
- \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist
- Attack on SHealS and HealS: the second wave of GPST
- Fixing and mechanizing the security proof of Fiat-Shamir with aborts and Dilithium
- Efficient isogeny proofs using generic techniques
- Round-robin is optimal: lower bounds for group action based protocols
- Robustly reusable fuzzy extractor from isogeny
- Malleable commitments from group actions and zero-knowledge proofs for circuits based on isogenies
- CSI-Otter: isogeny-based (partially) blind signatures from the class group action with a twist
- A simpler and more efficient reduction of DLog to CDH for abelian group actions
- New proof systems and an OPRF from CSIDH
- Universal composable password authenticated key exchange for the post-quantum world
- Re-randomize and extract: a novel commitment construction framework based on group actions
- Faster SCALLOP from non-prime conductor suborders in medium sized quadratic fields
- A framework for group action-based multi-signatures and applications to LESS, MEDS, and ALTEQ
- Lattice-based proof-friendly signatures from vanishing short integer solutions
- On the traceability of group signatures: uncorrupted user must exist
- Tanuki: new frameworks for (concurrently secure) blind signatures from post-quantum group actions
- Lattice-based group signatures in the standard model, revisited
- Post-quantum blind signature from standard group action assumptions and more
- Verifiable encryption from MPC-in-the-head
- On the active security of the PEARL-SCALLOP group action
- Capybara and Tsubaki: verifiable random functions from group actions and isogenies
- Erebor and Durian: full anonymous ring signatures from quaternions and isogenies
- HHGS: forward-secure dynamic group signatures from symmetric primitives
- (Partially) blind signatures from cryptographic group actions
- Diffie-Hellman key exchange from commutativity to group laws
This page was built for publication: Group signatures and more from isogenies and lattices: generic, simple, and efficient
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170040)