3238 search results - page 127 / 648 » On the Computational Interpretation of Negation |
151
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
227
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
The computer aided diagnosis (CAD) problems of detecting
potentially diseased structures from medical images are
typically distinguished by the following challenging characterist...
204
click to vote
ASIACRYPT
2011
Springer
14 years 6 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
183
click to vote
CRYPTO
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
188
click to vote
CRYPTO
2006
Springer
15 years 10 months ago
2006
Springer
In the setting of multiparty computation, a set of parties wish to jointly compute a function of their inputs, while preserving security in the case that some subset of them are co...