Process Opacity and Insertion Functions

Time insertion functions as a way how to guarantee state-based security with respect to timing attacks are proposed and studied. As regards the security property, we work with the property called process opacity. First, we define timing attacks and later we show how security with respect to them can be enforced by such functions. The time insertion function can alter the time behaviour of the original system by inserting some time delays to guarantee its security. We investigate conditions under which such functions do exist and also some of their properties.

[1]  Damas P. Gruska.  Security and time insertion , 2019, PCI.

[2]  Jean-Jacques Lesage,et al.  Overview of discrete event systems opacity: Models, validation, and quantification , 2016, Annu. Rev. Control..

[3]  Paul C. Kocher,et al.  Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems , 1996, CRYPTO.

[4]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[5]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[6]  Maciej Koutny,et al.  Opacity generalised to transition systems , 2005, International Journal of Information Security.

[7]  J. Quisquater,et al.  A Practical Implementation of the Timing Attack , 1998, CARDIS.

[8]  Damas P. Gruska.  Time Insertion Functions , 2021, MEDI Workshops.

[9]  Stéphane Lafortune,et al.  Enforcing opacity by insertion functions under multiple energy constraints , 2019, Autom..

[10]  Howard M. Heys,et al.  A Timing Attack on RC5 , 1998, Selected Areas in Cryptography.

[11]  Dawn Xiaodong Song,et al.  Timing Analysis of Keystrokes and Timing Attacks on SSH , 2001, USENIX Security Symposium.

[12]  Marcos A. Kiwi,et al.  Strength of two data encryption standard implementations under timing attacks , 1998, TSEC.

[13]  Maciej Koutny,et al.  Modelling Opacity Using Petri Nets , 2005, WISP@ICATPN.

[14]  Roberto Gorrieri,et al.  A simple framework for real-time cryptographic protocol analysis with compositional proof rules , 2004, Sci. Comput. Program..

[15]  Roberto Gorrieri,et al.  Information flow analysis in a discrete-time process algebra , 2000, Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13.

[16]  Stéphane Lafortune,et al.  Enforcement of opacity properties using insertion functions , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[17]  Jana Kosecka,et al.  Control of Discrete Event Systems , 1992 .

[18]  M. Carmen Ruiz,et al.  Opacity-enforcing for Process Algebras , 2018, CS&P.

[19]  Christoforos Keroglou,et al.  Embedded Insertion Functions for Opacity Enforcement , 2021, IEEE Transactions on Automatic Control.

[20]  Gorjan Alagic,et al.  #p , 2019, Quantum information & computation.

[21]  Christoforos Keroglou,et al.  Insertion Functions with Memory for Opacity Enforcement , 2018 .

[22]  Damas P. Gruska.  Process Opacity for Timed Process Algebra , 2014, Ershov Memorial Conference.