Sciweavers

252 search results - page 45 / 51
» How Secure is Deterministic Encryption
Sort
View
CN
2007
106views more  CN 2007»
15 years 2 months ago
Learning DFA representations of HTTP for protecting web applications
Intrusion detection is a key technology for self-healing systems designed to prevent or manage damage caused by security threats. Protecting web server-based applications using in...
Kenneth L. Ingham, Anil Somayaji, John Burge, Step...
157
Voted
WS
2005
ACM
15 years 7 months ago
Fully self-organized peer-to-peer key management for mobile ad hoc networks
Mobile ad hoc networks (MANETs) offer communication over a shared wireless channel without any pre-existing infrastructure. Forming peer-to-peer security associations in MANETs i...
Johann van der Merwe, Dawoud S. Dawoud, Stephen Mc...
103
Voted
DATE
2010
IEEE
182views Hardware» more  DATE 2010»
15 years 7 months ago
Fault-based attack of RSA authentication
For any computing system to be secure, both hardware and software have to be trusted. If the hardware layer in a secure system is compromised, not only it would be possible to ext...
Andrea Pellegrini, Valeria Bertacco, Todd M. Austi...
ASIACRYPT
2003
Springer
15 years 6 months ago
Certificateless Public Key Cryptography
This paper introduces the concept of certificateless public key cryptography (CL-PKC). In contrast to traditional public key cryptographic systems, CL-PKC does not require the use...
Sattam S. Al-Riyami, Kenneth G. Paterson
ICPADS
2008
IEEE
15 years 8 months ago
Integrity-Preserving Replica Coordination for Byzantine Fault Tolerant Systems
The use of good random numbers is essential to the integrity of many mission-critical systems. However, when such systems are replicated for Byzantine fault tolerance, a serious i...
Wenbing Zhao