Tighter security for efficient lattice cryptography via the Rényi divergence of optimized orders
From MaRDI portal
Publication:3464413
Recommendations
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- Improved security evaluation techniques for imperfect randomness from arbitrary distributions
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
Cited in
(10)- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Cryptographic divergences: new techniques and new applications
- Improved security evaluation techniques for imperfect randomness from arbitrary distributions
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Bit security as computational cost for winning games with high probability
- The algebraic one-more MISIS problem and applications to threshold signatures
- Partially non-interactive two-round lattice-based threshold signatures
- Tweed: adaptively secure lattice-based two-round threshold signatures
- A closer look at \textsc{Falcon}
This page was built for publication: Tighter security for efficient lattice cryptography via the Rényi divergence of optimized orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3464413)