Abstract
Non-interference is a definition of security introduced for the analysis of confidential information flow in computer systems. In this paper, a probabilistic notion of non-interference is used to reveal information leakage which derives from the probabilistic behavior of systems. In particular, as a case study, we model and analyze a non-repudiation protocol which employs a probabilistic algorithm to achieve a fairness property. The analysis, conducted by resorting to a definition of probabilistic non-interference in the context of process algebras, confirms that a solely nondeterministic approach to the information flow theory is not enough to study the security guarantees of cryptographic protocols.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Aldini, “Probabilistic Information Flow in a Process Algebra”, in Proc. of the 12th Int. Conf. on Concurrency Theory, LNCS 2154, pp. 152–168, Springer-Verlag, 2001
A. Aldini, “On the Extension of Non-interference with Probabilities”, 2nd ACM SIGPLAN and IFIP WG 1.7 Workshop on Issues in the Theory of Security, 2002
A. Aldini, M. Bravetti, “An Asynchronous Calculus for Generative-Reactive Probabilistic Systems”, in Proc. of the 8th Int. Workshop on Process Algebra and Performance Modeling, pp. 591–605, Carleton Scientific, 2000
A. Aldini, M. Bravetti, R. Gorrieri, “A Process Algebraic Approach for the Analysis of Probabilistic Non-interference”, Technical Report UBLCS-2002-2, University of Bologna, Italy, 2002, ftp://ftp.cs.unibo.it/pub/techreports/
C. Baier, H. Hermanns, “Weak Bisimulation for Fully Probabilistic Processes”, in Proc. of the 9th Int. Conf. on Computer Aided Verification, LNCS 1254, pp. 119–130, Springer-Verlag, 1997
C. Baier, M. Kwiatkowska, “Domain Equations for Probabilistic Processes”, in Mathematical Structures in Computer Science 10(6), pp. 665–717, 2000
F. van Breugel, J. Worrell, “Towards Quantitative Verification of Probabilistic Systems (extended abstract)”, in Proc. of the 28th International Colloquium on Automata, Languages and Programming, LNCS 2076, pp. 421–432, Springer-Verlag, 2001
J. Desharnais, V. Gupta, R. Jagadeesan, P. Panangaden, “Metrics for Labeled Markov Processes”, in Proc. of the 10th Int. Conf. on Concurrency Theory, LNCS 1664, pp. 258–273, Springer-Verlag, 1999
A. Di Pierro, C. Hankin, H. Wiklicky, “On Approximate Non-Interference”, 2nd ACM SIGPLAN and IFIP WG 1.7 Workshop on Issues in the Theory of Security, 2002
R. Focardi, R. Gorrieri, “A Classification of Security Properties”, Journal of Computer Security, 3(1):5–33, 1995
R. Focardi, R. Gorrieri, “Classification of Security Properties (Part I: Information Flow)”, Foundations of Security Analysis and Design-Tutorial Lectures (R. Focardi and R. Gorrieri, Eds.), LNCS 2171, pp. 331–396, Springer-Verlag, 2001
R. Focardi, R. Gorrieri, F. Martinelli, “Non Interference for the Analysis of Cryptographic Protocols”, in Proc. of the 27th International Colloquium on Automata, Languages and Programming, LNCS 1853, pp. 354–372, Springer-Verlag, 2000
R.J. van Glabbeek, S.A. Smolka, B. Steffen, “Reactive, Generative and Stratified Models of Probabilistic Processes”, in Information and Computation 121:59–80, 1995
J.A. Goguen, J. Meseguer, “Security Policy and Security Models”, in Proc. of Symposium on Security and Privacy, pp. 11–20, IEEE CS Press, 1982
J.W. Gray III, “Toward a Mathematical Foundation for Information Flow Security”, Journal of Computer Security, 1:255–294, 1992
Y. Han, “Investigation of Non-repudiation Protocols”, in ACISP: Information Security and Privacy: Australasian Conference, LNCS 1172, pp. 38–47, Springer-Verlag, 1996
O. Markowitch, Y. Roggeman, “Probabilistic Non-Repudiation without Trusted Third Party”, 2nd Conference on Security in Communication Networks, Amalfi, Italy, 1999
R. Milner, “Communication and Concurrency”, Prentice Hall, 1989
P.Y.A. Ryan, “A CSP Formulation of Non-Interference”, Cipher, pp. 19–27, IEEE CS Press, 1991
A. Sabelfeld, D. Sands, “Probabilistic Noninterference for Multi-threaded Programs”, in Proc. of the 13th Computer Security Foundations Workshop, IEEE CS Press, 2000
R. Segala, N.A. Lynch, “Probabilistic Simulations for Probabilistic Processes”, in Proc. of the 5th Int. Conf. on Concurrency Theory, LNCS 836, pp. 481–496, Springer-Verlag, 1994
G. Smith, “Weak Probabilistic Bisimulation for Secure Information Flow”, 2nd ACM SIGPLAN and IFIP WG 1.7 Workshop on Issues in the Theory of Security, 2002
J. Zhou, D. Gollmann, “An Efficient Non-repudiation Protocol”, in Proc. of the 10th Computer Security Foundations Workshop, pp. 126–132, IEEE CS Press, 1997
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aldini, A., Gorrieri, R. (2002). Security Analysis of a Probabilistic Non-repudiation Protocol. In: Hermanns, H., Segala, R. (eds) Process Algebra and Probabilistic Methods: Performance Modeling and Verification. PAPM-PROBMIV 2002. Lecture Notes in Computer Science, vol 2399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45605-8_3
Download citation
DOI: https://doi.org/10.1007/3-540-45605-8_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43913-4
Online ISBN: 978-3-540-45605-6
eBook Packages: Springer Book Archive