Pseudorandom functions in NC class from the standard LWE assumption
From MaRDI portal
Publication:2243895
DOI10.1007/s10623-021-00955-8zbMath1492.94145OpenAlexW3208769506WikidataQ114690126 ScholiaQ114690126MaRDI QIDQ2243895
Shuai Han, Yiming Li, Shengli Liu, Da-Wu Gu
Publication date: 11 November 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00955-8
Cites Work
- Unnamed Item
- Unnamed Item
- Finding shortest lattice vectors faster using quantum search
- A hierarchy of polynomial time lattice basis reduction algorithms
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Private constrained PRFs (and more) from LWE
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- More efficient lattice PRFs from keyed pseudorandom synthesizers
- Key-homomorphic pseudorandom functions from LWE with small modulus
- A Decade of Lattice Cryptography
- Learning with Rounding, Revisited
- Key Homomorphic PRFs and Their Applications
- New and Improved Key-Homomorphic Pseudorandom Functions
- Pseudorandom Functions and Lattices
- Efficient Pseudorandom Functions via On-the-Fly Adaptation
- Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More
- A sieve algorithm for the shortest lattice vector problem
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- Advances in Cryptology - EUROCRYPT 2004
- Private Puncturable PRFs from Standard Lattice Assumptions
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- On lattices, learning with errors, random linear codes, and cryptography
