Cryptography with Constant Input Locality
From MaRDI portal
Publication:3612545
DOI10.1007/978-3-540-74143-5_6zbMath1215.94029OpenAlexW4213186577MaRDI QIDQ3612545
Yuval Ishai, Benny Applebaum, Eyal Kushilevitz
Publication date: 10 March 2009
Published in: Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74143-5_6
Related Items (10)
A correction to a code-based blind signature scheme ⋮ A code-based signature scheme from the Lyubashevsky framework ⋮ A non-heuristic approach to time-space tradeoffs and optimizations for BKW ⋮ Quantum search-to-decision reduction for the LWE problem ⋮ Input locality and hardness amplification ⋮ Homomorphic Evaluation Requires Depth ⋮ An improved algorithm for learning sparse parities in the presence of noise ⋮ Breaking the circuit size barrier for secure computation under quasi-polynomial LPN ⋮ Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer
This page was built for publication: Cryptography with Constant Input Locality
