Lattice signature with efficient protocols, application to anonymous credentials
From MaRDI portal
Publication:6145918
DOI10.1007/978-3-031-38545-2_12OpenAlexW4385654468MaRDI QIDQ6145918
Corentin Jeudy, Adeline Roux-Langlois, Olivier Sanders
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38545-2_12
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limits on the hardness of lattice problems in \(\ell_{p}\) norms
- New bounds in some transference theorems in the geometry of numbers
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Implementation of lattice trapdoors on modules 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
- Divisible e-cash from constrained pseudo-random functions
- Post-quantum EPID signatures from symmetric primitives
- Worst-case to average-case reductions for module lattices
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Short signatures without random oracles and the SDH assumption in bilinear groups
- On the hardness of module learning with errors with short distributions
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Short Randomizable Signatures
- Hardness of SIS and LWE with Small Parameters
- Improved Short Lattice Signatures in the Standard Model
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- New directions in cryptography
- Group Signatures
- A Pseudorandom Generator from any One-way Function
- A Toolkit for Ring-LWE Cryptography
- Advances in Cryptology – CRYPTO 2004
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Topics in Cryptology – CT-RSA 2005
- On lattices, learning with errors, random linear codes, and cryptography
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
- 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
This page was built for publication: Lattice signature with efficient protocols, application to anonymous credentials
