Improved security evaluation techniques for imperfect randomness from arbitrary distributions
From MaRDI portal
Publication:2289223
Recommendations
- 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
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Replacing Probability Distributions in Security Games via Hellinger Distance
- Tighter security for efficient lattice cryptography via the Rényi divergence of optimized orders
Cited in
(9)- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Cryptographic divergences: new techniques and new applications
- 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
- Overcoming weak expectations via the Rényi entropy and the expanded computational entropy
- Tighter security for efficient lattice cryptography via the Rényi divergence of optimized orders
- Increased certification of semi-device independent random numbers using many inputs and more post-processing
- Replacing Probability Distributions in Security Games via Hellinger Distance
- Bit security as computational cost for winning games with high probability
This page was built for publication: Improved security evaluation techniques for imperfect randomness from arbitrary distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289223)