Process Opacity for Timed Process Algebra

被引：4
|
作者：
Gruska, Damas P. [1 ]
机构：
[1] Comenius Univ, Inst Informat, Bratislava 84248, Slovakia
来源：
PERSPECTIVES OF SYSTEM INFORMATICS, PSI 2014 | 2015年 / 8974卷
关键词：
Process opacity; Process algebras; Information flow; Security; SECURITY;
D O I：
10.1007/978-3-662-46823-4_13
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A new security concept called process opacity is formalized and studied. For processes which are process opaque with respect to a given predicate over processes, an intruder cannot learn validity of this predicate for any subsequent state of computation. We discuss different extensions of this concept as well as its properties. We put some restrictions on predicates in such a way that we obtain decidable security properties.
引用
收藏
页码：151 / 160
页数：10
相关论文
共 50 条
  • [11] Timed process algebra (With a focus on explicit termination and relative-timing)
    Baeten, JCM
    Reniers, MA
    [J]. FORMAL METHODS FOR THE DESIGN OF REAL-TIME SYSTEMS, 2004, 3185 : 59 - 97
  • [12] Forgetting the Time in Timed Process Algebra Timeless Behaviour in a Timestamped World
    Wijs, Anton
    [J]. FORMAL TECHNIQUES FOR DISTRIBUTED SYSTEMS, PROCEEDINGS, 2010, 6117 : 110 - 124
  • [13] Verification of Timed Erlang/OTP Components Using the Process Algebra μCRL
    Guo, Qiang
    Derrick, John
    [J]. ERLANG'07: PROCEEDINGS OF THE 2007 SIGPLAN ERLANG WORKSHOP, 2007, : 55 - 64
  • [14] A Timed Process Algebra for Wireless Networks with an Application in Routing (Extended Abstract)
    Bres, Emile
    van Glabbeek, Rob
    Hofner, Peter
    [J]. PROGRAMMING LANGUAGES AND SYSTEMS (ESOP 2016), 2016, 9632 : 95 - 122
  • [15] Abstracting IoT protocols using timed process algebra and SPIN model checker
    Kumar, N. Suresh
    Kumar, G. Santhosh
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2023, 26 (02): : 1611 - 1629
  • [16] Abstracting IoT protocols using timed process algebra and SPIN model checker
    N. Suresh Kumar
    G. Santhosh Kumar
    [J]. Cluster Computing, 2023, 26 : 1611 - 1629
  • [17] A consistent causality-based view on a timed process algebra including urgent interactions
    Katoen, JP
    Langerak, R
    Brinksma, E
    Latella, D
    Bolognesi, T
    [J]. FORMAL METHODS IN SYSTEM DESIGN, 1998, 12 (02) : 189 - 216
  • [18] A Consistent Causality-Based View on a Timed Process Algebra Including Urgent Interactions
    Joost-Pieter Katoen
    Rom Langerak
    Ed Brinksma
    Diego Latella
    Tommaso Bolognesi
    [J]. Formal Methods in System Design, 1998, 12 : 189 - 216
  • [19] Modeling and analyzing Web services composition using timed probabilistic priced process algebra
    Xiao, Fang-Xiong
    Li, Yan
    Huang, Zhi-Qiu
    Cao, Zi-Ning
    Chen, Zhe
    Fan, Da-Juan
    [J]. Jisuanji Xuebao/Chinese Journal of Computers, 2012, 35 (05): : 918 - 936
  • [20] 'Closed interval process algebra' versus 'Interval process algebra'
    Corradini, F
    Pistore, M
    [J]. ACTA INFORMATICA, 2001, 37 (07) : 467 - 510
12345