Sigma Identification Protocol Construction Based on MPF Defined over Non-Commuting Platform Group

In this paper, we present the construction of a sigma identification protocol based on matrix power function (MPF) defined over a certain non-commuting platform group. We use the previously defined templates for generating public parameters of our protocol to overcome the problem that a two-sided MP...

Full description

Saved in:
Bibliographic Details
Published inMathematics (Basel) Vol. 10; no. 15; p. 2649
Main Authors Mihalkovich, Aleksejus, Luksys, Kestutis, Sakalauskas, Eligijus
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.08.2022
Subjects
Asymptotic properties
Commuting
Cryptography
Eavesdropping
Knowledge
matrix power function
non-commuting cryptography
Protocol
sigma identification protocol
Online AccessGet full text

Cover

More Information
Summary:In this paper, we present the construction of a sigma identification protocol based on matrix power function (MPF) defined over a certain non-commuting platform group. We use the previously defined templates for generating public parameters of our protocol to overcome the problem that a two-sided MPF in general is not associative. We prove that the proposed sigma identification protocol is resistant to eavesdropping adversary attacks. Furthermore, relying on the asymptotic knowledge soundness property proven in this paper, we show that our protocol is also resistant against active adversary attacks with an overwhelming probability.
ISSN:2227-7390
2227-7390
DOI:10.3390/math10152649