Sciweavers

198 search results - page 32 / 40
» The Multiplicative Quantum Adversary
Sort
View
COMCOM
2007
95views more  COMCOM 2007»
13 years 7 months ago
Key management for long-lived sensor networks in hostile environments
Large-scale wireless sensor networks (WSNs) are highly vulnerable to attacks because they consist of numerous resource-constrained devices and communicate via wireless links. Thes...
Michael Chorzempa, Jung Min Park, Mohamed Eltoweis...
IANDC
2007
152views more  IANDC 2007»
13 years 7 months ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner
WDAG
2010
Springer
218views Algorithms» more  WDAG 2010»
13 years 6 months ago
Anonymous Asynchronous Systems: The Case of Failure Detectors
Abstract: Due the multiplicity of loci of control, a main issue distributed systems have to cope with lies in the uncertainty on the system state created by the adversaries that ar...
François Bonnet, Michel Raynal
IDTRUST
2009
ACM
14 years 2 months ago
Palantir: a framework for collaborative incident response and investigation
Organizations owning cyber-infrastructure assets face large scale distributed attacks on a regular basis. In the face of increasing complexity and frequency of such attacks, we ar...
Himanshu Khurana, Jim Basney, Mehedi Bakht, D. Mic...
CCS
2009
ACM
14 years 2 months ago
A security-preserving compiler for distributed programs: from information-flow policies to cryptographic mechanisms
We enforce information flow policies in programs that run at multiple locations, with diverse levels of security. We build a compiler from a small imperative language with locali...
Cédric Fournet, Gurvan Le Guernic, Tamara R...