scholarly journals A Prototype Model of Virtual Authenticated Key Exchange Mechanism over Secured Channel in Ad-Hoc Environment

2020 ◽  
Vol 8 (5) ◽  
pp. 5526-5532
Keyword(s):  
Ad Hoc ◽  
Vital Role ◽  
Key Exchange ◽  
Exchange Mechanism ◽  
Prototype Model ◽  
Secret Key ◽  
Private Key ◽  
Computational Overhead ◽  
Key Exchange Protocols ◽  
Symmetric Key

Key exchange protocols play a vital role in symmetric key cryptography. The transfer of private key through the secured medium is a challenging task because every day the intruders are evolved and the attacks are increasing constantly. The existing key exchange protocols such as Diffie-Hellman, Elgamal, and MQV, etc. are the old methods and many attacks happened on those protocols. That challenges demanding new protocol or methodology of transferring secret key between the parties. The paper proposes a new, secured, less computational overhead key exchange mechanism using short message service available in the cellular networks. GSM-SMS is a highly established secured channel and the research uses this facility to transfer the key between senders to a receiver of the symmetric key cryptosystem. The private key no need to reveal to third parties or even the receiver because the sender can directly communicate to the decryption system through the mobile SMS. After the decryption process, the secret key will be destroyed immediately. There is no possible attack during the key transfer and loss and error of the communication are very less.

scholarly journals Modeling advanced security aspects of key exchange and secure channel protocols

2020 ◽  
Vol 62 (5-6) ◽  
pp. 287-293
Author(s):  
Felix Günther
Keyword(s):  
Building Blocks ◽  
Key Exchange ◽  
Internet Security ◽  
Streaming Data ◽  
Transport Layer ◽  
Security Model ◽  
Secret Key ◽  
Multi Stage ◽  
Key Exchange Protocols ◽  
Secure Channel

AbstractSecure connections are at the heart of today’s Internet infrastructure, protecting the confidentiality, authenticity, and integrity of communication. Achieving these security goals is the responsibility of cryptographic schemes, more specifically two main building blocks of secure connections. First, a key exchange protocol is run to establish a shared secret key between two parties over a, potentially, insecure connection. Then, a secure channel protocol uses that shared key to securely transport the actual data to be exchanged. While security notions for classical designs of these components are well-established, recently developed and standardized major Internet security protocols like Google’s QUIC protocol and the Transport Layer Security (TLS) protocol version 1.3 introduce novel features for which supporting security theory is lacking.In my dissertation [20], which this article summarizes, I studied these novel and advanced design aspects, introducing enhanced security models and analyzing the security of deployed protocols. For key exchange protocols, my thesis introduces a new model for multi-stage key exchange to capture that recent designs for secure connections establish several cryptographic keys for various purposes and with differing levels of security. It further introduces a formalism for key confirmation, reflecting a long-established practical design criteria which however was lacking a comprehensive formal treatment so far. For secure channels, my thesis captures the cryptographic subtleties of streaming data transmission through a revised security model and approaches novel concepts to frequently update key material for enhanced security through a multi-key channel notion. These models are then applied to study (and confirm) the security of the QUIC and TLS 1.3 protocol designs.

Cryptography-Based Authentication for Protecting Cyber Systems

Cyber Crime ◽  
2013 ◽  
pp. 1778-1796
Author(s):  
Xunhua Wang ◽  
Hua Lin
Keyword(s):  
Authentication Protocol ◽  
Security And Privacy ◽  
Biometric Authentication ◽  
Private Key ◽  
Knowledge Based ◽  
Fundamental Building Block ◽  
Key Exchange Protocols ◽  
Symmetric Key ◽  
Fuzzy Extractors

Entity authentication is a fundamental building block for system security and has been widely used to protect cyber systems. Nonetheless, the role of cryptography in entity authentication is not very clear, although cryptography is known for providing confidentiality, integrity, and non-repudiation. This chapter studies the roles of cryptography in three entity authentication categories: knowledge-based authentication, token-based authentication, and biometric authentication. For these three authentication categories, we discuss (1) the roles of cryptography in the generation of password verification data, in password-based challenge/response authentication protocol, and in password-authenticated key exchange protocols; (2) the roles of cryptography in both symmetric key-based and private key-based token authentications; (3) cryptographic fuzzy extractors, which can be used to enhance the security and privacy of biometric authentication. This systematic study of the roles of cryptography in entity authentication will deepen our understanding of both cryptography and entity authentication and can help us better protect cyber systems.

scholarly journals Picpass Algorithm for Solution of Key Exchange Problem in Symmetric and Asymmetric Key Cryptography

2021 ◽  
pp. 305-308
Author(s):  
Anchal Goyal ◽  
Deepinder Kaur
Keyword(s):  
Public Key Cryptography ◽  
Key Exchange ◽  
Secret Key ◽  
Dictionary Attack ◽  
Plain Text ◽  
Cipher Text ◽  
Compact Size ◽  
Private And Public ◽  
Symmetric Key ◽  
Dictionary Attacks

In this dissertation a PicPass algorithm is proposed for the solution of Key Exchange problem using Symmetric and Asymmetric key cryptography. Diffie and Hellman proposed an algorithm for key exchange. But this algorithm suffers from Man-in middle attack. So to overcome this problem Seo proposed another algorithm that uses text password for the agreement between two parties. But again the password suffers from offline dictionary attack. In this, a PicPass Protocol i.e. picture is used as a password to make an agreement between two parties. The protocol contains two function i.e. picture function as well as distortion function is used to make picture in a compact size and then it is sent to receiver. Firstly the sender encrypts the Plain Text using Secret Picture and creates the Cipher Text using Symmetric key cryptography.Then the Secret Picture will be encrypted by covered picture resulting into Encrypted Picture.Now the Cipher Text and Encrypted Picture will be placed into digital envolpe and then the envelope will be send to the receiver. The receiver will receive the digital envelope, open it and then decrypt the Encrypted Picture using his Key Picture. This will result the receiver to get the Secret Picture. Now the receiver will open the Cipher Text using the Secret Picture and get the Plain Text. In between if any person wants to predict the Encrypted Picture then he cannot guess as the picture will only be decrypted using the Secret Key which will be only with the receiver. So in this dissertation, a picture is used as a password to authenticate key exchange is that gives practical solution against offline dictionary attacks only by using both private and public key cryptography.

Horizontal Side-Channel Vulnerabilities of Post-Quantum Key Exchange and Encapsulation Protocols

2021 ◽  
Vol 20 (6) ◽  
pp. 1-22
Author(s):  
Furkan Aydin ◽  
Aydin Aysu ◽  
Mohit Tiwari ◽  
Andreas Gerstlauer ◽  
Michael Orshansky
Keyword(s):  
Key Exchange ◽  
Power Measurement ◽  
Side Channel ◽  
Digital Information ◽  
Secret Key ◽  
Secret Keys ◽  
Key Exchange Protocols ◽  
Horizontal Side ◽  
Single Trace ◽  
Lattice Based Cryptography

Key exchange protocols and key encapsulation mechanisms establish secret keys to communicate digital information confidentially over public channels. Lattice-based cryptography variants of these protocols are promising alternatives given their quantum-cryptanalysis resistance and implementation efficiency. Although lattice cryptosystems can be mathematically secure, their implementations have shown side-channel vulnerabilities. But such attacks largely presume collecting multiple measurements under a fixed key, leaving the more dangerous single-trace attacks unexplored. This article demonstrates successful single-trace power side-channel attacks on lattice-based key exchange and encapsulation protocols. Our attack targets both hardware and software implementations of matrix multiplications used in lattice cryptosystems. The crux of our idea is to apply a horizontal attack that makes hypotheses on several intermediate values within a single execution all relating to the same secret, and to combine their correlations for accurately estimating the secret key. We illustrate that the design of protocols combined with the nature of lattice arithmetic enables our attack. Since a straightforward attack suffers from false positives, we demonstrate a novel extend-and-prune procedure to recover the key by following the sequence of intermediate updates during multiplication. We analyzed two protocols, Frodo and FrodoKEM , and reveal that they are vulnerable to our attack. We implement both stand-alone hardware and RISC-V based software realizations and test the effectiveness of the proposed attack by using concrete parameters of these protocols on physical platforms with real measurements. We show that the proposed attack can estimate secret keys from a single power measurement with over 99% success rate.

One-Round Attribute-Based Key Exchange in the Multi-Party Setting

2017 ◽  
Vol 28 (06) ◽  
pp. 725-742 ◽  
Author(s):  
Yangguang Tian ◽  
Guomin Yang ◽  
Yi Mu ◽  
Shiwei Zhang ◽  
Kaitai Liang ◽  
...  
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Key Exchange ◽  
Secret Key ◽  
Security Issue ◽  
User Privacy ◽  
Session Key ◽  
Shared Secret ◽  
Key Exchange Protocols ◽  
Straightforward Approach

Attribute-based authenticated key exchange (AB-AKE) is a useful primitive that allows a group of users to establish a shared secret key and at the same time enables fine-grained access control. A straightforward approach to design an AB-AKE protocol is to extend a key exchange protocol using an attribute-based authentication technique. However, insider security is a challenge security issue for AB-AKE in the multi-party setting and cannot be solved using the straightforward approach. In addtion, many existing key exchange protocols for the multi-party setting (e.g., the well-known Burmester-Desmedt protocol) require multiple broadcast rounds to complete the protocol. In this paper, we propose a novel one-round attribute-based key exchange (OAKE) protocol in the multi-party setting. We define the formal security models, including session key security, insider security and user privacy, for OAKE, and prove the security of the proposed protocol under some standard assumptions in the random oracle model.

scholarly journals A new hybrid text encryption approach over mobile ad hoc network

2020 ◽  
Vol 10 (6) ◽  
pp. 6461
Author(s):  
Mohammed Amin Almaiah ◽  
Ziad Dawahdeh ◽  
Omar Almomani ◽  
Adeeb Alsaaidah ◽  
Ahmad Al-Khasawneh ◽  
...  
Keyword(s):  
Mobile Networks ◽  
Data Exchange ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mobile Network ◽  
Secret Key ◽  
Private Key ◽  
Hill Cipher ◽  
Public Keys ◽  
Private And Public

Data exchange has been rapidly increased recently by increasing the use of mobile networks. Sharing information (text, image, audio and video) over unsecured mobile network channels is liable for attacking and stealing. Encryption techniques are the most suitable methods to protect information from hackers. Hill cipher algorithm is one of symmetric techniques, it has a simple structure and fast computations, but weak security because sender and receiver need to use and share the same private key within a non-secure channel. Therefore, a novel hybrid encryption approach between elliptic curve cryptosystem and hill cipher (ECCHC) is proposed in this paper to convert Hill Cipher from symmetric technique (private key) to asymmetric one (public key) and increase its security and efficiency and resist the hackers. Thus, no need to share the secret key between sender and receiver and both can generate it from the private and public keys. Therefore, the proposed approach presents a new contribution by its ability to encrypt every character in the 128 ASCII table by using its ASCII value direct without needing to assign a numerical value for each character. The main advantages of the proposed method are represented in the computation simplicity, security efficiency and faster computation.

Cryptography-Based Authentication for Protecting Cyber Systems

2011 ◽  
pp. 32-51
Author(s):  
Xunhua Wang ◽  
Hua Lin
Keyword(s):  
Authentication Protocol ◽  
Security And Privacy ◽  
Biometric Authentication ◽  
Private Key ◽  
Knowledge Based ◽  
Fundamental Building Block ◽  
Key Exchange Protocols ◽  
Symmetric Key ◽  
Fuzzy Extractors

Entity authentication is a fundamental building block for system security and has been widely used to protect cyber systems. Nonetheless, the role of cryptography in entity authentication is not very clear, although cryptography is known for providing confidentiality, integrity, and non-repudiation. This chapter studies the roles of cryptography in three entity authentication categories: knowledge-based authentication, token-based authentication, and biometric authentication. For these three authentication categories, we discuss (1) the roles of cryptography in the generation of password verification data, in password-based challenge/response authentication protocol, and in password-authenticated key exchange protocols; (2) the roles of cryptography in both symmetric key-based and private key-based token authentications; (3) cryptographic fuzzy extractors, which can be used to enhance the security and privacy of biometric authentication. This systematic study of the roles of cryptography in entity authentication will deepen our understanding of both cryptography and entity authentication and can help us better protect cyber systems.

scholarly journals Password-Only Authenticated Three-Party Key Exchange with Provable Security in the Standard Model

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Junghyun Nam ◽  
Kim-Kwang Raymond Choo ◽  
Junghwan Kim ◽  
Hyun-Kyu Kang ◽  
Jinsoo Kim ◽  
...  
Keyword(s):  
Security Analysis ◽  
Random Oracle ◽  
Key Exchange ◽  
Secret Key ◽  
Random Oracles ◽  
Insider Attack ◽  
Password Security ◽  
Authentication Server ◽  
The Standard Model ◽  
Key Exchange Protocols

Protocols for password-only authenticated key exchange (PAKE) in the three-party setting allow two clients registered with the same authentication server to derive a common secret key from their individual password shared with the server. Existing three-party PAKE protocols were proven secure under the assumption of the existence of random oracles or in a model that does not consider insider attacks. Therefore, these protocols may turn out to be insecure when the random oracle is instantiated with a particular hash function or an insider attack is mounted against the partner client. The contribution of this paper is to present the first three-party PAKE protocol whose security is proven without any idealized assumptions in a model that captures insider attacks. The proof model we use is a variant of the indistinguishability-based model of Bellare, Pointcheval, and Rogaway (2000), which is one of the most widely accepted models for security analysis of password-based key exchange protocols. We demonstrated that our protocol achieves not only the typical indistinguishability-based security of session keys but also the password security against undetectable online dictionary attacks.

scholarly journals Improvement of RSA Algorithm Using Euclidean Technique

2021 ◽  
Vol 12 (3) ◽  
pp. 4694-4700
Author(s):  
R. Felista Sugirtha Lizy Et.al
Keyword(s):  
Data Security ◽  
Euclidean Algorithm ◽  
Modern World ◽  
Digital Information ◽  
Secret Key ◽  
Avalanche Effect ◽  
Rsa Algorithm ◽  
Private Key ◽  
Symmetric Key ◽  
Mathematical Justification

Information Security has become an essential concern in the modern world. Encryption is an effective way to prevent an unofficial person from viewing the digital information with the secret key. RSA encryption is often used for digital signatures which can prove the authenticity and reliability of a message. As RSA encryption is less competent and resource-heavy, it is not used to encrypt the entire message. If a message is encrypted with a symmetric-key RSA encryption it will be more efficient. Under this process, only the RSA private key will be able to decrypt the symmetric key. The Euclidean algorithm is attainably one of the most extensively known algorithms.  The Euclidean algorithm is used for finding the greatest common divisor of two numbers. The algorithm can also be defined for more general rings than just the integers. This work is very useful to improve the data security in Smart card and Aadhaar card. In this paper, the RSA algorithm is modified using the Euclidean technique to improve its performance. The proposed algorithm shows its better performance in terms of speed, throughput, power consumption, and the avalanche effect. Experimental results and mathematical justification supporting the proposed method are reported.

Sign in / Sign up

Export Citation Format

Share Document