One-way Function Research Articles

An Efficient Authenticated Key Agreement Scheme Supporting Privacy-Preservation for Internet of Drones Communications.

In recent years, due to the rapid development of Internet of things (IoTs), various physical things (objects) in IoTs are smart enough to make their own decisions without the involvement of humans. The smart devices embedded in a drone can sense, collect, and transmit real-time data back to the controller from a designated environment via wireless communication technologies. The mobility, flexibility, reliability and energy efficiency of drones makes them more widely used in IoT environments such as commercial, military, entertainment applications, traffic surveillance and aerial photography. In a generalized IoD architecture, we have communications among the drones in a flying zone, among the drones and the control server, and also among the drones and authorized user. IoD still has many critical issues that need to be addressed, such as data access being carried out through a public channel and battery operated drones. To address these concerns in IoD communications, in this paper, an efficient authentication and secure communication scheme with privacy preservation is proposed and it only uses secure one-way hash function and bitwise XOR operations when control server, drone and user mutually authenticate each other. After the successful authentication, both IoD-based participants can agree on a common session key to secure the subsequent communication messages. The widely accepted ProVerif and BAN logic analysis have been used to assure that the proposed scheme is provably secure against existing well-known security attacks and ensures privacy. Finally, a comparative analysis is presented to demonstrate the proposed scheme preserves efficiency when compared to existing competitive schemes.

An optical-cryptographic encryption scheme using a keystream synthesizer based on chaotic speckle nature

We propose a comprehensive and efficient optical-cryptographic encryption scheme to improve the security of vulnerable optical encryption systems. Based on cryptography theory, we increase data protection using diffusion-confusion processes acting in the input and output of the optical encryption scheme. The new enhanced ciphertext has attributes of a one-way function that is easy to achieve but almost impossible to revert without the correct random phase masks used for diffusion-confusion operations. Despite the straightforward design, combining optical, cryptographic, and chaos methods increases the number of encryption–decryption keys raising two significant concerns. First, the management and transmission of several keys carry a high storage footprint, and second, it impairs the optical high-speed information processing capability. We overcome these two drawbacks by applying a new optical keystream synthesizer based on the stochastic speckle nature and a maximum entropy constraint in a forward–backward propagation algorithm. This new approach quickly replicates the necessary keystream in the encryption–decryption stations offering higher security and efficiency than other reported systems. We validate the feasibility of this proposal by synthesizing an experimental keystream and performing 24-bit data encryption–decryption. Then, we verify the security improvement of two vulnerable cryptosystems and their robustness against cryptanalysis attacks. Finally, we perform experimental encryption–decryption.

Privacy conserving authenticated key settlement approach for remote users in IoT based Telecare Medicine information system

The Fourth Healthcare Industrial Revolution is transforming the traditional healthcare service to Internet of Things (IoT) based smart healthcare system. Telecare medicine information system (TMIS) is one of them which demands 100% electronic transaction. In this situation, User authentication, fortifies the legitimate patients, doctors, medical helper staffs, etc. Not only that, but it also allows them to access the remote medical servers to serve medical services. Robust and Efficient user authentication plays a vital role here. Many researchers proposed different techniques, but all of them have different limitations like computational expenses, huge memory usage, excessive communication overhead, etc. In this article, a very lightweight authentication approach of remote user is demonstrated in IoT based smart healthcare environment. This approach optimizes the use of one-way hash function, exclusive-or operation and extended One-Time-Password which make the authentication approach lighter and effective. The security strength of the recommended protocol is elaborated with the help of informal and formal security analysis. Well known BAN logic and Real-Or-Random (ROR) model are used in to check the correctness of the protocol and ensure the security of the established session key. In addition to that, AVISPA (automated validation of Internet security protocols and applications) and ProVerif software simulation tools are utilized which parade, the proposed protocol is safe and secure against many attacks like Man-In-The-Middle attack and Replay attack, Ephemeral secret leakage attack, Known-session-specific-temporary-information attack, Impersonation attack, etc. and maintain the secrecy of the session key. Furthermore, the recommended protocol is compared with the existing/recently published protocols to exhibit better performance.

Вдосконалення методів генерації ключів шифрування за допомогою дивних атракторів

The urgency of the work is determined by the need to transfer confidential information through open communication channels. Such information can be of two types: symmetric encryption keys and directly informational messages that are encrypted with encryption keys. The article deals with the problem of improving the transmission of closed information over open channels using the Diffie- Hellman algorithm. The improvement is due to the introduction of a new type of one-sided function based on the numerical solution of the system of ordinary differential equations describing the dynamics of the phase coordinate movement of the strange attractor. For this purpose, the classic Diffie-Hellman algorithm based on the one-sided function of the discrete logarithm was considered. The required properties of one-sided functions in the general case were considered. Next, the peculiarities of algorithm modification in the case of transition to a one-sided function based on the use of a strange attractor were considered. It is assumed that at the beginning of the operation of the modified algorithm, through a secret channel, the exchange parties (agents) exchange information regarding the properties of the strange attractor to be used, namely, the definition of the differential equations describing the dynamics of a strange attractor, the values of the parameters of the equations, the initial integration conditions and the integration step (for methods with a constant step of integration). After that, all exchanges are conducted exclusively through open channels. The paper also considers the case of information exchange between more than two agents, in particular, the approach of hiding the number of agents participating in the exchange. Approbation of the method is carried out and intermediate and final results of the one-sided function based on strange attractors are given. Possibilities regarding partial disclosure by agents of certain parameters of the use of one-way functions are discussed. But at the same time, the safety of revealing such information is justified in the general case (both in the classical and in the modified Diffie-Hellman method). It was determined that depending on the needs of users, the complexity of the encryption keys can be increased by changing the initial parameters of the attractor, which will also allow controlling speed of key generation and encryption in general. The software that implements the proposed modified algorithm is implemented in three programming languages, C#, Python, and MatLab. This made it possible to perform a comparative analysis of the results and consciously choose the programming language of individual parts of the software to optimize the encryption key generation process for specific conditions.

Security Access Control Method for Wind-Power-Monitoring System Based on Agile Authentication Mechanism

With the continuous increase in the proportion of wind power construction and grid connection, the deployment scale of state sensors in wind-power-monitoring systems has grown rapidly with an aim on the problems that the communication authentication process between the wind turbine status sensor and the monitoring gateway is complex and the adaptability of the massive sensors is insufficient. A security access control method for a wind-power-monitoring system based on agile authentication mechanism is proposed in this paper. First, a lightweight key generation algorithm based on one-way hash function is designed. The algorithm realizes fixed-length compression and encryption of measurement data of any length. Under the condition of ensuring security, the calculation and communication cost in the later stage of authentication are effectively reduced. Second, to reduce the redundant process of wind turbine status sensor authentication, an agile authentication model of wind turbine status sensor based on a lightweight key is constructed. Constrained by the reverse order extraction of key information in the lightweight keychain, the model can realize lightweight communication between massive wind turbine status sensors and regional gateways. Finally, the proposed method is compared and verified using the wind turbine detection data set provided by the National New Energy Laboratory of the United States. The experimental results show that this method can effectively reduce the certification cost of a wind-power-monitoring system. Additionally, it can improve the efficiency of status sensor identity authentication and realize the agility and efficiency of the authentication process.

IPChain: Blockchain-Based Security Protocol for IoT Address Management Servers in Smart Homes

The dynamic host configuration protocol (DHCP) servers are forms of an Internet of Things (IoT) address management server (IoTAMS) that gives network configuration settings to newly connected hosts. Administrators of a network may save time by setting DHCP servers instead of every network node. However, the absence of a more robust authentication method for DHCP servers makes hosts susceptible to attacks since neither the server nor the users are able to check the other’s authenticity during DHCP connections. These concerns result in both internal and external threats to the system that have the potential to impair network services. Among these threats are malicious DHCP servers and DHCP starvation. This paper aims to provide a novel approach for tackling these issues and protect the DHCP protocol. The proposed model uses the Diffie–Hellman key exchange mechanism, the elliptic curve discrete logarithm problem (ECDLP), a one-way hash function, blockchain technology, and a smart contract. In addition, registration and validation processes provide support for the proposed model in combating DHCP risks for both internal and external system threats. Results from this study show that the proposed model has an average of 21.1% more resistance to a growing number of adversaries than the benchmark models, thus revealing that the model is better suited for the security of IoT address management servers in smart homes, thereby enhancing resilience against related threats and the success of IP address management.

A Modified Wei-Hua-He Digital Signature Scheme Based on Factoring and Discrete Logarithm

A symmetric cipher such as AES in cryptography is much faster than an asymmetric cipher but digital signatures often use asymmetric key ciphers because they provides the sender’s identity and data integrity. In this paper, a modified-He digital signature scheme is proposed using a one-way hash function. The proposed scheme, unlike the He signature technique, employs Euclid’s Division Lemma with large prime moduli p. Its security is built on large integer factoring, discrete logarithms and expanded root problems. The time complexity of the proposed scheme is O(log3p). The proposed modified-He scheme is efficient, as evidenced by the analytical results with key lengths greater than 512 bits.

An improved biometric based user authentication and key agreement scheme for intelligent sensor based wireless communication

The new communication technologies have changed the traditional networks processes and provides more feasible, and convenient services for healthcare, agriculture, and transportation. Ad hoc networks devices have limited resources for energy, storage and processing. The conventional and traditional security solutions are not suitable for small and tiny sensor nodes. The symmetric cryptography method consumes more energy than public key cryptography method, whereas the public key cryptography method is a resource-intensive and not suitable for wireless networks. The symmetric cryptosystems have key management issues. Different authentication mechanisms have been designed but almost all of them are either complex or insecure. Improving network security with less resources consumption, there is a need to design and develop more advance and lightweight solution. This paper proposed a Biometric based User Authentication and Key Agreement Protocol (BUAKA) that uses a fuzzy extractor and one-way hash functions for sensor nodes authentication. The proposed scheme has four phases: initialization, registration, authentication, and password renewal phase. The proposed scheme resolves the complexities issues by providing a secure authentication mechanism and provide great resilience against a number of attacks. Finally, the proposed scheme is evaluated using several parameters such as security attacks, computational cost, and communication overhead to measure the effectiveness of proposed scheme.

A Lightweight and Anonymous Authentication and Key Agreement Protocol for Wireless Body Area Networks

As a major building block of Healthcare 4.0, wireless body area networks (WBANs) play an important role in collecting patient’s real-time physical phenomena through small wearable or implantable intelligent medical devices and communicating with remote medical experts using short-range wireless communication techniques. However, the challenges of securing information access are partly evidenced by the difficulty in designing secure and efficient security protocols. For example, existing authentication and key agreement schemes have either potential security vulnerabilities or high communication and computation overhead. In this article, we propose a lightweight and anonymous authentication and key agreement protocol, also called liteAuth, for WBANs. In our approach, mutual authentication and session key agreement are achieved using the Tinkerbell map-based random shuffling, physical unclonable function, one-way hash function, and bitwise exclusive OR operation. The security of liteAuth is first verified using the AVISPA tool, and then its cyber resilience is analyzed. In addition, we develop a real-world testbed, implement liteAuth and two existing schemes (i.e., PSLAP and HARCI), and conduct experiments for performance evaluation and analysis. Experimental results indicate that liteAuth can improve the performance of communication overhead and computation time as well as reduce energy consumption, while meeting all security requirements.

A biometrics-based mutual authentication and key agreement protocol for TMIS using elliptic curve cryptography.

Telecare Medicine Information System (TMIS) refers to a medical model that uses communication and information technology to realize multiple medical functions such as remote disease diagnosis, treatment, and health care. Because TMIS is carried out on an insecure public Internet, a large number of mutual authentication and key agreement protocols for TMIS have been proposed to protect the privacy of patients. Recently, Ostad-Sharif et al. proposed a novel anonymous authentication and key agreement scheme for TMIS. In this work, we will demonstrate that Ostad-Sharif et al.’s scheme exists the problems of strong authentication and inefficient password change, and it cannot resist the off-line password guessing attack. To overcome the weaknesses found in Ostad-Sharif et al.’s scheme, we propose a biometrics-based mutual authentication and key agreement protocol for TMIS, making full use of the advantages of one-way hash function and elliptic curve cryptosystem (ECC). The security of the proposed scheme is formally proved under the widely used random oracle model (ROM), and various known malicious attack resistances also are presented by the heuristic discussion. Compared with the existing related schemes, the computation cost and communication overhead of our scheme are reduced by 74.5% and 27.3% respectively.

ETP-AKEP Enhanced Three Party Authenticated Key Exchange Protocols for Data Integrity in Cloud Environments

With key exchange protocols, a secure session key is generated between two remote users and servers and exchanged between them. It is generally used to prevent unauthorized users from gaining access to sensitive data. This article presents an enhanced three party authenticated key exchange protocols (ETP-AKE) protocol that does not depend on symmetric key encryption and instead uses asymmetric key encryption. A key component of the proposed ETP-AKE protocol is using elliptic curve encryption in conjunction with a one-way hash function. Its integrity certification was confirmed via the usage of the AVISPA tool package. The proposed protocol is intended to protect against various security threats, including the man-in-the-middle assault, the parallel attack, and the key-compromise attack, among others.

Two Quantum Proxy Blind Signature Schemes Based on Controlled Quantum Teleportation

We present a scheme for teleporting an unknown, two-particle entangled state with a message from a sender (Alice) to a receiver (Bob) via a six-particle entangled channel. We also present another scheme for teleporting an unknown one-particle entangled state with a message transmitted in a two-way form between the same sender and receiver via a five-qubit cluster state. One-way hash functions, Bell-state measurements, and unitary operations are adopted in these two schemes. Our schemes use the physical characteristics of quantum mechanics to implement delegation, signature, and verification processes. Moreover, a quantum key distribution protocol and a one-time pad are adopted in these schemes.

Continuous Encryption Functions for Security Over Networks

This paper presents a study of continuous encryption functions (CEFs) of secret feature vectors for security over networks, which include physical layer encryption for wireless communications and biometric template security for online Internet applications. While CEFs are defined here to include all prior continuous one-way functions, a good CEF is defined to be a continuous function that turns a random feature vector of limited dimension into a long sequence of numbers in such a way that it is hard to invert and hard to substitute, it has no or little amplification of noise, and its output samples have zero or near-zero correlations and have identical or nearly identical distributions. A number of prior CEFs, such as dynamic random projection, index-of-max hashing and higher-order polynomials, are all shown to fail on these criteria. Based on selected components of singular value decomposition (SVD) of randomly modulated matrices of the feature vector, a family of SVD-CEFs is proposed. Such a SVD-CEF is shown to meet all the criteria for a good CEF and outperform the prior CEFs significantly.

Optical asymmetric JTC cryptosystem based on binary phase modulation and image superposition-subtraction operation.

The joint transform correlator (JTC) cryptosystem is a simple and practical optical cryptosystem. But its identical key in both encryption and decryption brings security risks in the key distribution and management. To overcome these drawbacks, we first create a trapdoor one-way function based on image superposition and subtraction operation. Then combined with the one-way binary phase modulation, an optical asymmetric JTC cryptosystem is proposed in this paper. These two kinds of trapdoor one-way functions are not only effective and implementable, but also can greatly enhance the ability of our proposal to resist various attacks. In addition, we select the structured spiral phase mask (SSPM) controlled by its structural parameters as the key mask of the JTC cryptosystem to facilitate the key transmission. When the structural parameters of the SSPM are protected by the RSA algorithm during encryption and decryption, not only the security of the proposed cryptosystem can be enhanced, but also the key distribution and management will be improved. This also makes our proposal conform more closely to the basic agreement of the public key cryptosystem. Simulation analysis and initial experimental results verified the correctness and feasibility of our proposal.

Implementasi Fungsi Hash Dengan Algoritma Sha-256 Pada Aplikasi Duplicate Image Scanner

Nowadays we are in the era of the digital world, there are lots of equipment that has a tool for recording photos in the form of a camera on a smartphone. The weakness of smartphones is the small storage space, so users must be good at managing files stored on the smartphone. There are so many applications in smartphones that provide facilities for sharing images. This of course will greatly burden the storage space of the smartphone because it stores image files which are generally large in size, especially if the image files are the same or duplicate, of course it is very burdensome for storage space. It will be very difficult to distinguish an image file without looking at the contents of the image file. So if you want to distinguish one image file from another, the user must see the contents of the image file and this will certainly be very difficult. For that we need a method that can be used to identify the same image file or duplicate image files so that a decision can be made to delete the duplicate document files so as to save storage space. In cryptography there is a hash function which is a one-way function that can generate the identity of a file, where if the image file contains the same content, it will produce the same hash value. It can be used to identify the same or duplicate image files. In the hash function there is the SHA-256 method or the Secure Hash Algorithm 256 which is one of the hashing algorithms that is often used to encrypt data with a length of 256 bits. By applying this algorithm to the file scanner application, the results of the image file search are grouped based on the same hash value and users can make it easier and faster for users to delete duplicate image files without having to open and view the contents of the file.

Multi-factor based session secret key agreement for the Industrial Internet of Things

Industrial Internet of Things (IIoT) is the main field of application of the Internet of Things (IoT). The high degree of autonomy and resource constraints of the IIoT network poses challenges to the security of IIoT. Enabling the legitimate users to securely and remotely access resource-constrained intelligent terminal nodes in an open wireless channel has become a challenge in the IIoT environment. User authentication and key agreement schemes have been proposed for different IoT application scenarios to solve this problem. However, most existing three-party authentication and key agreement schemes for remote users have high computational costs and do not consider sufficient security attributes, such as unlinkability and anonymity. To address the aforementioned problems, the proposed scheme uses the IIoT as the application scenario and proposes a novel three-factor authentication and lightweight remote user identity authentication key agreement. This scheme is effective for devices with limited resources because it mainly uses a one-way hash function and a bitwise XOR operation. The security of the proposed scheme is demonstrated under the real-or-random model via a rigorous formal security analysis.

Ensure the dynamic identity and PUF based authenticated key settlement approach for the IoT infrastructure

With technological advancements, the dependency on the Internet of things (IoT) has increased. The spectrum of IoT application domain becomes larger day by day. It converts the existing services into smart services. The evolution brings lot of security challenges hand in hand with IoT paradigms. This is due to the limitation of IoT devices like, low computational capabilities, small storage medium, less power back up and low processing speed, etc. To overcome these limitations, a proper authentication technique must be required to do the trust management in a heterogeneous IoT environment and secure all kinds of traffic. In this research document, a dynamic identity-based authentication approach is introduced for IoT environment, which utilizes very lightweight physical unclonable function, one-way hashing function and exclusive-OR(XOR) function to make the scheme lighter. Broadly accepted the Real or Random (RoR) model and the Burrows Abadi Needham logic (BAN logic) are used here, to check the security and the correctness of the devised protocol. In addition to that, the software simulation tool, Automated validation of Internet security protocols and applications (AVISPA) has proved that, the recommended protocol is safe and secure from various attacks. Furthermore, the comparative performance analysis exhibits the supremacy of the recommended scheme over the analogous schemes w.r.t computational power, memory usage, and communication overhead.

Lightweight Authenticated Privacy-Preserving Secure Framework for the Internet of Vehicles

The integration of the Internet of things and dynamic vehicles has become unavoidable in advanced transportation systems. The vehicles communicate wirelessly with other vehicles, cloud servers, and roadside units via open communication channels. The openness of the above-mentioned entities and their communication tools introduces new difficulties, such as data privacy, vulnerabilities, data integrity, and scalability. To enhance data privacy and ensure security, a lightweight authenticated privacy-preserving secure framework is presented in the Internet of vehicles deployment. The proposed scheme can achieve confidentiality, privacy, authenticity, integrity, anonymity, and perfect forward secrecy based on blockchain technology, elliptic curve cryptography, and a one-way hash function. The proposed framework is secure against well-known cyberattacks, including replay attacks, man-in-the-middle attacks, traffic analysis attacks, and DDoS attacks. The security analysis shows the robustness of the proposed scheme. Finally, the results demonstrate that the proposed framework is efficient and feasible in practice.

TrES: Tropical Encryption Scheme Based on Double Key Exchange

Shor’s quantum algorithm establishes a polynomial time attack on the discrete logarithm problem in any group. Recent announcements of progress in building quantum computers highlight the need for new concepts to create cryptosystems that are resistant to quantum attacks. In this paper, we present а new message encryption scheme. To enhance the security of the scheme, we suggest double key-exchange protocol (KEP). The first stage of the key exchange uses a matrix power function (MPF) in a tropical semiring. These functions are based on the action of a matrix semiring acting on some matrix set. MPFs can be considered as one-way functions because they are based on some generalized satisfiability problems that are potentially NP-complete. The obtained shared secret key at the first stage of the key exchange serves as an input for the second stage. The security of the second phase relies on the difficulty of the semiring action problem. In our protocol, we suggest using left or right action of the tropical semiring (which can be both min-plus and max-plus) on the group of commutative matrices (circulant matrices, in our case). The fact that the key-exchange protocol works in two phases contributes to its security, since an attacker needs to solve two difficult problems in order to break it. The main advantages of the presented protocol are: the increased efficiency and improved security.

Network Security Situational Awareness Based on Genetic Algorithm in Wireless Sensor Networks

How to design an effective and secure user authentication scheme suitable for complex wireless sensor network (WSN) environments has very important research significance. Based on the genetic algorithm theory, the paper constructs the security situational awareness model of wireless sensor network, and studies the WSN user security authentication scheme. The model uses the genetic algorithm extraction technology combined with the hash function to generate the biometric key, which solves the data accuracy problem of network security situational awareness: the user’s biometric key is obtained through the fuzzy extraction technology; the resistance of the node is to be attacked, but it is powerless when most of the nodes are broken, and it limits the scalability of the network. During the simulation process, the authentication of the identity of the cluster head by the base station is added in the topology establishment stage, and a one-way hash function and a shared key are added to the key management, so that the encryption key and the authentication key change periodically and dynamically, so that enhanced network communication security. The analysis results show that the protocol is feasible. The algorithm proposed in this paper reduces about 70% of the features in the original feature set, the classification detection rate is increased from 95.7212% to 97.7379%, and the false alarm rate is reduced from 7.9427% to 3.1072%, effectively improving the balance between safety and design cost.