Sciweavers

1278 search results - page 112 / 256
» Attack Graph Based Evaluation of Network Security
Sort
View
AINA
2003
IEEE
15 years 7 months ago
Signature Schemes Based on Two Hard Problems Simultaneously
In 1994, Harn proposed a signature scheme based on the modified ElGamal's scheme and claimed that the security relies on both of the factorization and the discrete logarithm....
Ching-Te Wang, Chu-Hsing Lin, Chin-Chen Chang
ICPADS
2007
IEEE
15 years 10 months ago
S/Kademlia: A practicable approach towards secure key-based routing
Security is a common problem in completely decentralized peer-to-peer systems. Although several suggestions exist on how to create a secure key-based routing protocol, a practicab...
Ingmar Baumgart, Sebastian Mies
MOBIQUITOUS
2007
IEEE
15 years 10 months ago
Key Establishment Using Secure Distance Bounding Protocols
Key establishment is one of the major challenges in Wireless Personal Area Networks, as traditional security mechanisms often do not cope with the dynamic characteristics of wirel...
Dave Singelée, Bart Preneel
GI
2005
Springer
15 years 9 months ago
Security Extensions to MMARP Through Cryptographically Generated Addresses
: The MMARP protocol provides multicast routing in hybrid environments in which an ad hoc network is connected to the Internet. As many other routing protocols it was initially des...
Francisco J. Galera, Pedro M. Ruiz, Antonio F. G&o...
124
Voted
CCE
2007
15 years 3 months ago
Water networks security: A two-stage mixed-integer stochastic program for sensor placement under uncertainty
This work describes a stochastic approach for the optimal placement of sensors in municipal water networks to detect maliciously injected contaminants. The model minimizes the exp...
Vicente Rico-Ramírez, Sergio Frausto-Hern&a...