CSFW
2007
IEEE
13 years 11 months ago
2007
IEEE
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...
CSFW
2007
IEEE
13 years 11 months ago
2007
IEEE
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...
CSFW
2007
IEEE
13 years 11 months ago
2007
IEEE
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...
CSFW
2007
IEEE
13 years 11 months ago
2007
IEEE
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...
CSFW
2007
IEEE
13 years 11 months ago
2007
IEEE
CSFW
2007
IEEE
13 years 11 months ago
2007
IEEE
CSFW
2007
IEEE
13 years 11 months ago
2007
IEEE
Interrupt-driven communication with hardware devices can be exploited for establishing covert channels. In this article, we propose an information-theoretic framework for analyzin...
CSFW
2007
IEEE
13 years 11 months ago
2007
IEEE
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
CSFW
2007
IEEE
13 years 11 months ago
2007
IEEE
CSFW
2007
IEEE
13 years 11 months ago
2007
IEEE
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 ...