CRYPTO
2012
Springer
12 years 2 months ago
2012
Springer
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
IACR
2011
13 years 2 days ago
2011
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
COCO
2011
Springer
13 years 8 days ago
2011
Springer
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
ECCC
2006
14 years 14 days ago
2006
Abstract. Circuits composed of threshold gates (McCulloch-Pitts neurons, or perceptrons) are simplified models of neural circuits with the advantage that they are theoretically mor...
CORR
2010
Springer
14 years 16 days ago
2010
Springer
In their paper on the "chasm at depth four", Agrawal and Vinay have shown that polynomials in m variables of degree O(m) which admit arithmetic circuits of size 2o(m) al...