scholarly journals Key agreement protocol in Braid group representation level

2021 ◽  
Vol 47 ◽  
Author(s):  
Povilas Tvarijonas ◽  
Eligijus Sakalauskas ◽  
Gediminas Simonas Dosinas
Keyword(s):  
Braid Group ◽  
Key Agreement ◽  
Group Representation ◽  
Braid Groups ◽  
Key Agreement Protocol ◽  
The One ◽  
Representation Level

In this paper the key agreement protocol is given and the applicationof it in Braid groups is suggested. The one way of protocol is being justified.

scholarly journals Security analysis of key agreement protocol based on matrix power function

2012 ◽  
Vol 53 ◽  
Author(s):  
Paulius Vitkus ◽  
Eligijus Sakalauskas
Keyword(s):  
Power Function ◽  
Key Agreement ◽  
Security Analysis ◽  
Braid Groups ◽  
Quadratic Problem ◽  
Key Agreement Protocol ◽  
Np Complete ◽  
Matrix Power ◽  
The One ◽  
One Way Function

Key agreement protocol (KAP) using Burau braid groups representation and matrix power function (MPF) is analyzed. MPF arguments are Burau representation matrices defined over finite field or ring. It is shown that KAP security relies on the solution of matrix multivariate quadratic system of equations over the ring with additional commutation constraints for matrices to be found. We are making a conjecture that proposed KAP is a candidate one-way function since its inversion is related with the solution of known multivariate quadratic problem which is NP-complete over any field. The one of advantages of proposed KAP is its possible effective realization even in restricted computational environments by avoiding arithmetic operations with big integers.

scholarly journals Attack on Kayawood protocol: uncloaking private keys

2020 ◽  
Vol 15 (1) ◽  
pp. 237-249
Author(s):  
Matvei Kotov ◽  
Anton Menshov ◽  
Alexander Ushakov
Keyword(s):  
Heuristic Algorithm ◽  
Braid Group ◽  
Key Agreement ◽  
Private Key ◽  
The Core ◽  
Key Agreement Protocol ◽  
Finite Set ◽  
Security Properties ◽  
The Right ◽  
Parameter Values

AbstractWe analyze security properties of a two-party key-agreement protocol recently proposed by I. Anshel, D. Atkins, D. Goldfeld, and P. Gunnels, called Kayawood protocol. At the core of the protocol is an action (called E-multiplication) of a braid group on some finite set. The protocol assigns a secret element of a braid group to each party (private key). To disguise those elements, the protocol uses a so-called cloaking method that multiplies private keys on the left and on the right by specially designed elements (stabilizers for E-multiplication).We present a heuristic algorithm that allows a passive eavesdropper to recover Alice’s private key by removing cloaking elements. Our attack has 100% success rate on randomly generated instances of the protocol for the originally proposed parameter values and for recent proposals that suggest to insert many cloaking elements at random positions of the private key. Implementation of the attack is available on GitHub.

scholarly journals Key agreement protocol in infinite semigroup representation level

2007 ◽  
Vol 47 ◽  
Author(s):  
Artūras Katvickis ◽  
Eligijus Sakalauskas ◽  
Kastytis Ratkevičius
Keyword(s):  
Key Agreement ◽  
Matrix Decomposition ◽  
Computer Memory ◽  
Decomposition Problem ◽  
Computational Problem ◽  
Key Agreement Protocol ◽  
Integer Ring ◽  
Memory Resources ◽  
Representation Level

Matrix decomposition problem over integer ring is presented. Solving methods are discussed and it is showed, that this problem is hard computational problem regard to computer memory resources. A key agreement protocol based on matrix decomposition problem is presented.

Enhanced Attribute-Based Authenticated Key Agreement Protocol in the Standard Model

2014 ◽  
Vol 36 (10) ◽  
pp. 2156-2167
Author(s):  
Qiang LI ◽  
Deng-Guo FENG ◽  
Li-Wu ZHANG ◽  
Zhi-Gang GAO
Keyword(s):  
Standard Model ◽  
Key Agreement ◽  
Authenticated Key Agreement ◽  
Key Agreement Protocol ◽  
The Standard Model

scholarly journals Secure multiparty quantum key agreement against collusive attacks

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Hussein Abulkasim ◽  
Atefeh Mashatan ◽  
Shohini Ghose
Keyword(s):  
Key Agreement ◽  
Sensitive Information ◽  
Quantum Key Agreement ◽  
Key Agreement Protocol ◽  
Proposed Model ◽  
Shared Key ◽  
Agreement Protocols ◽  
Collusive Attacks ◽  
Attack Strategy ◽  
Collusive Attack

AbstractQuantum key agreement enables remote participants to fairly establish a secure shared key based on their private inputs. In the circular-type multiparty quantum key agreement mode, two or more malicious participants can collude together to steal private inputs of honest participants or to generate the final key alone. In this work, we focus on a powerful collusive attack strategy in which two or more malicious participants in particular positions, can learn sensitive information or generate the final key alone without revealing their malicious behaviour. Many of the current circular-type multiparty quantum key agreement protocols are not secure against this collusive attack strategy. As an example, we analyze the security of a recently proposed multiparty key agreement protocol to show the vulnerability of existing circular-type multiparty quantum key agreement protocols against this collusive attack. Moreover, we design a general secure multiparty key agreement model that would remove this vulnerability from such circular-type key agreement protocols and describe the necessary steps to implement this model. The proposed model is general and does not depend on the specific physical implementation of the quantum key agreement.

Sign in / Sign up

Export Citation Format

Share Document