Sciweavers

211 search results - page 20 / 43
» PSS Is Secure against Random Fault Attacks
Sort
View
CCS
2005
ACM
15 years 11 months ago
Fast and automated generation of attack signatures: a basis for building self-protecting servers
Large-scale attacks, such as those launched by worms and zombie farms, pose a serious threat to our network-centric society. Existing approaches such as software patches are simpl...
Zhenkai Liang, R. Sekar
CCS
2007
ACM
16 years 5 days ago
Security under key-dependent inputs
In this work we re-visit the question of building cryptographic primitives that remain secure even when queried on inputs that depend on the secret key. This was investigated by B...
Shai Halevi, Hugo Krawczyk
CCS
2004
ACM
15 years 11 months ago
On the effectiveness of address-space randomization
Address-space randomization is a technique used to fortify systems against bu er over ow attacks. The idea is to introduce arti cial diversity by randomizing the memory location o...
Hovav Shacham, Matthew Page, Ben Pfaff, Eu-Jin Goh...
ISCAS
2006
IEEE
92views Hardware» more  ISCAS 2006»
16 years 2 hour ago
Model of a true random number generator aimed at cryptographic applications
— The paper presents a simple stochastic model of a True Random Number Generator, which extracts randomness from the tracking jitter of a phase-locked loop. The existence of such...
Martin Simka, Milos Drutarovský, Viktor Fis...
CONEXT
2007
ACM
15 years 10 months ago
Practical defenses against BGP prefix hijacking
Prefix hijacking, a misbehavior in which a misconfigured or malicious BGP router originates a route to an IP prefix it does not own, is becoming an increasingly serious security p...
Zheng Zhang, Ying Zhang, Y. Charlie Hu, Zhuoqing M...