658 search results - page 13 / 132 » Open problems in the security of learning |
137
click to vote
FPL
2003
Springer
15 years 8 months ago
2003
Springer
The use of FPGAs for cryptographic applications is highly attractive for a variety of reasons but at the same time there are many open issues related to the general security of FPG...
132
click to vote
COLT
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. A brief overview is given of recent results on theory revision with queries for propositional formulas, such as monotone and unate DNF, Horn formulas, read-once formulas,...
142
click to vote
CRYPTO
2005
Springer
15 years 9 months ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
135
click to vote
CSFW
2010
IEEE
15 years 6 months ago
2010
IEEE
We consider the problem of automating open bisimulation checking for the spi-calculus, an extension of the pi-calculus with cryptographic primitives. The notion of open bisimulatio...
154
Voted
JMLR
2010
15 years 1 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...