Paper 2018/826
Simple and More Efficient PRFs with Tight Security from LWE and Matrix-DDH
Tibor Jager, Rafael Kurek, and Jiaxin Pan
Abstract
We construct efficient and tightly secure pseudorandom functions (PRFs) with only logarithmic security loss and short secret keys. This yields very simple and efficient variants of well-known constructions, including those of Naor-Reingold (FOCS 1997) and Lewko-Waters (ACM CCS 2009). Most importantly, in combination with the construction of Banerjee, Peikert and Rosen (EUROCRYPT 2012) we obtain the currently most efficient LWE-based PRF from a weak LWE-assumption with a much smaller modulus than the original construction. In comparison to the only previous construction with this property, which is due to Doettling and Schroeder (CRYPTO 2015), we use a modulus of similar size, but only a single instance of the underlying PRF, instead of
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- Pseudorandom functionsLWEMDDHaugmented cascadetight security
- Contact author(s)
- rafael kurek @ upb de
- History
- 2018-09-06: received
- Short URL
- https://ia.cr/2018/826
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/826, author = {Tibor Jager and Rafael Kurek and Jiaxin Pan}, title = {Simple and More Efficient {PRFs} with Tight Security from {LWE} and Matrix-{DDH}}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/826}, year = {2018}, url = {https://eprint.iacr.org/2018/826} }