IMPLEMENTATION OF BLOM’S KEY PREDISTRIBUTION SCHEME BY USING ELLIPTIC CURVE CRYPTOGRAPHY

2021 ◽  
Vol 6 (2) ◽  
pp. 812
Author(s):  
Md Nizam Udin ◽  
Farah Azaliney Mohd Amin ◽  
Aminah Abdul Malek ◽  
Nur Annisa Zulkifili ◽  
Nur Atiqah Ghazali ◽  
...  
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Mathematical Operation ◽  
Session Key ◽  
Key Predistribution ◽  
Private Key ◽  
Distribution Scheme ◽  
Original Scheme ◽  
Security Communication ◽  
Key Predistribution Scheme

Cryptography, along with its various methods is used to serve the security communication purpose. Cryptography is said to be secure if the encryption key is hard to break by the attacker.  Initially, Blom’s Key pre-distribution uses an integer finite field which makes this scheme easy to be intervened by attackers and criminal activists. Hence, this study suggests implementing the Elliptic Curve Cryptography to better enhance the security of the original Blom’s. In this proposed scheme, points generated from the elliptic curve will be appointed as public identifiers to be used in the original scheme. The private key and session key of each user are generated using the addition law mathematical operation with public identifiers assigned. Two users who intend to communicate with each other will obtain a common session key. Overall, the modification of Blom’s Key pre-distribution scheme will be presented in this study.

Lightweight anonymous key distribution scheme for smart grid using elliptic curve cryptography

2016 ◽  
Vol 10 (14) ◽  
pp. 1795-1802 ◽  
Author(s):  
Debiao He ◽  
Lina Wang ◽  
Huaqun Wang ◽  
Muhammad Khurram Khan
Keyword(s):  
Smart Grid ◽  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Key Distribution ◽  
Distribution Scheme

scholarly journals Provable Secure and Efficient Digital Rights Management Authentication Scheme Using Smart Card Based on Elliptic Curve Cryptography

2015 ◽  
Vol 2015 ◽  
pp. 1-16
Author(s):  
Yuanyuan Zhang ◽  
Muhammad Khurram Khan ◽  
Jianhua Chen ◽  
Debiao He
Keyword(s):  
Elliptic Curve ◽  
Smart Card ◽  
Elliptic Curve Cryptography ◽  
Denial Of Service ◽  
Digital Rights Management ◽  
Authentication Scheme ◽  
Session Key ◽  
Digital Rights ◽  
Denial Of Service Attack ◽  
Rights Management

Since the concept of ubiquitous computing is firstly proposed by Mark Weiser, its connotation has been extending and expanding by many scholars. In pervasive computing application environment, many kinds of small devices containing smart cart are used to communicate with others. In 2013, Yang et al. proposed an enhanced authentication scheme using smart card for digital rights management. They demonstrated that their scheme is secure enough. However, Mishra et al. pointed out that Yang et al.’s scheme suffers from the password guessing attack and the denial of service attack. Moreover, they also demonstrated that Yang et al.’s scheme is not efficient enough when the user inputs an incorrect password. In this paper, we analyze Yang et al.’s scheme again, and find that their scheme is vulnerable to the session key attack. And, there are some mistakes in their scheme. To surmount the weakness of Yang et al.’s scheme, we propose a more efficient and provable secure digital rights management authentication scheme using smart card based on elliptic curve cryptography.

scholarly journals Defeating MITM Attacks on Cryptocurrency Exchange Accounts with Individual User Keys

2021 ◽  
Vol 13 (1) ◽  
pp. 51-64
Author(s):  
Cheman Shaik
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Security Analysis ◽  
Public Key ◽  
Public And Private ◽  
The Public ◽  
Individual User ◽  
Private Key ◽  
Authentication Schemes

Presented herein is a User-SpecificKey Scheme based on Elliptic Curve Cryptography that defeats man-inthe-middle attacks on cryptocurrency exchange accounts. In this scheme, a separate public and private key pair is assigned to every account and the public key is shifted either forward or backward on the elliptic curve by a difference of the account user’s password. When a user logs into his account, the server sends the shifted public key of his account. The user computes the actual public key of his account by reverse shifting the shifted public key exactly by a difference of his password. Alternatively, shifting can be applied to the user’s generator instead of the public key. Described in detail is as to how aman-in-the-middle attack takes place and how the proposed scheme defeats the attack. Provided detailed security analysis in both the cases of publickey shifting and generator shifting. Further, compared the effectiveness of another three authentication schemes in defending passwords against MITM attacks.

scholarly journals Asymmetric Cryptosystem Based on Optical Scanning Cryptography and Elliptic Curve Algorithm

2021 ◽  
Author(s):  
Xiangyu Chang ◽  
Wei Li ◽  
Aimin Yan ◽  
Peter Wai Ming Tsang ◽  
Ting-Chung Poon
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Optical Scanning ◽  
Private Key ◽  
Asymmetric Cryptosystem

Abstract We propose an asymmetric cryptosystem based on optical scanning cryptography (OSC) and elliptic curve cryptography (ECC) algorithm. In the encryption stage of OSC, an object is encrypted to cosine and sine holograms by two pupil functions calculated via ECC algorithm from sender’s biometric image, which is sender’s private key. With the ECC algorithm, these holograms are encrypted to ciphertext, which is sent to the receiver. In the stage of decryption, the ciphered holograms can be decrypted by receiver’s biometric private key which is different from the sender’s private key. The approach is an asymmetric cryptosystem which solves the problem of the management and dispatch of keys in OSC and has more security strength than it. The feasibility of the proposed method has been convincingly verified by numerical and experiment results.

An IBE-Based Authenticated Key Transfer Protocol on Elliptic Curves

2020 ◽  
pp. 1112-1122
Author(s):  
Daya Sagar Gupta
Keyword(s):  
Elliptic Curve ◽  
Computational Cost ◽  
Session Key ◽  
Private Key ◽  
Diffie Hellman ◽  
Security Properties ◽  
Hard Problems ◽  
Identity Based ◽  
Symmetric Key ◽  
Transfer Protocol

The key exchanged using key transfer protocols is generally used for symmetric key encryption where this key is known as private key and used for both encryption as well as decryption. As we all know, many key transfer protocols including basic Diffie-Hellman protocol are proposed in the literature. However, many of these key transfer protocols either are proven insecure or had a burden of communication and computational cost. Therefore, a more secure and efficient key transfer protocol is needed. In this article, the author proposes an authenticated key transfer protocol that securely and efficiently negotiates a common session key between two end users. He calls this protocol as IBE-TP-AKE. This proposal is based on the elliptic-curve cryptography (ECC) and uses the idea of identity-based encryption (IBE) with pairing. The security of the proposed work is based on the hard problems of elliptic curve and their pairing. Further, the author has shown the security of his proposed protocol and proved it using the security properties discussed later.

Sign in / Sign up

Export Citation Format

Share Document