265 search results - page 33 / 53 » et 2000 |
PKC
2005
Springer
14 years 1 months ago
2005
Springer
To sign with RSA, one usually encodes the message m as µ(m) and then raises the result to the private exponent modulo N. In Asiacrypt 2000, Coron et al. showed how to build a secu...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Boosting is a popular way to derive powerful learners from simpler hypothesis classes. Following previous work (Mason et al., 1999; Friedman, 2000) on general boosting frameworks,...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
PKC
2009
Springer
14 years 8 months ago
2009
Springer
We explore the security of blind signatures under aborts where the user or the signer may stop the interactive signature issue protocol prematurely. Several works on blind signatur...
CCE
2004
13 years 7 months ago
2004
In the literature, optimization models deal with planning and scheduling of several subsystems of the petroleum supply chain such as oilfield infrastructure, crude oil supply, ref...