Sciweavers

2601 search results - page 442 / 521
» Secure Rewarding Schemes
Sort
View
IJNSEC
2008
129views more  IJNSEC 2008»
15 years 3 months ago
LAMAIDS: A Lightweight Adaptive Mobile Agent-based Intrusion Detection System
Intrusion detection system (IDS) has become an essential component of a computer security scheme as the number of security-breaking attempts originating inside organizations is in...
Mohamad A. Eid, Hassan Artail, Ayman I. Kayssi, Al...
JSAC
2006
183views more  JSAC 2006»
15 years 3 months ago
HiRLoc: high-resolution robust localization for wireless sensor networks
In this paper we address the problem of robustly estimating the position of randomly deployed nodes of a Wireless Sensor Network (WSN), in the presence of security threats. We prop...
Loukas Lazos, Radha Poovendran
TDSC
2008
99views more  TDSC 2008»
15 years 2 months ago
Integrity Codes: Message Integrity Protection and Authentication over Insecure Channels
Inspired by unidirectional error detecting codes that are used in situations where only one kind of bit error is possible (e.g., it is possible to change a bit "0" into a...
Srdjan Capkun, Mario Cagalj, Ram Kumar Rengaswamy,...
TPDS
2008
133views more  TPDS 2008»
15 years 2 months ago
Mutual Anonymity for Mobile P2P Systems
Mobile Peer-to-Peer Networks (MOPNETs) have become popular applications due to their ease of communication and resource sharing patterns in unfixed network infrastructures. As priv...
Jinsong Han, Yunhao Liu
TIT
2008
187views more  TIT 2008»
15 years 2 months ago
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
Stefan Dziembowski, Ueli M. Maurer