Adaptively secure identity-based identification from lattices without random oracles
From MaRDI portal
Publication:3588352
Recommendations
- Short identity-based signatures with tight security from lattices
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- An Efficient and Provable Secure Identity-Based Identification Scheme in the Standard Model
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
Cited in
(13)- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- The geometry of lattice cryptography
- Adaptive-ID secure revocable identity-based encryption from lattices via subset difference method
- A lattice-based group signature scheme with verifier-local revocation
- On lattice-based interactive protocols: an approach with less or no aborts
- Bonsai trees, or how to delegate a lattice basis
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Improved Zero-Knowledge Identification with Lattices
- A lightweight identification protocol based on lattices
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Bonsai trees, or how to delegate a lattice basis
This page was built for publication: Adaptively secure identity-based identification from lattices without random oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3588352)