An efficient anonymous batch authenticated and key agreement scheme using self-certified public keys in VANETs

2013 ◽  
Author(s):  
Xinyi Wang ◽  
Zheng Huang ◽  
Qiaoyan Wen ◽  
Hua Zhang
Keyword(s):  
Key Agreement ◽  
Public Keys

scholarly journals Electronic Voting Protocol Using Identity-Based Cryptography

2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Gina Gallegos-Garcia ◽  
Horacio Tapia-Recillas
Keyword(s):  
Key Agreement ◽  
Public Key Cryptography ◽  
Public Key ◽  
Electronic Voting ◽  
Certification Authority ◽  
Public Keys ◽  
Core Components ◽  
Identity Based ◽  
High Flexibility ◽  
Agreement Protocols

Electronic voting protocols proposed to date meet their properties based on Public Key Cryptography (PKC), which offers high flexibility through key agreement protocols and authentication mechanisms. However, when PKC is used, it is necessary to implement Certification Authority (CA) to provide certificates which bind public keys to entities and enable verification of such public key bindings. Consequently, the components of the protocol increase notably. An alternative is to use Identity-Based Encryption (IBE). With this kind of cryptography, it is possible to have all the benefits offered by PKC, without neither the need of certificates nor all the core components of a Public Key Infrastructure (PKI). Considering the aforementioned, in this paper we propose an electronic voting protocol, which meets the privacy and robustness properties by using bilinear maps.

scholarly journals Implementation of a New Strongly-Asymmetric Algorithm and Its Optimization

Cryptography ◽  
2020 ◽  
Vol 4 (3) ◽  
pp. 21
Author(s):  
Koki Jimbo ◽  
Satoshi Iriyama ◽  
Massimo Regoli
Keyword(s):  
General Framework ◽  
Key Agreement ◽  
Public Key ◽  
Security Level ◽  
The Public ◽  
High Speeds ◽  
Diffie Hellman ◽  
New Public ◽  
Public Keys ◽  
Free Parameters

A new public key agreement (PKA) algorithm, called the strongly-asymmetric algorithm (SAA-5), was introduced by Accardi et al. The main differences from the usual PKA algorithms are that Bob has some independent public keys and Alice produces her public key by using some part of the public keys from Bob. Then, the preparation and calculation processes are essentially asymmetric. This algorithms has several free parameters more than the usual symmetric PKA algorithms and the velocity of calculation is largely dependent on the parameters chosen; however, the performance of it has not yet been tested. The purpose of our study was to discuss efficient parameters to share the key with high speeds in SAA-5 and to optimize SAA-5 in terms of calculation speed. To find efficient parameters of SAA-5, we compared the calculation speed with Diffie–Hellman (D-H) while varying values of some parameters under the circumstance where the length of the secret shared key (SSK) was fixed. For optimization, we discuss a more general framework of SAA-5 to find more efficient operations. By fixing the parameters of the framework properly, a new PKA algorithm with the same security level as SAA-5 was produced. The result shows that the calculation speed of the proposed PKA algorithm is faster than D-H, especially for large key lengths. The calculation speed of the proposed PKA algorithm increases linearly as the SSK length increases, whereas D-H increases exponentially.

scholarly journals An Anonymous Device to Device Authentication Protocol Using ECC and Self Certified Public Keys Usable in Internet of Things Based Autonomous Devices

Electronics ◽  
2020 ◽  
Vol 9 (3) ◽  
pp. 520
Author(s):  
Bander A. Alzahrani ◽  
Shehzad Ashraf Chaudhry ◽  
Ahmed Barnawi ◽  
Abdullah Al-Barakati ◽  
Taeshik Shon
Keyword(s):  
Internet Of Things ◽  
Key Agreement ◽  
Formal Model ◽  
Third Party ◽  
Impersonation Attack ◽  
Internet Of Vehicles ◽  
Moving Vehicles ◽  
Public Keys ◽  
Device To Device ◽  
Authentication Schemes

Two party authentication schemes can be good candidates for deployment in Internet of Things (IoT)-based systems, especially in systems involving fast moving vehicles. Internet of Vehicles (IoV) requires fast and secure device-to-device communication without interference of any third party during communication, and this task can be carried out after registration of vehicles with a trusted certificate issuing party. Recently, several authentication protocols were proposed to enable key agreement in two party settings. In this study, we analyze two recent protocols and show that both protocols are insecure against key compromise impersonation attack (KCIA) as well as both lack of user anonymity. Therefore, this paper proposes an improved protocol that does not only resist KCIA and related attacks, but also offers comparable computation and communication. The security of proposed protocol is tested under formal model as well as using well known Burrows–Abadi–Needham (BAN) logic along with a discussion on security features. While resisting the KCIA and related attacks, proposed protocol also provides comparable trade-of between security features and efficiency and completes a round of key agreement in just 13.42 ms, which makes it a promising candidate to be deployed in IoT environments.

scholarly journals Man in The Middle Attacks Against SSL/TLS: Mitigation and Defeat

2020 ◽  
Author(s):  
Muneer Alwazzeh ◽  
Sameer Karaman ◽  
Mohammad Nur Shamma
Keyword(s):  
Elliptic Curve ◽  
Key Agreement ◽  
Transport Layer ◽  
Secret Key ◽  
Transport Layer Security ◽  
Digital Signature Algorithm ◽  
Public Keys ◽  
Man In The Middle ◽  
Symmetric Key ◽  
Security Network

Network security and related issues have been discussed thoroughly in this paper, especially at transport layer security network protocol, which concern with confidentiality, integrity, availability, authentication, and accountability. To mitigate and defeat Man-in-the-middle-attacks, we have proposed a new model which consists of sender and receiver systems and utilizes a combination of blowfish (BF) and Advanced Encryption Standard (AES) algorithms, symmetric key agreement to distribute public keys, Elliptic Curve Cryptography (ECC) to create secret key, and then Diffe Hellman (DH) for key exchange. Both SHA-256 hashing and Elliptic Curve Digital Signature Algorithm (ECDSA) have been applied for integrity, and authentication, respectively.

scholarly journals New Subclass Framework and Concrete Examples of Strongly Asymmetric Public Key Agreement

2021 ◽  
Vol 11 (12) ◽  
pp. 5540
Author(s):  
Satoshi Iriyama ◽  
Koki Jimbo ◽  
Massimo Regoli
Keyword(s):  
Computational Efficiency ◽  
Key Agreement ◽  
Necessary Conditions ◽  
Key Exchange ◽  
Public Key ◽  
High Security ◽  
Public Keys ◽  
Inclusion Relations ◽  
Shared Key

Strongly asymmetric public key agreement (SAPKA) is a class of key exchange between Alice and Bob that was introduced in 2011. The greatest difference from the standard PKA algorithms is that Bob constructs multiple public keys and Alice uses one of these to calculate her public key and her secret shared key. Therefore, the number of public keys and calculation rules for each key differ for each user. Although algorithms with high security and computational efficiency exist in this class, the relation between the parameters of SAPKA and its security and computational efficiency has not yet been fully clarified. Therefore, our main objective in this study was to classify the SAPKA algorithms according to their properties. By attempting algorithm attacks, we found that certain parameters are more strongly related to the security. On this basis, we constructed concrete algorithms and a new subclass of SAPKA, in which the responsibility of maintaining security is significantly more associated with the secret parameters of Bob than those of Alice. Moreover, we demonstrate 1. insufficient but necessary conditions for this subclass, 2. inclusion relations between the subclasses of SAPKA, and 3. concrete examples of this sub-class with reports of implementational experiments.

Sign in / Sign up

Export Citation Format

Share Document