Cryptographic hardness of random local functions -- survey

DOI10.1007/978-3-642-36594-2_33MaRDI QIDQ4910300zbMATH OpenOpenAlexFDO

Authors Benny Applebaum

Publication date 18 March 2013

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36594-2_33

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Cryptographic hardness of random local functions. Survey
• Cryptography in constant parallel time
• Cryptography with constant computational overhead
• Cryptography with constant input locality
• Cryptography with Constant Input Locality

Cited in

(14)

• Exploring crypto dark matter: new simple PRF candidates and their applications
• Improved filter permutators for efficient FHE: better instances and implementations
• Homomorphic evaluation of lattice-based symmetric encryption schemes
• Fast pseudorandom functions based on expander graphs
• Boolean functions for homomorphic-friendly stream ciphers
• Cryptographic hardness of random local functions. Survey
• The Complexity of Public-Key Cryptography
• scientific article; zbMATH DE number 7650354 (Why is no real title available?)
• On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator
• Worst-case subexponential attacks on PRGs of constant degree or constant locality
• Oblivious transfer with constant computational overhead
• Non-interactive zero-knowledge from non-interactive batch arguments
• Weightwise almost perfectly balanced functions, construction from a permutation group action view
• Towards a generalization of the algebraic attack on stream ciphers: a study of the case with only extremal-degree monomials

This page was built for publication: Cryptographic hardness of random local functions -- survey

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