Differential Privacy and Security

• Autorzy: Gruska D. P.

Identyfikatory

DOI

10.3233/FI-2016-1304

• Języki publikacji: EN

Abstrakty

EN

A quantification of process’s security by differential privacy is defined and studied in the framework of probabilistic process algebras. The resulting (quantitative) security properties are investigated and compared with other (qualitative and quantitative) security notions.

Słowa kluczowe

EN

differential privacy; probabilistic process algebra; information flow; security; opacity; min-entropy

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2016
• Tom: Vol. 143, nr 1/2
• Strony: 73--87
• Opis fizyczny: Bibliogr. 19 poz.

Twórcy

autor

Gruska D. P.

• Institute of Informatics, Comenius University, Mlynska dolina, 842 48 Bratislava, Slovakia

Bibliografia

• [1] Bryans J.,M. Koutny and P. Ryan: Modelling non-deducibility using Petri Nets. Proc. of the 2nd International Workshop on Security Issues with Petri Nets and other ComputationalModels, 2004.
• [2] Bryans J., M. Koutny, L. Mazare and P. Ryan: Opacity Generalised to Transition Systems. In Proceedings of the Formal Aspects in Security and Trust, LNCS 3866, Springer, Berlin, 2006.
• [3] Clark D., S. Hunt and P. Malacaria: A Static Analysis for Quantifying the Information Flow in a Simple Imperative Programming Language. The Journal of Computer Security, 15(3). 2007.
• [4] Clarkson M.R., A.C. Myers, F.B. Schneider: Quantifying Information Flow with Beliefs. Journal of Computer Security, to appear, 17 (5), 2009.
• [5] Dwork C.: Differential Privacy: A Survey of Results. Proc. Theory and Applications of Models of Computation, LNCS 4978, 2008.
• [6] Focardi R., R. Gorrieri and F. Martinelli: Real-Time information flow analysis. IEEE Journal on Selected Areas in Communications 21 (2003).
• [7] Glabbeek R. J. van, S. A. Smolka and B. Steffen: Reactive, Generative and Stratified Models of Probabilistic Processes Inf. Comput. 121(1): 59-80, 1995.
• [8] Goguen J.A. and J. Meseguer: Security Policies and Security Models. Proc. of IEEE Symposium on Security and Privacy, 1982.
• [9] Gruska D.P.: Gained and Excluded Private Actions by Process Observations. To apear in Fundamenta Informaticae, 2011.
• [10] Gruska D.P.: Quantifying Security for Timed Process Algebras, Fundamenta Informaticae, vol. 93, Numbers 1-3, 2009.
• [11] Gruska D.P.: Probabilistic Information Flow Security. Fundamenta Informaticae, vol. 85, Numbers 1-4, 2008.
• [12] Hansson H. a B. Jonsson: A Calculus for Communicating Systems with Time and Probabilities. In Proceedings of 11th IEEE Real - Time Systems Symposium, Orlando, 1990.
• [13] López N. and Núñez: An Overview of Probabilistic Process Algebras and their Equivalences. In Validation of Stochastic Systems, LNCS 2925, Springer-Verlag, Berlin, 2004.
• [14] Lowe G.: Quantifying information flow”. In Proc. IEEE Computer Security FoundationsWorkshop, 2002.
• [15] Milner R.: Communication and concurrency. Prentice-Hall International, New York,1989.
• [16] Segala R. and N. Lynch: Probabilistic Simulations for Probabilistic Processes. Nord. J. Comput. 2(2): 250-273, 1995.
• [17] Smith G.: Quantifying Information Flow Using Min-Entropy. QEST, 2011.
• [18] Xu L.: Modular reasoning about differential privacy in a probabilistic process calculus. In TGC, pages 198212, 2012.
• [19] Xu L., K. Chatzikokolakis, H. Lin and Catuscia Palamidessi: Metrics for Differential Privacy in Concurrent Systems, In Proceedings of HotSpot, 2014.