12183 search results - page 175 / 2437 » Computers under Attacks! |
182
Voted
PKC
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
152
click to vote
CRYPTO
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. A cryptographic primitive is leakage-resilient, if it remains secure even if an adversary can learn a bounded amount of arbitrary information about the computation with e...
192
click to vote
IPPS
2008
IEEE
16 years 17 days ago
2008
IEEE
—In this paper we present a novel intrusion detection architecture based on Idiotypic Network Theory (INIDS), that aims at dealing with large scale network attacks featuring vari...
145
click to vote
CRYPTO
2007
Springer
16 years 9 days ago
2007
Springer
In this paper, we present a practical attack on the signature scheme SFLASH proposed by Patarin, Goubin and Courtois in 2001 following a design they had introduced in 1998. The att...
137
click to vote
FDTC
2007
Springer
16 years 9 days ago
2007
Springer
We present a novel non-linear error coding framework which incorporates strong adversarial fault detection capabilities into identity based encryption schemes built using Tate pai...