A framework for practical anonymous credentials from lattices
From MaRDI portal
Publication:6145919
DOI10.1007/978-3-031-38545-2_13OpenAlexW4385654101MaRDI QIDQ6145919
Ngoc Khanh Nguyen, Vadim Lyubashevsky, A. Sorniotti, Jonathan Bootle
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_13
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New bounds in some transference theorems in the geometry of numbers
- LWE without modular reduction and improved side-channel attacks against BLISS
- Practical product proofs for lattice commitments
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- 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
- Worst-case to average-case reductions for module lattices
- Asymptotically efficient lattice-based digital signatures
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Towards classical hardness of module-LWE: the linear rank case
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- Efficient Identity-Based Encryption over NTRU Lattices
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
- Access with pseudonyms
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- 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
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- MuSig-L: lattice-based multi-signature with single-round online phase
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
- BLOOM: bimodal lattice one-out-of-many proofs and applications
This page was built for publication: A framework for practical anonymous credentials from lattices
