Sciweavers

5476 search results - page 259 / 1096
» Resettably Secure Computation
Sort
View
AINA
2007
IEEE
16 years 1 months ago
Towards Quantifying the (In)Security of Networked Systems
Traditional security analyses are often geared towards cryptographic primitives or protocols. Although such analyses are absolutely necessary, they do not provide much insight for...
Xiaohu Li, T. Paul Parker, Shouhuai Xu
ACMSE
2004
ACM
16 years 3 days ago
Security for fixed sensor networks
Sensor networks consist of resource-constrained sensors operating in a variety of environments. Given the severe constraints on these sensors, it is a particularly challenging pro...
Ning Hu, Randy K. Smith, Phillip G. Bradford
PERVASIVE
2004
Springer
16 years 1 days ago
A Fault-Tolerant Key-Distribution Scheme for Securing Wireless Ad Hoc Networks
We propose a novel solution for securing wireless ad-hoc networks. Our goal is to provide secure key exchange in the presence of device failures and denial-of-service attacks. The ...
Arno Wacker, Timo Heiber, Holger Cermann, Pedro Jo...
165
Voted
ICN
2001
Springer
15 years 11 months ago
Secure Communication: A New Application for Active Networks
SplitPath is a new application for the easy, well-known and provably secure one-time pad encryption scheme. Two problems hinder the one-time pad scheme from being applied in the ar...
Manuel Günter, Marc Brogle, Torsten Braun
NSDI
2008
15 years 9 months ago
IRBs and Security Research: Myths, Facts and Mission Creep
Having decided to focus attention on the "weak link" of human fallibility, a growing number of security researchers are discovering the US Government's regulations ...
Simson L. Garfinkel