Pseudorandom Functions and Lattices

By Abhishek B. Banerjee, Chris Peikert, Alon Rosen. International Conference on the Theory and Application of Cryptographic Techniques, 2012

528 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/683432f4c531a23dcf342584219c52da97c11476

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

In Computational Theory and Mathematics

Citations in the corpus

A Toolkit for Ring-LWE Cryptography (2013, background): “, [25, 24, 21, 14, 15, 26, 33, 9, 8, 17, 18, 22, 5, 28, 20, 16]), often to the exclusion of all other rings.”
How to Construct Quantum Random Functions (2012, methodology): “In this section, present the construction of pseudorandom functions from Banerjee, Peikert, and Rosen [1].”
Saber: Module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM (2018, methodology): “[10] and is a derandomized version of the LWE problem.”
Computational Differential Privacy from Lattice-Based Cryptography (2017, background): “set Fsiptq “ xt, siy ` ei (which is a so-called randomised weak pseudo-random function as described in [4] and in [6]), where ei Ð χ (for the uncompromised users) and let φ be the identity function.”
Key Homomorphic PRFs and Their Applications (2013, background): “The function FLWR can be easily shown to be a secure PRF in the random oracle model whenever the Learning with Rounding (LWR) assumption [8] holds.”
Hardness of SIS and LWE with Small Parameters (2013, background): “(The one exception that we know of is the security proof for pseudorandom functions [3].”
Pseudorandom Functions: Three Decades Later (2017, methodology): “The LWR problem yields a simple and practical pseudorandom generator GA : Zq→ Zp , where the moduli q > p and the (uniformly random) matrix A ∈ Zn×m q are publicly known [17].”
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM (2017, background): “On one hand, there are reductions between LWR and LWE, but they involve substantial losses, especially in the ring setting [8].”
GGHLite: More Efficient Multilinear Maps from Ideal Lattices (2014, methodology): “This technique, also called “smudging,”was previously used in other applications [3,10,2,4].”