Adding Channel Security to a Fingerprint Verification Chain

2017 ◽  
Author(s):  
Matthias Wenzl ◽  
Daniel Kluka
Keyword(s):  
Communication Channel ◽  
Negative Impact ◽  
Small Companies ◽  
Fingerprint Verification ◽  
Diffie Hellman ◽  
Man In The Middle ◽  
Read Request ◽  
Run Time ◽  
Diffie Hellman Key Exchange ◽  
Comparison Algorithms

Authenticating persons using fingerprints is a widely accepted method in the field of access control, border control, prosecution and many others. Today, fingerprint modules with customizable firmware can be bought commercially off the shelf by hobbyists and small companies to be used in their applications and are usually locally separated from a controller implementing the feature extraction and comparison algorithms. As a matter of fact, the communication channel between the sensor and the controller module is susceptible to eavesdropping and man in the middle attacks. Nevertheless, adding communication channel security to such a system has a direct negative impact on the system’s response time, thus directly affecting user acceptance. The aim of this paper is to provide a comprehensive investigation on measures to counter run-time degredation when adding communication channel security on behalf of an existing fingerprint verification chain. We show that a combination of the elliptic curve Diffie-Hellman key exchange together with AES-256 and the use of parallelization using OpenMP on a controller node leads to an acceptable run time making key creation and exchange upon every fingerprint read request a suitable undertaking.

scholarly journals Emerging Security Challenges for Ubiquitous Devices

2021 ◽  
pp. 3-18
Author(s):  
Mirosław Kutyłowski ◽  
Piotr Syga ◽  
Moti Yung
Keyword(s):  
Large Scale ◽  
Covert Channels ◽  
Large Scale Systems ◽  
Identity Information ◽  
Diffie Hellman ◽  
Security Challenges ◽  
Man In The Middle ◽  
Cryptographic Algorithms ◽  
Diffie Hellman Key Exchange ◽  
Implicit Identity

AbstractIn this chapter we focus on two important security challenges that naturally emerge for large scale systems composed of cheap devices implementing only symmetric cryptographic algorithms. First, we consider threats due to poor or malicious implementations of protocols, which enable data to be leaked from the devices to an adversary. We present solutions based on a watchdog concept—a man-in-the-middle device that does not know the secrets of the communicating parties, but aims to destroy covert channels leaking secret information. Second, we deal with the problem of tracing devices by means of information exchanged while establishing a communication session. As solutions such as Diffie-Hellman key exchange are unavailable for such devices, implicit identity information might be transmitted in clear and thereby provide a perfect means for privacy violations. We show how to reduce such risks without retreating to asymmetric algorithms.

scholarly journals Diffie-Hellman Key Exchange through Steganographied Images

2018 ◽  
Vol 10 (1) ◽  
pp. 147-160
Author(s):  
Amine Khaldi
Keyword(s):  
Digital Signature ◽  
Data Exchange ◽  
Key Exchange ◽  
Private Key ◽  
Diffie Hellman ◽  
Man In The Middle ◽  
Diffie Hellman Key Exchange ◽  
Set Up ◽  
Secure Channel

Purpose – In a private key system, the major problem is the exchange of the key between the two parties. Diffie and Hellman have set up a way to share the key. However, this technique is not protected against a man-in-the-middle attack as the settings are not authenticated. The Diffie-Hellman key exchange requires the use of digital signature or creating a secure channel for data exchanging to avoid the man-in-the-middle attack. Methodology/approach/design – We present a Diffie-Hellman key exchange implementation using steganographied images. Using steganography made invisible the data exchange to a potential attacker. So, we will not need a digital signature or creating a secure channel to do our key exchange since only the two concerned parts are aware of this exchange. Findings – We generate a symmetric 128-bit key between two users without use of digital signature or secure channel. However, it works only on bitmap images, heavy images and sensitive to compression.

scholarly journals An Improved Diffie-Hellman Protocol Security Using Video Entropy

2020 ◽  
Vol 55 (6) ◽  
Author(s):  
Rasha M. Mohsin ◽  
Rasha I. Ahmed ◽  
Zinah R. Hussein
Keyword(s):  
Discrete Logarithm ◽  
Key Exchange ◽  
High Definition ◽  
Video Frames ◽  
Diffie Hellman ◽  
Man In The Middle ◽  
Secret Keys ◽  
Shared Secret ◽  
Diffie Hellman Key Exchange ◽  
Secure Channels

The Diffie-Hellman is a key exchange protocol to provide a way to transfer shared secret keys between two parties, although those parties might never have communicated together. This paper suggested a new way to transfer keys through public or non-secure channels depending on the sent video files over the channel and then extract keys. The proposed method of key generation depends on the video file content by using the entropy value of the video frames. The proposed system solves the weaknesses in the Diffie-Hellman key exchange algorithm, which is MIMA (Man-in-the-Middle attack) and DLA( Discrete logarithm attack). When the method used high definition videos with a vast amount of data, the keys generated with a large number up to 500 per frame, and each number value reaches more than 1000 to be used or switched when needed. The method also provides some difficulty in guessing the keys from the transmitted video and the reason for the development and emergence of many communication programs Viber, WhatsApp, and other programs, enabling to use the proposed method in these programs.

scholarly journals Novel Quantum Encryption Algorithm Based on Multiqubit Quantum Shift Register and Hill Cipher

2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Rifaat Zaidan Khalaf ◽  
Alharith Abdulkareem Abdullah
Keyword(s):  
Key Management ◽  
Shift Register ◽  
The Novel ◽  
Cryptographic Algorithm ◽  
Diffie Hellman ◽  
Hill Cipher ◽  
Man In The Middle ◽  
Diffie Hellman Key Exchange ◽  
The Hill ◽  
Attack Strategy

Based on a quantum shift register, a novel quantum block cryptographic algorithm that can be used to encrypt classical messages is proposed. The message is encoded and decoded by using a code generated by the quantum shift register. The security of this algorithm is analysed in detail. It is shown that, in the quantum block cryptographic algorithm, two keys can be used. One of them is the classical key that is used in the Hill cipher algorithm where Alice and Bob use the authenticated Diffie Hellman key exchange algorithm using the concept of digital signature for the authentication of the two communicating parties and so eliminate the man-in-the-middle attack. The other key is generated by the quantum shift register and used for the coding of the encryption message, where Alice and Bob share the key by using theBB84 protocol. The novel algorithm can prevent a quantum attack strategy as well as a classical attack strategy. The problem of key management is discussed and circuits for the encryption and the decryption are suggested.

Research on psychological stress intervention of college students based on Diffie-hellman key exchange algorithm

2021 ◽  
pp. 1-7
Author(s):  
Yibo Liu ◽  
Xuejing Hao ◽  
Yanjun Mao
Keyword(s):  
College Students ◽  
Psychological Stress ◽  
Original Data ◽  
Key Exchange ◽  
Psychological Burden ◽  
Exchange Algorithm ◽  
Diffie Hellman ◽  
Stress Intervention ◽  
Psychological Pressure ◽  
Diffie Hellman Key Exchange

At present, the mental health of college students has also become an important issue that urgently needs attention under the influence of the surrounding environment. It is coupled with the grim employment situation after graduation and the students’ psychological burden is becoming more and heavier. This paper based on Diffie-Hellman key exchange algorithm studied the effect of psychological stress intervention. First, the Diffie-Hellman key exchange algorithm was analyzed, and then the Diffie-Hellman prediction model was established according to the psychological pressure of college students. Secondly, the simulation test was conducted to compare the simulated results with the original data. The conclusion of the data fitting of the network model training set, verification set and test set were good and the error was very small. Finally, the detailed application of the algorithm and the model were described.

Sign in / Sign up

Export Citation Format

Share Document