Sciweavers

460 search results - page 76 / 92
» Heuristic Methods for Security Protocols
Sort
View
SECPERU
2006
IEEE
14 years 1 months ago
Detecting Critical Nodes for MANET Intrusion Detection Systems
Ad hoc routing protocols have been designed to efficiently reroute traffic when confronted with network congestion, faulty nodes, and dynamically changing topologies. The common d...
A. Karygiannis, E. Antonakakis, A. Apostolopoulos
TYPES
2004
Springer
14 years 1 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
FM
1999
Springer
93views Formal Methods» more  FM 1999»
13 years 12 months ago
Group Principals and the Formalization of Anonymity
We introduce the concept of a group principal and present a number of different classes of group principals, including threshold-group-principals. These appear to naturally usefu...
Paul F. Syverson, Stuart G. Stubblebine
CCS
2010
ACM
13 years 7 months ago
Synchronized aggregate signatures: new definitions, constructions and applications
An aggregate signature scheme is a digital signature scheme where anyone given n signatures on n messages from n users can aggregate all these signatures into a single short signa...
Jae Hyun Ahn, Matthew Green, Susan Hohenberger
ASC
2011
13 years 2 months ago
Quality of Service constrained routing optimization using Evolutionary Computation
In this work, a novel optimization framework is proposed that allows the improvement of Quality of Service levels in TCP/IP based networks, by configuring the routing weights of ...
Miguel Rocha, Pedro Sousa, Paulo Cortez, Miguel Ri...