skip to main content
10.1145/3368640.3368668acmotherconferencesArticle/Chapter ViewAbstractPublication PagespciConference Proceedingsconference-collections
short-paper

Security and time insertion

Published: 28 November 2019 Publication History

Abstract

Insertion functions as a tool to guarantee security of processes is discussed and studied. We work with security properties opacity and processes opacity and we investigate how they can be enforced. The insertion function can alter behaviour of the original systems by inserting some actions to guarantee its security. Here we propose time insertion functions which insert time delays to prevent timing attacks.

References

[1]
Jeremy W. Bryans and Maciej Koutny and Laurent Mazaré and Peter Y. A. Ryan. 2004. 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 Computational Models.
[2]
Jeremy W. Bryans and Maciej Koutny and Laurent Mazaré and Peter Y. A. Ryan. 2006. Opacity Generalised to Transition Systems. In Proceedings of the Formal Aspects in Security and Trust, LNCS 3866, Springer, Berlin
[3]
Riccardo Focardi and Roberto Gorrieri and Fabio Martinelli. 2000. Information flow analysis in a discrete-time process algebra.it Proc. 13th Computer Security Foundation Workshop, IEEE Computer Society Press
[4]
Roberto Gorrieri and Fabio Martinelli. 2004. A simple framework for realtime cryptographic protocol analysis with compositional proof rules. Science of Computer Programming Volume 50, Issues 1--3, March, Pages 23--49.
[5]
Joseph Goguen and José Meseguer. 1982 Security Policies and Security Models. In Proc. of IEEE Symposium on Security and Privacy.
[6]
Damas P. Gruska and M. Carmen Ruiz. 2019. Security Testing for Multi-Agent Systems. In WANN 2019, LNCS 11506, Springer.
[7]
Damas P. Gruska and M. Carmen Ruiz. 2018. Opacity-enforcing for Process Algebras. In CS&P'2018.
[8]
Damas P. Gruska. 2015. Process Opacity for Timed Process Algebra. In Perspectives of System Informatics, LNCS 8974.
[9]
Romain Jacob and Jean-Jacques Lesage and Jean-Marc Faure. 2016. Overview of discrete event systems opacity: Models, validation, and quantification. Annual Reviews in Control Volume 41.
[10]
Christoforos Keroglou and Laurie Ricker and Stéphane Lafortune 2018. Insertion Functions with Memory for Opacity Enforcement. IFAC-Papers On Line, Volume 51, Issue 7.
[11]
Robin Milner. Communication and concurrency. Prentice-Hall International, New York.
[12]
Peter J.G. Ramadge and W. Murray Wonham. 1989. The control of discrete event systems. In Proc of the IEEE 77(1) pages 81--98.
[13]
Yi-Chin Wu and Stéphane Lafortune. 2012. Enforcement of opacity properties using insertion functions. In proc. of 51st IEEE Conference on Decision and Control (CDC).

Cited By

View all
  • (2023)Security EnforcingConcurrency, Specification and Programming10.1007/978-3-031-26651-5_6(123-143)Online publication date: 5-May-2023
  • (2022)States of Attack Under Incomplete Information2022 IEEE 12th Annual Computing and Communication Workshop and Conference (CCWC)10.1109/CCWC54503.2022.9720758(0801-0807)Online publication date: 26-Jan-2022
  • (2021)Time Insertion FunctionsAdvances in Model and Data Engineering in the Digitalization Era10.1007/978-3-030-87657-9_14(181-188)Online publication date: 7-Oct-2021

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
PCI '19: Proceedings of the 23rd Pan-Hellenic Conference on Informatics
November 2019
165 pages
ISBN:9781450372923
DOI:10.1145/3368640
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 November 2019

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. information flow
  2. insertion function
  3. opacity
  4. process algebras
  5. security
  6. timing attack

Qualifiers

  • Short-paper

Conference

PCI '19
PCI '19: 23rd Pan-Hellenic Conference on Informatics
November 28 - 30, 2019
Nicosia, Cyprus

Acceptance Rates

PCI '19 Paper Acceptance Rate 18 of 35 submissions, 51%;
Overall Acceptance Rate 190 of 390 submissions, 49%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 07 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Security EnforcingConcurrency, Specification and Programming10.1007/978-3-031-26651-5_6(123-143)Online publication date: 5-May-2023
  • (2022)States of Attack Under Incomplete Information2022 IEEE 12th Annual Computing and Communication Workshop and Conference (CCWC)10.1109/CCWC54503.2022.9720758(0801-0807)Online publication date: 26-Jan-2022
  • (2021)Time Insertion FunctionsAdvances in Model and Data Engineering in the Digitalization Era10.1007/978-3-030-87657-9_14(181-188)Online publication date: 7-Oct-2021

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media