1763 search results - page 3 / 353 » A Formalization of Polytime Functions |
CRYPTO
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
FLOPS
2010
Springer
14 years 2 days ago
2010
Springer
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
COLT
2000
Springer
13 years 9 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
SAS
1992
Springer
13 years 9 months ago
1992
Springer
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
Side-channel attacks have often proven to have a devastating effect on the security of cryptographic schemes. In this paper, we address the problem of storing cryptographic keys a...