An Authenticated Key Agreement Scheme using Vector Decomposition

2016 ◽  
Vol 66 (6) ◽  
pp. 594 ◽  
Author(s):  
I. Praveen ◽  
K. Rajeev ◽  
M. Sethumadhavan
Keyword(s):  
Key Agreement ◽  
Discrete Logarithm ◽  
Dimensional Subspace ◽  
Dimensional Vector ◽  
Authenticated Key Agreement ◽  
Decomposition Problem ◽  
One Dimensional ◽  
Diffie Hellman ◽  
Vector Decomposition ◽  
Higher Dimensional

Encryption using vector decomposition problem (VDP) on higher dimensional vector spaces is a novel method in cryptography. Yoshida has shown that the VDP on a two-dimensional vector space is at least as hard as the computational Diffie-Hellman problem on a one-dimensional subspace under certain conditions. Steven Galbraith has shown that for certain curves, the VDP is at most as hard as the discrete logarithm problem on a one-dimensional subspace. Okomoto and Takashima proposed encryption scheme and signature schemes using VDP. An authenticated key agreement scheme using vector decomposition problem is proposed in this paper

scholarly journals A Novel Provably Secure Key-Agreement Using Secret Subgroup Generator

2021 ◽  
Author(s):  
Abdelhaliem Babiker
Keyword(s):  
Prime Order ◽  
Key Agreement ◽  
Discrete Logarithm ◽  
Key Exchange ◽  
Security Requirement ◽  
Secret Key ◽  
Diffie Hellman ◽  
Shared Secret ◽  
Shared Secret Key ◽  
Provably Secure

Abstract In this paper, a new key-agreement scheme is proposed and analyzed. In addition to being provably secure in the shared secret key indistinguishability model under Decisional Diffie-Hellman assumption for subgroup of matrices over GF(2) with prime order, which considered as basic security requirement, the scheme has an interesting feature; it uses exponentiations over cyclic group using hidden secret subgroup generator as a platform for the key exchange, whereby - unlike many other exponentiation based key exchange schemes - it transcends the reliance on intractability of Discrete Logarithm Problem in its security.

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

Cryptanalysis and enhancement of two-pass authenticated key agreement with key confirmation protocols

2010 ◽  
Vol 27 (3) ◽  
pp. 252 ◽  
Author(s):  
Zeyad Mohammad ◽  
Yaw-Chung Chen ◽  
Chien-Lung Hsu ◽  
Chi-Chun Lo
Keyword(s):  
Key Agreement ◽  
Authenticated Key Agreement

scholarly journals A Pairing-Free Identity-Based Identification Scheme with Tight Security Using Modified-Schnorr Signatures

Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1330
Author(s):  
Jason Chia ◽  
Ji-Jian Chin ◽  
Sook-Chin Yip
Keyword(s):  
Key Management ◽  
Discrete Logarithm ◽  
Probability Bounds ◽  
Diffie Hellman ◽  
Identity Based ◽  
Symmetric Key ◽  
Security Guarantees ◽  
Lightweight Authentication ◽  
Tight Security ◽  
Schnorr Signatures

The security of cryptographic schemes is proven secure by reducing an attacker which breaks the scheme to an algorithm that could be used to solve the underlying hard assumption (e.g., Discrete Logarithm, Decisional Diffie–Hellman). The reduction is considered tight if it results in approximately similar probability bounds to that of solving the underlying hard assumption. Tight security is desirable as it improves security guarantees and allows the use of shorter parameters without the risk of compromising security. In this work, we propose an identity-based identification (IBI) scheme with tight security based on a variant of the Schnorr signature scheme known as TNC signatures. The proposed IBI scheme enjoys shorter parameters and key sizes as compared to existing IBI schemes without increasing the number of operations required for its identification protocol. Our scheme is suitable to be used for lightweight authentication in resource-constrained Wireless Sensor Networks (WSNs) as it utilizes the lowest amount of bandwidth when compared to other state-of-the-art symmetric key lightweight authentication schemes. Although it is costlier than its symmetric key counterparts in terms of operational costs due to its asymmetric key nature, it enjoys other benefits such as decentralized authentication and scalable key management. As a proof of concept to substantiate our claims, we perform an implementation of our scheme to demonstrate its speed and memory usage when it runs on both high and low-end devices.

scholarly journals Higher Dimensional Holonomy Map for Rules Submanifolds in Graded Manifolds

2020 ◽  
Vol 8 (1) ◽  
pp. 68-91
Author(s):  
Gianmarco Giovannardi
Keyword(s):  
Characteristic Direction ◽  
Fixed Degree ◽  
One Dimensional ◽  
First Order ◽  
Natural Choice ◽  
Higher Dimensional ◽  
Graded Manifold ◽  
The One ◽  
Graded Manifolds ◽  
Holonomy Map

AbstractThe deformability condition for submanifolds of fixed degree immersed in a graded manifold can be expressed as a system of first order PDEs. In the particular but important case of ruled submanifolds, we introduce a natural choice of coordinates, which allows to deeply simplify the formal expression of the system, and to reduce it to a system of ODEs along a characteristic direction. We introduce a notion of higher dimensional holonomy map in analogy with the one-dimensional case [29], and we provide a characterization for singularities as well as a deformability criterion.

Sign in / Sign up

Export Citation Format

Share Document