Open AccessOn Some Cryptographic Protocol
Author(s) -
Wit Foryś
Publication year - 2021
Publication title -
schedae informaticae
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.122
H-Index - 4
eISSN - 2083-8476
pISSN - 1732-3916
DOI - 10.4467/20838476si.21.001.14382
Subject(s) - decidability , computer science , cryptographic protocol , protocol (science) , cryptographic primitive , cryptography , set (abstract data type) , theoretical computer science , commutative property , computer security , discrete mathematics , mathematics , programming language , medicine , alternative medicine , pathology
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.