Papers by Mirosław Kurkowski
Using probabilistic automata for security protocols verification
Journal of Applied Mathematics and Computational Mechanics, 2016
Timed Analysis of Security Protocols
Advances in Intelligent Systems and Computing, 2016
Some Remarks on Security Protocols Verification Tools
Advances in Intelligent Systems and Computing, 2016
Control and Cybernetics, Jan 5, 2012
In this paper, we propose a new formal model to describe risk analysis and measurement process fo... more In this paper, we propose a new formal model to describe risk analysis and measurement process for IT systems. Our model complies with international standards and recommendations for non-profit organisations. The model accounts for solutions used in widely known and recommended risk analysis methods and provides for evaluation of efficacy of these solutions. A simple example illustrates the application of the proposed model for effective risk analysis of any IT system. † This is an extended and amended version of the paper, presented at the 5 th Congress of Young IT Scientists (Miȩdzyzdroje, 23-25.IX.2010).
Fundamenta Informaticae, 2007
The paper presents a method of abstraction for timed systems. To extract an abstract model of a t... more The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compression. The idea behind the path compression consists in identifying a path (or a set of paths) on which a process executes a sequence of transitions that do not influence a property being verified, and replacing this path with a single transition. The method is property driven since it depends on a formula in question. The abstraction is exact with respect to all the properties expressible in the temporal logic CTL * −X .
Verification of Mutual Authentication Protocol for MobInfoSec System
Computer Information Systems and Industrial Management, 2015
Rhee/Wireless Mobile Internet Security, 2013
This book contains the proceedings of the 5th European Public Key Infrastructure Workshop: Theory... more This book contains the proceedings of the 5th European Public Key Infrastructure Workshop: Theory and Practice, EuroPKI 2008, which was held on the NTNU campus Gløshaugen in Trondheim, Norway, in June 2008. The EuroPKI workshop series focuses on all research and practice aspects of public key infrastructures, services and applications, and welcomes original research papers and excellent survey contributions from academia, government, and industry. Simply put, public keys are easier to distribute than secret keys. Nevertheless, constructing effective, practical, secure and low cost means for assuring authenticity and validity of public keys used in large-scale networked services remains both a technological and organizational challenge. In a nutshell, this is the PKI problem, and the papers presented herein propose new solutions and insight for these questions. This volume holds 16 refereed papers including the presentation paper by the invited speaker P. Landrock. In response to the EuroPKI 2008 call for papers, a total of 37 paper proposals were received. All submissions underwent a thorough blind review by at least three PC members, resulting in a careful selection and revision of the accepted papers. The authors came from 10 countries: Belgium,
A New Effective Approach for Modelling and Verification of Security Protocols
Parallel Bounded Model Checking of Security Protocols
Lecture Notes in Computer Science, 2014
Lecture Notes in Computer Science
In this paper we show a novel method for modelling behaviours of security protocols using network... more In this paper we show a novel method for modelling behaviours of security protocols using networks of communicating automata in order to verify them with SAT-based bounded model checking. These automata correspond to executions of the participants as well as to their knowledge about letters. Given a bounded number of sessions, we can verify both correctness or incorrectness of a security protocol proving either reachability or unreachability of an undesired state. We exemplify all our notions on the Needham Schroeder Public Key Authentication Protocol (NSPK) and show experimental results for checking authentication using the verification tool VerICS.
Communications in Computer and Information Science, 2014
Mobility of users and information is an important feature of IT systems that must be considered d... more Mobility of users and information is an important feature of IT systems that must be considered during design of sensitive information protection mechanisms. This paper describes an architecture of MobInfoSec system for sharing documents with sensitive information using fine-grained access rules described by general access structures. However, the proper usage of general access structures requires trusted components and strong authentication protocols. They allow to establish secure communication channels between different system components. In the paper we propose a conference protocol based on Boyd's ideas with key transport and key establishment mechanisms. We show that the protocol achieves three goals: (a) the key and participants' mutual authentication, (b) the common secure communication channel, and (c) the personal secure communication channels between the protocol initializer and other protocol participants.
Using Facial Asymmetry Properties and Hidden Markov Models for Biometric Authentication in Security Systems
Lecture Notes in Computer Science, 2014
This work concerns the use of biometric features, resulting from the look of a face, for the auth... more This work concerns the use of biometric features, resulting from the look of a face, for the authentication purposes. For this we propose several different methods of selection and feature analysis during face recognition. The description contains mainly the possibility of the analysis and in later stages also identity verification based on asymmetric facial features. The new authentication method has been introduced on the basis of designated characteristic points of face. The method includes propositions of our own algorithms of face detection, as well as face features extraction methods and their specific coding in the form of observation vectors and recognition using Hidden Markov Models.
Using Backward Induction Techniques in (Timed) Security Protocols Verification
Lecture Notes in Computer Science, 2013
Using Backward Strategy to the Needham-Schroeder Public Key Protocol Verification
Artificial Intelligence and Security in Computing Systems, 2003
... 6,7,8,9]. In this paper we present the application of a new method of verification of cryptog... more ... 6,7,8,9]. In this paper we present the application of a new method of verification of cryptographicauthentication protocols to verification of the Needham-Schroeder Public Key ... NAl_1 (1.out), if A2 knows private key for KA2 NA2_1 (2.in.gen), if A2 is honest {NAl_II NA2_t }KAt (2. ...
A Propositional Logic for Access Control Policy in Distributed Systems
Artificial Intelligence and Security in Computing Systems, 2003
The goal of this paper is to pursue a proposal of the logic-based model for interpreting the basi... more The goal of this paper is to pursue a proposal of the logic-based model for interpreting the basic events and properties of the distributed access control systems. We provide a convenient formal language, an axiomatic inference system, a model of computation, and semantics. We prove some important properties of this logic and show how our logical language can express some access control policies proposed so far.
Towards Parallel Direct SAT-Based Cryptanalysis
Lecture Notes in Computer Science, 2012
ABSTRACT In this paper we show a new approach of parallelised and optimised direct SAT-based cryp... more ABSTRACT In this paper we show a new approach of parallelised and optimised direct SAT-based cryptanalysis for symmetric block ciphers. It is shown how one can code directly in SAT each bit of the plaintext together with its ’route’ through the enciphering algorithm steps, code the round key schedule and S-boxes, and eliminate all simple Boolean equivalences and redundancies. We show Boolean coding directly from the analysed cipher’s source code, with no intermediate step of generating any auxiliary system of multivariate low-degree equations, as it was the case in SAT-enhanced algebraic cryptanalysis of [4]. This contributes to the results in much shorter formulae. Another speed-up effect we get by parallelising the cryptanalytic effort to some 2n available processing cores. We report some experimental results on two basic well known symmetric ciphers.
An Electronic Signature and Hash Functions
Modern Cryptography Primer, 2013
This chapter presents one of the most important uses of cryptography today—electronic signature a... more This chapter presents one of the most important uses of cryptography today—electronic signature algorithms. This is a relatively new alternative to traditional handwritten signatures on paper documents. The electronic signature, analogous to the handwritten signature, is used for signing electronic documents. It can be used online for authentication.
Basic Concepts and Historical Overview
Modern Cryptography Primer, 2013
Cryptography is the science of transforming, or encoding, information into a form non-comprehensi... more Cryptography is the science of transforming, or encoding, information into a form non-comprehensible for anyone who does not know an appropriate key. In such forms information can be securely transferred via any communication channel or stored in data archives with its access restricted or even forbidden (for one reason or another). Cryptography is a part of a broader discipline called cryptology, which includes also so-called cryptanalysis—the art of breaking codes (ciphers), i.e., regaining the content of encrypted messages without an authorized access to the decryption keys.
Cryptographic Applications for Network Security
Modern Cryptography Primer, 2013
This chapter provides an overview of selected practical applications of cryptographic techniques,... more This chapter provides an overview of selected practical applications of cryptographic techniques, presented in the previous chapters, in electronic network and data security protection. It outlines examples of various threats occurring in open telecommunication networks (such as the Internet) and the most well-known examples of software systems for data security, privacy, protection and security of electronic mail.
Foundations of Asymmetric Cryptography
Modern Cryptography Primer, 2013
This chapter presents asymmetric key cryptography, also known as public-key cryptography. It intr... more This chapter presents asymmetric key cryptography, also known as public-key cryptography. It introduces the first asymmetric algorithm, invented by Diffie and Hellman, as well as the ElGamal algorithm. Moreover, we describe in detail a very well-known example of an asymmetric cryptosystem called RSA.
Uploads
Papers by Mirosław Kurkowski