Sciweavers

107 search results - page 13 / 22
» Fixed-Polynomial Size Circuit Bounds
Sort
View
EUROCRYPT
2010
Springer
14 years 14 days ago
Bounded Key-Dependent Message Security
We construct the first public-key encryption scheme that is proven secure (in the standard model, under standard assumptions) even when the attacker gets access to encryptions of ...
Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval...
DAC
2005
ACM
13 years 9 months ago
Circuit optimization using statistical static timing analysis
In this paper, we propose a new sensitivity based, statistical gate sizing method. Since circuit optimization effects the entire shape of the circuit delay distribution, it is dif...
Aseem Agarwal, Kaviraj Chopra, David Blaauw, Vladi...
COLT
2008
Springer
13 years 9 months ago
Learning Acyclic Probabilistic Circuits Using Test Paths
We define a model of learning probabilistic acyclic circuits using value injection queries, in which an arbitrary subset of wires is set to fixed values, and the value on the sing...
Dana Angluin, James Aspnes, Jiang Chen, David Eise...
FOCS
2003
IEEE
14 years 29 days ago
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
Rafael Pass, Alon Rosen
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 11 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass