A lightweight identification protocol based on lattices
From MaRDI portal
Recommendations
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Improved Zero-Knowledge Identification with Lattices
- Improved Zero-Knowledge Identification with Lattices
- Identity-based signatures from lattices: simpler, faster, shorter
- Puncturable Identity-Based Encryption from Lattices
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Efficient identity-based encryption from LWR
- Adaptively secure identity-based identification from lattices without random oracles
- Short identity-based signatures with tight security from lattices
- Towards tightly secure lattice short signature and id-based encryption
Cites work
- A new identification scheme based on syndrome decoding
- An efficient statistical zero-knowledge authentication protocol for smart cards
- CSIDH on the surface
- Efficient Authentication from Hard Learning Problems
- Efficiently masking binomial sampling at arbitrary orders for lattice-based crypto
- FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Identification protocols and signature schemes based on supersingular isogeny problems
- Identification schemes from key encapsulation mechanisms
- Introduction to modern cryptography.
- Lapin: an efficient authentication protocol based on ring-LPN
- Lattice signatures and bimodal Gaussians
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Masking Dilithium. Efficient implementation and side-channel evaluation
- Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security
- New constructions of efficient simulation-sound commitments using encryption and their applications
- Online-extractability in the quantum random-oracle model
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials
- Quantum security proofs using semi-classical oracles
- Random oracles in a quantum world
- Secure identity-based encryption in the quantum random oracle model
- Secure integration of asymmetric and symmetric encryption schemes
- Separate your domains: NIST PQC KEMs, oracle cloning and read-only indifferentiability
- SQISign: compact post-quantum signatures from quaternions and isogenies
- Tighter proofs of CCA security in the quantum random oracle model
- Tightly-secure signatures from lossy identification schemes
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Trapdoors for hard lattices and new cryptographic constructions
This page was built for publication: A lightweight identification protocol based on lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6091129)
