Randomness extraction in elliptic curves and secret key derivation at the end of Diffie-Hellman protocol

2012 ◽  
Vol 2 (4) ◽  
pp. 360 ◽  
Author(s):  
Abdoul Aziz Ciss ◽  
Djiby Sow
Keyword(s):  
Elliptic Curves ◽  
Secret Key ◽  
Diffie Hellman ◽  
Randomness Extraction ◽  
Key Derivation

scholarly journals Key exchange based on Diffie-Hellman protocol and image registration

2021 ◽  
Vol 21 (3) ◽  
pp. 1751
Author(s):  
Rachid Rimani ◽  
Naima Hadj Said ◽  
Adda Ali Pacha ◽  
Ozen Ozer
Keyword(s):  
Fourier Transform ◽  
Image Registration ◽  
Communication Networks ◽  
Rapid Development ◽  
Key Exchange ◽  
Mobile Internet ◽  
Security Measures ◽  
Secret Key ◽  
Diffie Hellman ◽  
Internet Media

<span>Nowadays, with the advences in ICT and rapid development of mobile internet; media information shared on the various communication networks requires the existence of adequate security measures. Cryptography becoming an effective way to meet these requirements and for maintain the confidentiality. However, communicating with encrypted messages requires secret key exchange, which is a part of a complex protocol. In this paper, we propose a new method for exchanging key based on Diffie-Hellman protocol and image registration with fast fourier transform, the principle of this method consists to concealing the key in a set of transformed images. Therefore, image registration allows finding transformations between images, which become a tool for recovering the key by the receiver.</span>

An Attribute-Based Searchable Encryption Scheme for Non-Monotonic Access Structure

2020 ◽  
pp. 263-283 ◽  
Author(s):  
Mamta ­ ◽  
Brij B. Gupta
Keyword(s):  
Access Control ◽  
Searchable Encryption ◽  
Access Structure ◽  
Encryption Scheme ◽  
Security Model ◽  
Secret Key ◽  
Fine Grained ◽  
Diffie Hellman ◽  
Attribute Based Encryption ◽  
Encryption Schemes

Attribute based encryption (ABE) is a widely used technique with tremendous application in cloud computing because it provides fine-grained access control capability. Owing to this property, it is emerging as a popular technique in the area of searchable encryption where the fine-grained access control is used to determine the search capabilities of a user. But, in the searchable encryption schemes developed using ABE it is assumed that the access structure is monotonic which contains AND, OR and threshold gates. Many ABE schemes have been developed for non-monotonic access structure which supports NOT gate, but this is the first attempt to develop a searchable encryption scheme for the same. The proposed scheme results in fast search and generates secret key and search token of constant size and also the ciphertext components are quite fewer than the number of attributes involved. The proposed scheme is proven secure against chosen keyword attack (CKA) in selective security model under Decisional Bilinear Diffie-Hellman (DBDH) assumption.

scholarly journals Improved lower bound for Diffie–Hellman problem using multiplicative group of a finite field as auxiliary group

2018 ◽  
Vol 12 (2) ◽  
pp. 101-118 ◽  
Author(s):  
Prabhat Kushwaha
Keyword(s):  
Lower Bound ◽  
Finite Field ◽  
Elliptic Curves ◽  
Multiplicative Group ◽  
Discrete Logarithm ◽  
Discrete Logarithm Problem ◽  
Reduction Algorithm ◽  
Practical Applications ◽  
Diffie Hellman ◽  
Estimate Lower

Abstract In 2004, Muzereau, Smart and Vercauteren [A. Muzereau, N. P. Smart and F. Vercauteren, The equivalence between the DHP and DLP for elliptic curves used in practical applications, LMS J. Comput. Math. 7 2004, 50–72] showed how to use a reduction algorithm of the discrete logarithm problem to Diffie–Hellman problem in order to estimate lower bound for the Diffie–Hellman problem on elliptic curves. They presented their estimates on various elliptic curves that are used in practical applications. In this paper, we show that a much tighter lower bound for the Diffie–Hellman problem on those curves can be achieved if one uses the multiplicative group of a finite field as auxiliary group. The improved lower bound estimates of the Diffie–Hellman problem on those recommended curves are also presented. Moreover, we have also extended our idea by presenting similar estimates of DHP on some more recommended curves which were not covered before. These estimates of DHP on these curves are currently the tightest which lead us towards the equivalence of the Diffie–Hellman problem and the discrete logarithm problem on these recommended elliptic curves.

scholarly journals Identity-Based Key Exchange on In-Vehicle Networks: CAN-FD & FlexRay

Sensors ◽  
2019 ◽  
Vol 19 (22) ◽  
pp. 4919
Author(s):  
Bogdan Groza ◽  
Pal-Stefan Murvay
Keyword(s):  
Bilinear Pairings ◽  
Group Extension ◽  
Key Exchange ◽  
Area Network ◽  
Secret Key ◽  
Cryptographic Primitives ◽  
Diffie Hellman ◽  
Vehicle Networks ◽  
Identity Based ◽  
Diffie Hellman Key Exchange

Security has become critical for in-vehicle networks as they carry safety-critical data from various components, e.g., sensors or actuators, and current research proposals were quick to react with cryptographic protocols designed for in-vehicle buses, e.g., CAN (Controller Area Network). Obviously, the majority of existing proposals are built on cryptographic primitives that rely on a secret shared key. However, how to share such a secret key is less obvious due to numerous practical constraints. In this work, we explore in a comparative manner several approaches based on a group extension of the Diffie–Hellman key-exchange protocol and identity-based authenticated key agreements. We discuss approaches based on conventional signatures and identity-based signatures, garnering advantages from bilinear pairings that open road to several well-known cryptographic constructions: short signatures, the tripartite Diffie–Hellman key exchange and identity-based signatures or key exchanges. Pairing-based cryptographic primitives do not come computationally cheap, but they offer more flexibility that leads to constructive advantages. To further improve on performance, we also account for pairing-free identity-based key exchange protocols that do not require expensive pairing operations nor explicit signing of the key material. We present both computational results on automotive-grade controllers as well as bandwidth simulations with industry-standard tools, i.e., CANoe, on modern in-vehicle buses CAN-FD and FlexRay.

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.

Solution of the Diffie-Hellman Problem on Some Elliptic Curves Satisfying GOST 34.10—2018

2020 ◽  
Vol 26 (3) ◽  
pp. 159-168
Author(s):  
M. A. Cherepniov ◽  
◽  
S. S. Gracheva ◽  
Keyword(s):  
Elliptic Curves ◽  
Diffie Hellman

scholarly journals A Secure and Privacy-Aware Smart Health System with Secret Key Leakage Resilience

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Yinghui Zhang ◽  
Pengzhen Lang ◽  
Dong Zheng ◽  
Menglei Yang ◽  
Rui Guo
Keyword(s):  
Health System ◽  
Data Security ◽  
Medical Information ◽  
Patient Privacy ◽  
Secret Key ◽  
Diffie Hellman ◽  
Cryptographic Primitive ◽  
Leakage Resilient ◽  
Smart Health ◽  
Health Data Security

With the development of the smart health (s-health), data security and patient privacy are becoming more and more important. However, some traditional cryptographic schemes can not guarantee data security and patient privacy under various forms of leakage attacks. To prevent the adversary from capturing the part of private keys by leakage attacks, we propose a secure leakage-resilient s-health system which realizes privacy protection and the safe transmission of medical information in the case of leakage attacks. The key technique is a promising public key cryptographic primitive called leakage-resilient anonymous Hierarchical Identity-Based Encryption. Our construction is proved to be secure against chosen plaintext attacks in the standard model under the Diffie-Hellman exponent assumption and decisional linear assumption. We also blind the public parameters and ciphertexts by using double exponent technique to achieve the recipient anonymity. Finally, the performance analysis shows the practicability of our scheme, and the leakage rate of the private key approximates to 1/6.

scholarly journals Easy Decision Diffie-Hellman Groups

2004 ◽  
Vol 7 ◽  
pp. 201-218 ◽  
Author(s):  
Steven D. Galbraith ◽  
Victor Rotger
Keyword(s):  
Elliptic Curves ◽  
Computational Problem ◽  
Diffie Hellman

AbstractThe decision Diffie-Hellman problem (DDH) is a central computational problem in cryptography. It is known that the Weil and Tate pairings can be used to solve many DDH problems on elliptic curves. Distortion maps are an important tool for solving DDH problems using pairings, and it is known that distortion maps exist for all super-singular elliptic curves. An algorithm is presented here to construct suitable distortion maps. The algorithm is efficient on the curves that are usable in practice, and hence all DDH problems on these curves are easy. The issue of which DDH problems on ordinary curves are easy is also discussed.

scholarly journals Video Conference Software Inplementation Based on Data Encryption Using Elliptic Curves

2021 ◽  
Vol 2131 (3) ◽  
pp. 032112
Author(s):  
Olga Safaryan ◽  
Larissa Cherckesova ◽  
Nikolay Boldyrikhin ◽  
Irina Pilipenko ◽  
Tatyana Nikishina ◽  
...  
Keyword(s):  
Elliptic Curves ◽  
Personal Information ◽  
Model Development ◽  
Personal Data ◽  
Software Tool ◽  
Data Encryption ◽  
Video Conference ◽  
Main Task ◽  
Security Model ◽  
Secret Key

Abstract Article is devoted to the development of free program services for video conferencing. Proposed system eliminates security flaws found in other developments. Analysis of security model development using elliptic curves and secret key transfer using Diffie–Hellman algorithm is carried out. Currently, video communication software is used everywhere. Main task of such software applications is help to people communicate with colleagues, relatives and friends at great distances. However, it is very important that their conversation remains confidential, otherwise any information said can get to third parties, and then – cost of leaking personal information can change from damage done to one person to damage done to entire states. Therefore, it is so important to use only software products that have passed certification process when communicating where information with limited access will be used. Software tool has been developed that allows creating secure video conferences with ECIES encryption algorithm on elliptic curves, which allows holding conferences without fear of being compromised. Thus, proposed application significantly increases users security, their personal data, as well as confidentiality of their conversations. Developed software product can be used to conduct secure video conference.

Sign in / Sign up

Export Citation Format

Share Document