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

2021 ◽  
Author(s):  
Abdelhaliem Babiker
Keyword(s):  
Key Agreement ◽  
Cyclic Subgroup ◽  
Discrete Logarithm ◽  
Key Exchange ◽  
Discrete Logarithm Problem ◽  
Secret Key ◽  
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 shared secret key indistinguishability model, the scheme has an interesting feature: while using exponentiation over a cyclic subgroup to establish the key-agreement, the generator of that subgroup is hidden to secure the scheme against adversaries that are capable of solving the Discrete Logarithm Problem, which means that the scheme might be candidate as a post-quantum key exchange scheme.

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.

A key exchange protocol using matrices over group ring

2019 ◽  
Vol 12 (05) ◽  
pp. 1950075
Author(s):  
Indivar Gupta ◽  
Atul Pandey ◽  
Manish Kant Dubey
Keyword(s):  
Group Ring ◽  
Complexity Analysis ◽  
Discrete Logarithm ◽  
Key Exchange ◽  
Group Rings ◽  
Secret Key ◽  
Key Exchange Protocol ◽  
Diffie Hellman ◽  
Shared Secret ◽  
Invertible Matrices

The first published solution to key distribution problem is due to Diffie–Hellman, which allows two parties that have never communicated earlier, to jointly establish a shared secret key over an insecure channel. In this paper, we propose a new key exchange protocol in a non-commutative semigroup over group ring whose security relies on the hardness of Factorization with Discrete Logarithm Problem (FDLP). We have also provided its security and complexity analysis. We then propose a ElGamal cryptosystem based on FDLP using the group of invertible matrices over group rings.

AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT

2011 ◽  
Vol 22 (05) ◽  
pp. 1211-1227 ◽  
Author(s):  
TAKAAKI MIZUKI ◽  
SATORU NAKAYAMA ◽  
HIDEAKI SONE
Keyword(s):  
Probability Distribution ◽  
Key Agreement ◽  
Key Exchange ◽  
Secret Key ◽  
Exchange Graph ◽  
Secret Keys ◽  
Shared Secret ◽  
Secret Key Agreement

Assume that there are players and an eavesdropper Eve, where several pairs of players have shared secret keys beforehand. We regard each player as a vertex of a graph and regard each pair of players sharing a key as an edge. Consider the case where Eve knows some of the keys according to a certain probability distribution. In this paper, applying the technique of st-numbering, we propose a protocol which allows any two designated players to agree on a secret key through such a "partially leaked key exchange graph." Our protocol is optimal in the sense that Eve's knowledge about the secret key agreed on by the two players is as small as possible.

scholarly journals Enhancement of Security of Diffie-Hellman Key Exchange Protocol using RSA Cryptography.

2022 ◽  
Vol 2161 (1) ◽  
pp. 012014
Author(s):  
Chiradeep Gupta ◽  
N V Subba Reddy
Keyword(s):  
Key Exchange ◽  
Secret Key ◽  
Key Exchange Protocol ◽  
Diffie Hellman ◽  
Shared Secret ◽  
Diffie Hellman Key Exchange ◽  
Intended Receiver ◽  
Rsa Cryptography ◽  
Shared Secret Key ◽  
Mitm Attack

Abstract Cryptography is related and referred to as the secured transmission of messages amongst the sender and the intended receiver by ensuring confidentiality, integrity, and authentication. Diffie – Hellman (DH) key exchange protocol is a well-known algorithm that would generate a shared secret key among the sender and the intended receiver, and the basis of cryptosystems for using public and private key for encryption and decryption process. But it is severely affected by the Man in the Middle (MITM) attack that would intercept and manipulate thus eavesdropping the shared secret key. This paper proposes a model of integrating the public-key RSA cryptography system with the DH key exchange to prevent the MITM attack. The performance of the proposed work has been compared to the DH Key Exchange algorithm as well as RSA Cryptosystem to conclude for effectiveness of the proposed model.

scholarly journals Network Security System with Optimized Randomized Multiple Key Exchange Algorithm

2020 ◽  
Vol 9 (3) ◽  
pp. 1075-1080
Keyword(s):  
Network Security ◽  
Elliptic Curve ◽  
Key Exchange ◽  
Memory Requirement ◽  
Secret Key ◽  
Diffie Hellman ◽  
Shared Secret ◽  
Security Properties ◽  
Diffie Hellman Key Exchange ◽  
Shared Secret Key

This paper illustrates three different algorithms to provide shared secret key for security of the system. The proposed three algorithms namely 1) Modified Simple Password Key Exchange Scheme 2) Modified Diffie-Hellman Key exchange Scheme 3) Modified Elliptic Curve Scheme are meant to provide shared secret key for authentication process. Enhancements in terms of memory requirement, storage and other security properties such as authentication among mutual users, fraud prevention, attack etc., prove the validity of the proposed algorithms in proving authentication for the cryptographic identification of networks

METHODS OF SHARED KEY AGREEMENT IN COHERENT MULTIPLEXING

2004 ◽  
Vol 18 (16) ◽  
pp. 833-839
Author(s):  
AJUNG KIM
Keyword(s):  
Performance Evaluation ◽  
Optical Communications ◽  
Key Agreement ◽  
Secret Key ◽  
Design Rules ◽  
Shared Secret ◽  
Shared Key ◽  
And Performance ◽  
Multiplexing Systems ◽  
Shared Secret Key

A method of shared secret key distribution applicable to optical coherent multiplexing systems is proposed. It provides ways to detect the extent of eavesdropping. Detecting test factors and system design rules are suggested, and performance evaluation is performed in terms of mutual information between legitimate users and an eavesdropper. This scheme devises a new way of attaining secure optical communications without entirely relying on computational complexity.

Mutual semi-quantum key agreement protocol using Bell states

2019 ◽  
Vol 34 (35) ◽  
pp. 1950294 ◽  
Author(s):  
Li Li Yan ◽  
Shi Bin Zhang ◽  
Yan Chang ◽  
Zhi Wei Sheng ◽  
Fan Yang
Keyword(s):  
Key Agreement ◽  
Quantum Key Agreement ◽  
Secret Key ◽  
Quantum Devices ◽  
Key Agreement Protocol ◽  
Reflection Measurement ◽  
Shared Secret ◽  
Equal Contribution ◽  
Quantum Key Agreement Protocol ◽  
Shared Secret Key

Quantum key agreement (QKA) can generate a shared secret key which is equally negotiated by all the participants in the protocol. In most of the QKA protocols, all the participants require quantum capabilities. But the quantum devices are too expensive for participants. This paper proposes a mutual semi-quantum key agreement protocol which allows two parties (Alice and Bob) to negotiate a shared secret key equally. In the protocol, Alice can perform any quantum operation, but Bob is a classical participant which can only perform reflection, measurement and reorder operation. Even though Bob has fewer quantum resources, Alice and Bob have an equal contribution to the shared final key, no one can determine the shared key alone. In addition, we demonstrate the security of the proposed protocol. The analysis results show that the proposed protocol not only resists against some common attacks but also assures the fairness property. It is significant for communication participant without enough quantum devices to achieve quantum communication. The proposed protocol can be implemented with present quantum technologies.

scholarly journals ВДОСКОНАЛЕНА ПОЛІНОМІАЛЬНО-СКЛАДНА АТАКА ВІДНОВЛЕННЯ ВІДКРИТОГО ТЕКСТУ НА РАНЦЕВИЙ ШИФР НА ОСНОВІ МАТРИЦЬ

2020 ◽  
pp. 67-74
Author(s):  
Олексій Сергійович Вамболь
Keyword(s):  
Discrete Logarithm ◽  
Public Information ◽  
Galois Field ◽  
Secret Key ◽  
The Matrix ◽  
Encryption Schemes ◽  
Shared Secret ◽  
Symmetric Key ◽  
Asymmetric Encryption ◽  
The Given

Asymmetric ciphers are widely used to ensure the confidentiality of data transmission via insecure channels. These cryptosystems allow the interacting parties to create a shared secret key for a symmetric cipher in such a way that an eavesdropper gets no information useful for cryptanalysis. Network security protocols that use asymmetric ciphers include TLS, S/MIME, OpenPGP, Tor, and many others. Some of the asymmetric encryption schemes are homomorphic, that is, that they allow calculations on encrypted data to be performed without preliminary decryption. The aforesaid property makes possible using these cryptosystems not only for symmetric key establishment but also in several areas of application, in particular in secret voting protocols and cloud computing. The matrix-based knapsack cipher is a new additively homomorphic asymmetric encryption scheme, which is based on the properties of isomorphic transformations of the inner direct product of diagonal subgroups of a general linear group over a Galois field. Unlike classic knapsack encryption schemes, the cryptographic strength of this cipher depends on the computational complexity of the multidimensional discrete logarithm problem. Despite some useful properties, further research into the cryptographic strength of the matrix-based knapsack cipher has found serious drawbacks inherent in this cryptographic scheme. In the given paper an improved polynomial-time plaintext-recovery attack on the matrix-based knapsack cipher is proposed. Applying this cryptanalytic method requires only public information and has time complexity O(t1.34), where t denotes the decryption time of the attacked cryptosystem. The aforementioned attack is more productive and easier to implement in software in comparison with the original one. The advantages of the proposed method are due to using in its algorithm the simple and relatively fast matrix trace operation instead of more complex and slower transformations.

FORMAL VERIFICATION OF BUNDLE AUTHENTICATION MECHANISM IN OSGi SERVICE PLATFORM: BAN LOGIC

2006 ◽  
Vol 16 (02) ◽  
pp. 153-173 ◽  
Author(s):  
YOUNG-GAB KIM ◽  
CHANG-JOO MOON ◽  
DONGWON JEONG ◽  
DOO-KWON BAIK
Keyword(s):  
Formal Verification ◽  
Service Provider ◽  
Exchange Mechanism ◽  
Ban Logic ◽  
Secret Key ◽  
Home Gateway ◽  
Authentication Mechanism ◽  
Shared Secret ◽  
Bundle Authentication ◽  
Shared Secret Key

Security is critical in a home gateway environment. Robust secure mechanisms must be put in place for protecting information transferred through a central location. In considering characteristics for the home gateway environment, this paper proposes a bundle authentication mechanism. We designed the exchange mechanism for transferring a shared secret key. This transports a service bundle safely in the bootstrapping step, by recognizing and initializing various components. In this paper, we propose a bundle authentication mechanism based on a MAC that uses a shared secret key created in the bootstrapping step. In addition, we verify the safety of the key exchange mechanism and bundle authentication mechanism using BAN Logic. From the verified result, we achieved goals of authentication. That is, the operator can trust the bundle provided by the service provider. The user who uses the service gateway can also express trust and use the bundle provided by the operator.

Sign in / Sign up

Export Citation Format

Share Document