Sciweavers

335 search results - page 29 / 67
» Reasoning about Probabilistic Security Using Task-PIOAs
Sort
View
VOTEID
2007
Springer
14 years 1 months ago
Assessing Procedural Risks and Threats in e-Voting: Challenges and an Approach
Performing a good security analysis on the design of a system is an essential step in order to guarantee a reasonable level of protection. However, different attacks and threats m...
Komminist Weldemariam, Adolfo Villafiorita, Andrea...
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
13 years 6 months ago
Simulation-based LQR-trees with input and state constraints
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...
Philipp Reist, Russ Tedrake
SAS
2010
Springer
159views Formal Methods» more  SAS 2010»
13 years 6 months ago
Automatic Abstraction for Intervals Using Boolean Formulae
c Abstraction for Intervals Using Boolean Formulae J¨org Brauer1 and Andy King2 1 Embedded Software Laboratory, RWTH Aachen University, Germany 2 Portcullis Computer Security, Pin...
Jörg Brauer, Andy King
ISI
2007
Springer
14 years 1 months ago
A Combinatorial Approach to Measuring Anonymity
— In this paper we define a new metric for quantifying the degree of anonymity collectively afforded to users of an anonymous communication system. We show how our metric, based...
Matthew Edman, Fikret Sivrikaya, Bülent Yener
POPL
2005
ACM
14 years 8 months ago
Downgrading policies and relaxed noninterference
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...
Peng Li, Steve Zdancewic