Pages that link to "Item:Q1753174"
From MaRDI portal
The following pages link to Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance (Q1753174):
Displaying 16 items.
- On the security of homomorphic encryption on approximate numbers (Q2056709) (← links)
- On the integer polynomial learning with errors problem (Q2061918) (← links)
- On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers (Q2095466) (← links)
- Cryptographic divergences: new techniques and new applications (Q2106664) (← links)
- A constant-time sampling algorithm for binary Gaussian distribution over the integers (Q2122792) (← links)
- Practical non-interactive publicly verifiable secret sharing with thousands of parties (Q2170010) (← links)
- Computational fuzzy extractors (Q2216116) (← links)
- On the hardness of module learning with errors with short distributions (Q2677644) (← links)
- Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling (Q2701491) (← links)
- Learning strikes again: the case of the DRS signature scheme (Q5918281) (← links)
- Replacing Probability Distributions in Security Games via Hellinger Distance (Q6107269) (← links)
- On rejection sampling in Lyubashevsky's signature scheme (Q6133962) (← links)
- Securing approximate homomorphic encryption using differential privacy (Q6155269) (← links)
- Spherical Gaussian leftover hash lemma via the Rényi divergence (Q6535100) (← links)
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus (Q6595688) (← links)
- Rapid convergence of the unadjusted Langevin algorithm: isoperimetry suffices (Q6608556) (← links)
