Cryptographic Hardness of Random Local Functions–Survey
From MaRDI portal
Publication:4910300
DOI10.1007/978-3-642-36594-2_33zbMath1315.94049OpenAlexW181881105MaRDI QIDQ4910300
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
Related Items (10)
Exploring crypto dark matter: new simple PRF candidates and their applications ⋮ Fast Pseudorandom Functions Based on Expander Graphs ⋮ Improved filter permutators for efficient FHE: better instances and implementations ⋮ 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 ⋮ Boolean Functions for Homomorphic-Friendly Stream Ciphers ⋮ Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes ⋮ The Complexity of Public-Key Cryptography
This page was built for publication: Cryptographic Hardness of Random Local Functions–Survey
