Sciweavers

1186 search results - page 22 / 238
» A New Approach to Secure Logging
Sort
View
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
14 years 3 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
NTMS
2008
IEEE
14 years 2 months ago
MASA: End-to-End Data Security in Sensor Networks Using a Mix of Asymmetric and Symmetric Approaches
Wireless Sensor Networks (WSNs) are a new technology that is expected to be used increasingly in the near future due to its cheap cost and data processing ability. However, securi...
Hani Alzaid, Manal Alfaraj
SECRYPT
2010
147views Business» more  SECRYPT 2010»
13 years 6 months ago
Security Models for Heterogeneous Networking
Security for Next Generation Networks (NGNs) is an attractive topic for many research groups. The Y-Comm security group believes that a new security approach is needed to address t...
Glenford E. Mapp, Mahdi Aiash, Aboubaker Lasebae, ...
CONEXT
2006
ACM
14 years 2 months ago
Secure sensor network routing: a clean-slate approach
The deployment of sensor networks in security- and safety-critical environments requires secure communication primitives. In this paper, we design, implement, and evaluate a new s...
Bryan Parno, Mark Luk, Evan Gaustad, Adrian Perrig
NIPS
2004
13 years 9 months ago
New Criteria and a New Algorithm for Learning in Multi-Agent Systems
We propose a new set of criteria for learning algorithms in multi-agent systems, one that is more stringent and (we argue) better justified than previous proposed criteria. Our cr...
Rob Powers, Yoav Shoham