Homomorphic evaluation requires depth

DOI10.1007/978-3-662-49096-9_15MaRDI QIDQ2796133zbMATH OpenOpenAlexFDO

Authors Andrej Bogdanov, Chin Ho Lee

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)

Recommendations

• Limits of provable security for homomorphic encryption
• When Homomorphism Becomes a Liability
• Fully homomorphic encryption with polylog overhead
• Fully homomorphic encryption using ideal lattices
• Homomorphic evaluation of the AES circuit

Cites work

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

Cited in

(1)

• Limits of provable security for homomorphic encryption

This page was built for publication: Homomorphic evaluation requires depth

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