Wyniki wyszukiwania - BazTech

1

On Some Cryptographic Protocol

Foryś Wit

Schedae Informaticae

|

2021

|

Vol. 30

9--15

EN

In this paper we present a cryptographic protocol for a seller – buyer problem and in particular we prove that non-emptiness of a semi-commutative set defined by mappings involved in the protocol is a decidable problem.

2

Protocols for The Meeting Businessmen Problem

Challita K.

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

|

2013

|

Vol. 13, no. 1

37--47

EN

Assume that some businessmen wish to have a meeting. For this to occur, they usually have to meet somewhere. If they cannot meet physically, then they can take part in a video (or audio) conference to discuss whatever needs to be discussed. But what if their meeting is meant to be private? In this case they need a cryptographic protocol that allows them to exchange their ideas remotely, while keeping them secure from any potential eavesdropper. In this paper we list all the necessary requirements that a cryptographic protocol must have in order to allow several businessmen to exchange their ideas securely over the Internet. Moreover, and based on the standard taxonomy of cryptographic protocols, we suggest several approaches on how to design cryptographic protocols that enable us to achieve our aim. Finally, we propose the design of a protocol that solves the meeting businessmen problem.

3

The Meeting Businessmen Problem: Requirements and Limitations

Challita K.

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

|

2012

|

Vol. 12, no. 1

67--77

EN

Let us assume that some businessmen wish to have a meeting. For this to happen, they usually have to meet somewhere. If they cannot meet physically, then they can take part in a video (or audio) conference to discuss whatever needs to be discussed. But what if their meeting is meant to be private? In this case they need a cryptographic protocol that allows them to exchange their ideas remotely, while keeping them secure from any potential eavesdropper. In this paper we list all the necessary requirements that a cryptographic protocol must have in order to allow several businessmen to exchange their ideas securely over the Internet. Moreover, and based on the standard taxonomy of cryptographic protocols, we suggest several approaches on how to design cryptographic protocols that enable us to achieve our aim. Finally, we propose the design of a protocol that solves the meeting businessmen problem.

4

On the modelling of Kerberos protocol in the Quality of Protection Modelling Language (QoP-ML)

Księżopolski B., Rusinek D., Wierzbicki A.

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

|

2012

|

Vol. 12, no. 4

69--81

EN

The security modelling of IT systems is a very complicated task. One of the issues which must be analysed is the performance of IT systems. In many cases the guaranteed security level is too high in relation to the real threats. The overestimation of security measures can decrease system performance. The paper presents the analysis of Kerberos cryptographic protocol in terms of quality of protection performed by Quality of Protection Modelling Language (QoP-ML). The analysis concerns the availability attribute. In the article the Kerberos protocol was modelled and the QoP analysis of two selected versions was performed.

5

On some specification languages of cryptographic protocols

Dudek P., Kurkowski M.

Scientific Issues of Jan Długosz University in Częstochowa. Mathematics

|

2010

|

Vol. 15

121--130

EN

A key element of the security systems in computer networks are cryptographic protocols (CP). These protocols are concurrent algorithms used to provide relevant system security goals. Their main purpose is, for example, amutual authentication (identification) of communicating parties (users, servers), distribution of new keys and session encryption. Literature indicates numerous errors in protocol constructions. Thus, there is a need to create methods for CP specification and verification. In this paper, we investigate a problem of CP specification. The paper discusses the so-called Common Language - the simplest language of CP specification and HLPSL - a specification language used in the European verification project Avispa. Finally, we introduce PTL - the new language developed for CP specification which allows fully automatic verification.