Pseudorandom functions in almost constant depth from low-noise LPN

DOI10.1007/978-3-662-49896-5_6MaRDI QIDQ5739201zbMATH OpenOpenAlexFDO

Authors Yu Yu, John P. Steinberger

Publication date 15 July 2016

Published in Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49896-5_6

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Pseudorandom functions and lattices
• Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
• Collision resistant hashing from sub-exponential learning parity with noise
• Key-homomorphic pseudorandom functions from LWE with small modulus
• Cryptography from learning parity with noise

Cited in

(15)

• Pseudorandom functions and lattices
• Robustly reusable fuzzy extractor with imperfect randomness
• An improved algorithm for learning sparse parities in the presence of noise
• Substitution-permutation networks, pseudorandom functions, and natural proofs
• The hardness of LPN over any integer ring and field for PCG applications
• Towards efficient LPN-based symmetric encryption
• Exploring crypto dark matter: new simple PRF candidates and their applications
• Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
• Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
• Learning with physical rounding for linear and quadratic leakage functions
• Collision resistant hashing from sub-exponential learning parity with noise
• Code-Based Zero Knowledge PRF Arguments
• Pseudorandom functions in NC class from the standard LWE assumption
• Covert learning: how to learn with an untrusted intermediary
• More efficient lattice PRFs from keyed pseudorandom synthesizers

This page was built for publication: Pseudorandom functions in almost constant depth from low-noise LPN

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739201)