Lattice-Based Cryptography
From MaRDI portal
Cited in
(31)- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- A lattice-based identity-based proxy blind signature scheme in the standard model
- Circuit complexity of linear functions: gate elimination and feeble security
- Cryptanalysis of the extension field cancellation cryptosystem
- Security comparisons and performance analyses of post-quantum signature algorithms
- D-NTRU: more efficient and average-case IND-CPA secure NTRU variant
- Lattice-based proxy-oriented identity-based encryption with keyword search for cloud storage
- Tightly secure signature schemes from the LWE and subset sum assumptions
- Post-quantum cryptography: lattice signatures
- Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\)
- Cryptographic hardness for learning intersections of halfspaces
- LARA: a design concept for lattice-based encryption
- A unified framework of identity-based sequential aggregate signatures from 2-level HIBE schemes
- A decade of lattice cryptography
- Gate elimination for linear functions and new feebly secure constructions
- Algebraic cryptography: new constructions and their security against provable break
- Integer Reconstruction Public-Key Encryption
- Some Recent Progress in Lattice-Based Cryptography
- Local testing of lattices
- Parameterized intractability of even set and shortest vector problem from Gap-ETH
- scientific article; zbMATH DE number 7528028 (Why is no real title available?)
- scientific article; zbMATH DE number 7312512 (Why is no real title available?)
- Expressive Cryptography: Lattice Perspectives
- A Digital Signature Scheme Based on CVP ∞
- Fiat-Shamir signatures based on module-NTRU
- GeT a CAKE: \underline{Ge}neric \underline{T}ransformations from \underline{K}ey encaspulation mechanisms to password \underline{A}uthenticated \underline{K}ey \underline{E}xchanges
- An algebraic algorithm for breaking NTRU with multiple keys
- Worst-case to average-case hardness of LWE: an alternative perspective
- Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding
- Improved (provable) algorithms for the shortest vector problem via bounded distance decoding
- On the practicality of quantum sieving algorithms for the shortest vector problem
This page was built for publication: Lattice-Based Cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756637)
