Homomorphic Evaluation Requires Depth

DOI10.1007/978-3-662-49096-9_15zbMath1348.94034OpenAlexW2293357439MaRDI QIDQ2796133

Chin Ho Lee, Andrej Bogdanov

Publication date: 23 March 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-662-49096-9_15

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The average sensitivity of bounded-depth circuits
• More on average case vs approximation complexity
• On computing the determinant in small parallel time using a small number of processors
• \(\Sigma_ 1^ 1\)-formulae on finite structures
• Polynomial regression under arbitrary product distributions
• Efficiency improvements in constructing pseudorandom generators from one-way functions
• On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators
• Constant depth circuits, Fourier transform, and learnability
• How to Encrypt with the LPN Problem
• Cryptography with Constant Input Locality
• A Pseudorandom Generator from any One-way Function
• Noise-tolerant learning, the parity problem, and the statistical query model
• Theory of Cryptography

This page was built for publication: Homomorphic Evaluation Requires Depth