Sciweavers

80 search results - page 13 / 16
» Attacking and fixing PKCS
Sort
View
CSREASAM
2006
13 years 8 months ago
Increasing Security in Mobile Ad Hoc Networks by Incentives to Cooperate and Secure Routing
A mobile ad hoc network is a self-organizing network that relies on the cooperation of participating nodes in order to function properly. In this network, mobile users arrive withi...
Ebrahim Khosravi, Brandy Tyson
ATAL
2010
Springer
13 years 8 months ago
A graph-theoretic approach to protect static and moving targets from adversaries
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
John P. Dickerson, Gerardo I. Simari, V. S. Subrah...
IANDC
2008
150views more  IANDC 2008»
13 years 7 months ago
Hierarchical combination of intruder theories
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
Yannick Chevalier, Michaël Rusinowitch
COMCOM
2006
111views more  COMCOM 2006»
13 years 7 months ago
SCON: Secure management of continuity in sensor networks
Due to limited energy capacity of batteries, the function lifetime of sensor networks in general is longer than the operational lifetime of single nodes. Therefore, to keep the ne...
Arjan Durresi, Vijay Bulusu, Vamsi Paruchuri
CORR
2006
Springer
176views Education» more  CORR 2006»
13 years 7 months ago
On the Fingerprinting Capacity Under the Marking Assumption
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...
N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya...