Discrete Gaussian Leftover Hash Lemma over Infinite Domains
By Shweta Agrawal, Craig Gentry, Shai Halevi, Amit Sahai. 2013
57 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Pasin Manurangsi
- Badih Ghazi
- Ravi Kumar
- Rasmus Pagh
- Ameya Velingker
- Damien Stehlé
- Albert Cheu
- Noah Golowich
In Computer Vision and Pattern Recognition
- Ravi Kumar
- Ron Steinfeld
- Rasmus Pagh
- Damien Stehlé
- Badih Ghazi
- Pasin Manurangsi
- Noah Golowich
- Adeline Langlois
Citations in the corpus
- Pure Differentially Private Summation from Anonymous Messages (2020, methodology): “(For reference, please refer to [GPV08, Lemma 2.6] which states a more general version of the statement that also works for higher-dimensional lattices.)”
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices (2014, methodology): “For this, we adapt the proof of the LHL in [1]: we follow a similar series of steps, but the proofs of these steps differ technically, as we exploit the ring structure.”