Cryptography with Constant Input Locality

DOI10.1007/978-3-540-74143-5_6MaRDI QIDQ3612545zbMATH OpenOpenAlexFDO

Authors Benny Applebaum, Yuval Ishai, 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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Cryptography with constant input locality
• Input locality and hardness amplification
• Cryptography in constant parallel time
• Cryptographic hardness of random local functions. Survey
• Input locality and hardness amplification

Cited in

(16)

• A code-based signature scheme from the Lyubashevsky framework
• Secure computation with parallel calls to 2-ary functions
• A non-heuristic approach to time-space tradeoffs and optimizations for BKW
• An improved algorithm for learning sparse parities in the presence of noise
• The hardness of LPN over any integer ring and field for PCG applications
• Cryptography in constant parallel time
• Homomorphic evaluation requires depth
• Cryptographic hardness of random local functions -- survey
• Garbled circuits as randomized encodings of functions: a primer
• Quantum search-to-decision reduction for the LWE problem
• Cryptographic hardness of random local functions. Survey
• Cryptography with constant input locality
• Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
• Input locality and hardness amplification
• Cryptography with auxiliary input and trapdoor from constant-noise LPN
• A correction to a code-based blind signature scheme

This page was built for publication: Cryptography with Constant Input Locality

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