Download:
by Alessandro Aldini, Alessandra Di Pierro
http://www.di.unipi.it/~dipierro/papers/qapl04.pdf
Add To MetaCart
Abstract:
We advocate the use of approximate noninterference for the security analysis of probabilistic protocols. Our approach relies on a formalisation of the protocol in the setting of a probabilistic process algebra and a notion of process similarity based on weak probabilistic bisimulation. We illustrate this approach by presenting the analysis of a probabilistic nonrepudiation protocol which allows us to quantitatively estimate its fairness degree.
Citations
|
2762
|
R.: Communication and Concurrency
– Milner
- 1989
|
|
432
|
Security policy and security models
– Goguen, Meseguer
- 1982
|
|
80
|
Probabilistic noninterference for multithreaded programs
– Sabelfeld, Sands
- 2000
|
|
69
|
Probabilistic Noninterference in a Concurrent Language
– Volpano, Smith
- 1998
|
|
67
|
H.: Approximate non-interference
– Pierro, Hankin, et al.
- 2004
|
|
30
|
A process algebraic approach for the analysis of probabilistic non-interference
– Aldini, Bravetti, et al.
|
|
27
|
A classification of security properties
– Focardi, Gorrieri
- 1995
|
|
27
|
Probabilistic Non-repudiation without Trusted Third Party
– Markowitch, Roggeman
- 1999
|
|
14
|
Compositional asymmetric cooperations for process algebras with probabilities, priorities, and time
– Bravetti, Bernardo
- 2000
|
|
11
|
Security analysis of a probabilistic non-repudiationprotocol
– Aldini, Gorrieri
- 2002
|
|
7
|
Probabilistic Confinement in a Declarative Framework
– Pierro, Hankin, et al.
- 2001
|
|
6
|
Two Formal Approaches for Approximating Noninterference
– Aldini, Bravetti, et al.
- 2004
|
|
4
|
A Quantitative Approach to Noninterference for Probabilistic Systems
– Aldini, Pierro
- 2004
|
|
4
|
Discrete Time Generative-reactive Probabilistic Processes with Different Advancing Speeds, Theoretical Computer Science 290(1):355–406
– Bravetti, Aldini
- 2003
|
|
3
|
Weak Bisimulation for Fully Probabilistic
– Baier, Hermanns
- 1997
|
