Sciweavers

1923 search results - page 111 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
CCS
2010
ACM
14 years 7 months ago
Assessing trust in uncertain information using Bayesian description logic
Decision makers (humans or software agents alike) are faced with the challenge of examining large volumes of information originating from heterogeneous sources with the goal of as...
Achille Fokoue, Mudhakar Srivatsa, Robert Young
TISSEC
2010
121views more  TISSEC 2010»
14 years 8 months ago
Privacy-aware role-based access control
Privacy has been acknowledged to be a critical requirement for many business (and non-business) environments. Therefore, the definition of an expressive and easy-to-use privacyre...
Qun Ni, Elisa Bertino, Jorge Lobo, Carolyn Brodie,...
CONCUR
2003
Springer
15 years 3 months ago
Synthesis of Distributed Algorithms Using Asynchronous Automata
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
Alin Stefanescu, Javier Esparza, Anca Muscholl
CCS
2009
ACM
15 years 4 months ago
False data injection attacks against state estimation in electric power grids
A power grid is a complex system connecting electric power generators to consumers through power transmission and distribution networks across a large geographical area. System mo...
Yao Liu, Michael K. Reiter, Peng Ning
IANDC
2007
152views more  IANDC 2007»
14 years 9 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