Sciweavers

CSFW
2007
IEEE
14 years 6 months ago
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
Roberto Segala, Andrea Turrini
CSFW
2007
IEEE
14 years 6 months ago
Security Analysis of Voice-over-IP Protocols
The transmission of voice communications as datagram packets over IP networks, commonly known as Voice-overIP (VoIP) telephony, is rapidly gaining wide acceptance. With private ph...
Prateek Gupta, Vitaly Shmatikov
CSFW
2007
IEEE
14 years 6 months ago
Compositional Security for Task-PIOAs
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
CSFW
2007
IEEE
14 years 6 months ago
Do As I SaY! Programmatic Access Control with Explicit Identities
We address the programmatic realization of the access control model of security in distributed systems. Our aim is e the gap between abstract/declarative policies and their concre...
Andrew Cirillo, Radha Jagadeesan, Corin Pitcher, J...
CSFW
2007
IEEE
14 years 6 months ago
Design and Semantics of a Decentralized Authorization Language
Moritz Y. Becker, Cédric Fournet, Andrew D....
CSFW
2007
IEEE
14 years 6 months ago
Causality-based Abstraction of Multiplicity in Security Protocols
Michael Backes, Agostino Cortesi, Matteo Maffei
CSFW
2007
IEEE
14 years 6 months ago
Comparing Countermeasures against Interrupt-Related Covert Channels in an Information-Theoretic Framework
Interrupt-driven communication with hardware devices can be exploited for establishing covert channels. In this article, we propose an information-theoretic framework for analyzin...
Heiko Mantel, Henning Sudbrock
CSFW
2007
IEEE
14 years 6 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
CSFW
2007
IEEE
14 years 6 months ago
Privacy and Utility in Business Processes
se an abstract model of business processes for the purpose of (i) evaluating privacy policy in light of the goals of the process and (ii) developing automated support for privacy ...
Adam Barth, John C. Mitchell, Anupam Datta, Sharad...