102 Hits in 6.3 sec

A logic for constraint-based security protocol analysis

R. Corin, A. Saptawijaya
2006 2006 IEEE Symposium on Security and Privacy (S&P'06)  
A preliminary attempt to use logic for specifying local security properties in a constraint-based setting has been carried out [3] .  ...  Inspired by this work and the successful NPATRL [11, 8] , we currently explores a variant of linear temporal logic (LTL) over finite traces, PS-LTL , standing for pure-past security LTL [5] .  ...  Another direction is to characterize the expressivity power of PS-LTL compared to other security requirement languages.  ... 
doi:10.1109/sp.2006.3 dblp:conf/sp/CorinES06 fatcat:ooxcdxojy5gwlaaais2kd6alsu

Safely composing security protocols

Véronique Cortier, Stéphanie Delaune
2008 Formal methods in system design  
This result holds for a large class of security properties that encompasses secrecy and various formulations of authentication. ⋆ This work has been partly supported by the RNTL project POSÉ and the ARA  ...  Security protocols are small programs that are executed in hostile environments.  ...  Writing Security Properties with PS-LTL In this section, we show how to specify several security properties in PS-LTL -.  ... 
doi:10.1007/s10703-008-0059-4 fatcat:vow3ijjsxvhptcscqzoxtp33ku

Safely Composing Security Protocols [chapter]

Véronique Cortier, Jérémie Delaitre, Stéphanie Delaune
2007 Lecture Notes in Computer Science  
This result holds for a large class of security properties that encompasses secrecy and various formulations of authentication. ⋆ This work has been partly supported by the RNTL project POSÉ and the ARA  ...  Security protocols are small programs that are executed in hostile environments.  ...  Writing Security Properties with PS-LTL In this section, we show how to specify several security properties in PS-LTL -.  ... 
doi:10.1007/978-3-540-77050-3_29 fatcat:gfizaotqerb6tbadmshvgqbhna

A Static Verification Framework for Secure Peer-to-Peer Applications

Andrea Zisman
2007 Second International Conference on Internet and Web Applications and Services (ICIW'07)  
The approach avoids security issues to be taken into consideration as a separate layer that is added to the system as an afterthought by the use of security protocols.  ...  The framework supports the specification, modeling, and analysis of security aspects together with the general characteristics of the system, during early stages of the development life-cycle.  ...  Techniques for secure software code analysis and testing have been advocated in [6] [7] [30] .  ... 
doi:10.1109/iciw.2007.11 dblp:conf/iciw/Zisman07 fatcat:ctrexhk7hrbgxj5wxr573xhgeu

Real-Time Specification Patterns and Tools [chapter]

Nouha Abid, Silvano Dal Zilio, Didier Le Botlan
2012 Lecture Notes in Computer Science  
However, only a limited number of these formalisms support the definition of timing constraints.  ...  This has motivated the definition of dedicated assertion languages for expressing temporal properties at a higher level.  ...  The scenario involves three entities, each one managed by a service: a Clinic Service (CS); a Medical Analysis Service (MAS); and a Pharmacy Service (PS).  ... 
doi:10.1007/978-3-642-32469-7_1 fatcat:awks3ietmvax3byog4uraspsvq

Two Decades of Maude [chapter]

Manuel Clavel, Francisco Durán, Steven Eker, Santiago Escobar, Patrick Lincoln, Narciso Martí-Oliet, Carolyn Talcott
2015 Lecture Notes in Computer Science  
This paper is a tribute to José Meseguer, from the rest of us in the Maude team, reviewing the past, the present, and the future of the language and system with which we have been working for around two  ...  As for a more interesting application of rewriting modulo SMT, let us consider the case of distance-bounding protocols [10] , a class of security protocols that infer an upper bound on the distance between  ...  the security analysis is performed in a backwards way, from an attack state to an initial state.  ... 
doi:10.1007/978-3-319-23165-5_11 fatcat:cre7i55r4reg3indrng3w5fgqa

Benchmark Tests For The Model-Checking-Based IDS Algorithms

Miaolei Deng, Heling Cao, Weijun Zhu, Huanmei Wu, Yangyue Zhou
2019 IEEE Access  
A fundamental concern for the security community is to identify the comprehensive comparable performance of various intrusion detection algorithms which are based on the Model Checking (MC) techniques.  ...  It is beneficial for selecting the suitable MC-based algorithms in actual deployment of intrusion detection systems.  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers and editors for the constructive and insightful comments for improving the quality of this paper.  ... 
doi:10.1109/access.2019.2939011 fatcat:cndl7nxs4vcrdizvqyoimhkitu

A rewriting logic approach to the formal specification and verification of web applications

María Alpuente, Demis Ballis, Daniel Romero
2014 Science of Computer Programming  
our scripting language is powerful enough to model the dynamics of complex Web applications, where the interactions among Web servers and Web browsers are formalized through a landmark communicating protocol  ...  This paper develops a Rewriting Logic framework for the automatic specification and verification of Web applications that considers the critical aspects of concurrent Web interactions, browser navigation  ...  Acknowledgments We would like to thank María del Mar Gallardo for many useful comments and suggestions.  ... 
doi:10.1016/j.scico.2013.07.014 fatcat:7opzjjrfvvelfo7bjs7fq7ckwa

Automatic Vulnerability Checking of IEEE 802.16 WiMAX Protocols through TLA+

Prasad Narayana, Ruiming Chen, Yao Zhao, Yan Chen, Zhi Fu, Hai Zhou
2006 2006 2nd IEEE Workshop on Secure Network Protocols  
Formal methods are proposed for vulnerability analysis and most existing work focus on security properties such as perfect forwarding secrecy and correctness of authentication.  ...  Vulnerability analysis is indispensably the first step towards securing a network protocol, but currently remains mostly a best effort manual process with no completeness guarantee.  ...  For example, Lowe [2] used CSP and FDR, Shmatikov and Stern [3] used Murφ, and Corin et al. [4] used symbolic traces and PS-LTL. However, non-security network protocols are mostly ignored.  ... 
doi:10.1109/npsec.2006.320346 fatcat:akvfbhh7vbfgpm242fxuprmh5a

A Reduced Semantics for Deciding Trace Equivalence [article]

David Baelde and Stéphanie Delaune and Lucca Hirschi
2017 arXiv   pre-print
Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras.  ...  It has been shown that such properties can be decided for interesting classes of finite processes (i.e., without replication) by means of symbolic execution and constraint solving.  ...  We would like to thank Vincent Cheval for interesting discussions and comments, especially on Section 6.  ... 
arXiv:1704.08540v4 fatcat:he2qcf4cznep3h2dmu2zbo3554

A formal framework to specify and verify real-time properties on critical systems

Nouha Abid, Silvano Dal Zilio, Didier Le Botlan
2014 International Journal of Critical Computer-Based Systems  
We focus on properties commonly found during the analysis of reactive systems, expressed using real-time specification patterns.  ...  We use observers in order to transform the verification of these timed patterns into the verification of simpler LTL formulas.  ...  The first program is a graphical animator for Time Petri Net, while the latter is an interactive (text-based) animator for the full TTS model. Avionic Protocol and AADL.  ... 
doi:10.1504/ijccbs.2014.059593 fatcat:kaifli6ulbdmnibscw4u2hijfe

A Program Logic for Verifying Secure Routing Protocols [chapter]

Chen Chen, Limin Jia, Hao Xu, Cheng Luo, Wenchao Zhou, Boon Thau Loo
2014 Lecture Notes in Computer Science  
In this paper, we develop a sound program logic for SANDLog-a declarative specification language for secure routing protocols-for verifying properties of these protocols.  ...  As the number of models is infinite, model-checking-based tools, in general, cannot be used to prove the protocol secure.  ...  We implement VCGen for automatically generating proof obligations and integrate VCGen into a compiler for SANDLog (Section 4).  ... 
doi:10.1007/978-3-662-43613-4_8 fatcat:vplnxqhqhrdwlg547ogjlvclka

An Approach to Securely Identifying Beneficial Collaboration in Decentralized Logistics Systems

Chris Clifton, Ananth Iyer, Richard Cho, Wei Jiang, Murat Kantarcıoğlu, Jaideep Vaidya
2008 Manufacturing & Service Operations Management  
We also show that it is incentive compatible for each company to correctly follow the protocol as well as provide their true data.  ...  We present an algorithm that finds opportunities to swap loads without revealing any information except the loads swapped, along with proofs of the security of the protocol.  ...  Acknowledgments The authors thank Reha Uzsoy for contributions made to the formulation of this problem in initial discussions of the work.  ... 
doi:10.1287/msom.1070.0167 fatcat:fbat6n2davgi3dzfhl36mwwdbe

Formal semantics of behavior specifications in the architecture analysis and design language standard

Loıc Besnard, Thierry Gautier, Clement Guy, Paul Le Guernic, Jean-pierre Talpin, Brian R. Larson, Etienne Borde
2016 2016 IEEE International High Level Design Validation and Test Workshop (HLDVT)  
Such a repository enables automatic generation of analytical models for different aspects relevant to system design (timing, reliability, security, etc.).  ...  Formal semantics of behavior specifications in the architecture analysis and design language standard.  ...  The authors wish to thank Pierre Dissaux and the SAE sub-committee on the AADL for supporting this work with valuable comments on the model and method presented in this paper.  ... 
doi:10.1109/hldvt.2016.7748252 dblp:conf/hldvt/BesnardGGGTLB16 fatcat:cl2xk665zbhmbhoe7nh6evg2vy

HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties [article]

Erika Abraham, Borzoo Bonakdarpour
2018 arXiv   pre-print
A model checking algorithm for the proposed logic is also given for discrete-time Markov chains.  ...  In this paper, we propose a new logic for expressing and reasoning about probabilistic hyperproperties. Hyperproperties characterize the relation between different independent executions of a system.  ...  Acknowledgments We thank Boris Köpf for his valuable insights on expressing QIF policies.  ... 
arXiv:1804.01853v1 fatcat:qpj2jormfvfpnhucsfmvop2saq
« Previous Showing results 1 — 15 out of 102 results