Use Of Hash Functions Research Articles

ПРИМЕНЕНИЕ БЛОКЧЕЙН ТЕХНОЛОГИИ В КРИТИЧЕСКИХ РАСПРЕДЕЛЕННЫХ ИНФОРМАЦИОННЫХ СИСТЕМАХ: КОНЦЕПТУАЛЬНЫЕ ОСНОВЫ

Introduction: the most promising approach to the creation of critical distributed information systems is the use of modern information technologies. In this regard, it is of great interest to study the possibilities of building systems of this class based on blockchain technology, which, unlike traditional transactional technology, involves distributed data storage with the formation of a distributed ledger. Purpose: the purpose of the research is to develop a conceptual framework for such an approach, covering the features of blockchain technology. Methods: the goal is achieved by conducting a comparative analysis of blockchain technology and transactional technology, developing an algorithm for the functioning of the system, determining the order of interaction between governing bodies and forming criteria for building a system based on blockchain technology. Results: the results of a comparative analysis showed that the introduction of blockchain technology into critical distributed information systems increases the efficiency of data collection and the availability of information resources stored and transmitted within the system. The developed algorithm for the functioning of a distributed information system based on blockchain technology contains three stages, during which, through the use of hash functions, converting the content of the transmitted document into a digital fingerprint and distributing a chain of data blocks across all network nodes, distributed data storage and complete security are ensured. Practical relevance: the considered order of interaction between governing bodies and exchange of information resources in a system based on blockchain technology demonstrated the possibility of practical implementation of this technology in a critical distributed information system and made it possible to form criteria for its construction. Discussion: as the main criteria, the coefficients of the timeliness of information exchange and the availability of information resources are proposed. To satisfy these criteria, in the search for optimal combinations of parameters for the implementation of blockchain technology, the simulation model of the functioning of a critical distributed information system based on blockchain technology should be used, which is considered as a further research direction."

Chaotic image encryption algorithm based on block theory and reversible mixed cellular automata

In this paper, a new chaotic image encryption algorithm based on block theory and reversible mixed cellular automata model is proposed. Different from traditional confusion-diffusion structure, this paper employs new three-tier architecture, i.e. diffusion-confusion-diffusion. The first diffusion operation adopts the traditional diffusion method, which aims to avoid direct operation on plaintext and further enhance the encryption effect. The next scrambling and diffusion operations are based on image blocks and a new dynamical system, namely reversible mixed cellular automata model. The scrambling operation is divided into two parts, inter block scrambling and intra block scrambling, all the above operations are based on pixel level. Then, diffusion operation is performed and its implementation is based on the evolution of constructed reversible mixed cellular automata with balanced rules. In addition, the initial values and parameters of the adopted chaotic system, two dimensional (2D) Logistic map, are obtained using SHA 256 hash function related to plaintext image. The use of hash function makes the chaotic sequences completely different when encrypt different images, which enhances the ability to resist known-plaintext and chosen-plaintext attacks. Simulation results and performance analysis bear out that the encryption algorithm proposed in this paper has higher security performance and can resist different attacks efficiently.

A verifiable multi-secret image sharing scheme using XOR operation and hash function

In a secret image sharing (SIS) scheme, a dealer (the data owner or a trusted third-party) encodes a secret image into some share images and distributes them among some participants such that each participant receives exactly one share. Most of the secret image sharing schemes assume a trusted dealer and participants. They do not use any verification of the share images while they are presented for secret reconstruction. In this article, we propose a verifiable multi-secret image sharing scheme using Boolean operations and a secure hash function. We consider n secret images for sharing and convert each secret image to a complete noisy image by using a secure hash function, XOR operations, and a specially designed pseudo-random image-matrix generator function. Then, we use XOR operations to generate the share images. The hash function calls are chained in a unique way to enable reconstruction and verification at a low cost for the secret images. The use of hash function also ensures that secrecy of share images and secret images remains consistent. The experimental results and security analysis prove that the scheme is secure and verifiable.

ОБОБЩЕННЫЙ СПОСОБ ПРИМЕНЕНИЯ ХЭШ-ФУНКЦИИ ДЛЯ КОНТРОЛЯ ЦЕЛОСТНОСТИ ДАННЫХ

Data storage systems designed for storing large multidimensional arrays of information, functioning in conditions of destructive influences of an attacker and the environment, are considered. One of the most urgent tasks for such systems is the organization of secure data storage, and taking into account such operating conditions - ensuring their integrity. Ensuring data integrity is a difficult task, due to its complexity, as it includes both recovery and data integrity control. One of the well-known and widely used methods of data integrity control is the use of cryptographic methods, in particular, the hashing function. However, despite the widespread use of hash functions, they have been very little researched, and practical proposals for their use are very few and are characterized by a number of disadvantages associated with the need to introduce a high redundancy of control information. In the context of limitations on the existing resource of data storage systems, this can lead to a decrease in the probability of completing the task of their functioning, or even to its failure. A generalized method is proposed, the use of which will reduce the amount of introduced redundancy when monitoring the integrity of information in data storage systems, based on the use of cryptographic hash functions, a distinctive feature of which is the use of rules for constructing error-resistant codes. In addition, the developed method provides the data integrity control procedure with a new property: the ability to control the integrity of not only the data to be protected, but also the reference hash codes themselves. Calculated data of the required volume of the introduced redundancy are obtained when monitoring the data integrity in existing storage systems using the developed method.

ВИКОРИСТАННЯ СИМЕТРИЧНИХ АЛГОРИТМІВ ШИФРУВАННЯ ДЛЯ ПЕРЕДАЧІ СИГНАЛІВ У ПРИСТРОЯХ БЕЗДРОТОВОГО ВВЕДЕННЯ ДАНИХ

Today, there are many computer systems that are designed to improve, facilitate and improve human life. As more and more researchers become interested in information processing, the development of computer systems is gaining momentum every year. With the development of information systems, possible threats, such as breaches of confidentiality, integrity and availability of processed information, are developing at an equally rapid pace. In order to prevent possible losses, the latest information security systems are constantly updated and improved. Since it is impossible to create a completely secure system, there is always the possibility of data theft, so the problem of protection of information and telecommunications systems is becoming increasingly important. Given that no protection can be perfect, a way has been developed to significantly reduce data breaches. Today, cryptosystems are mostly used to protect information and telecommunications systems and other technologies, including the protection of critical information of the state, enterprise, person or other critical data, including corporate secrets, intelligence or trade secrets.This article presents ways to use symmetric algorithms for signal transmission in remote data input devices. Information on existing algorithms of encryption and use of hash functions is given. A distinction is made between single-key and two-key methods of information encryption. The AES algorithm of its function, work of rounds, schemes of data encryption are considered in detail. The description of each algorithm is accompanied by an example which explains the features of their use. A mathematical model and an example of a block encryption algorithm are presented. The principles of operation of wireless devices are highlighted. Vulnerabilities related to wireless devices are considered and solutions for their protection are proposed.

Secure key agreement based on ordered biometric features

In this work, we propose a novel secure key agreement protocol, Secure Key Agreement using Pure Ordered Biometrics (SKA-POB), in which the cryptographic keys are generated using an ordered set of biometrics, without any extra shared secret data or keys. The proposed approach is instantiated using iris biometrics. Our protocol makes use of hash functions and HMAC (Hash-based Message Authentication Code) as the only cryptographic primitives; thus, it is not cryptographically resource-hungry. We also propose and integrate a window-based comparison strategy and a window reset method in SKA-POB. This way, performance is maximized without sacrificing security. Furthermore, we propose an intelligent fake block generation and distribution strategy to hide the genuine blocks in transit, which increases the resistence of our proposed protocol against correlation attacks. SKA-POB protocol works in round manner, allowing to successfully terminate with key establishment as early as possible so that the complexity is reduced for both client and server sides. Additionally, we employ multi-criteria analyses for our proposed SKA-POB protocol and we provide verification results in terms of performance analysis together with randomness, distinctiveness and attack complexity through security analysis. Results show that highly random and computationally secure keys can be generated with almost no error and with very low complexity.

A multi-agent security framework for cloud data storage

In the last years, cloud computing has emerged as a new information technology (IT) model. Which provides an easy way for data processing and storage remotely through a network. Nowadays, cloud storage has become an attractive storage scheme for users to store their data. When users store their fil es remotely in a cloud storage system, they still worried about the security of their files and the guarantee of the confidentiality and the integrity of them. In this work, we propose a multi-agent framework to provide cloud data storage security. The proposed multi-agent framework enables the security of data in cloud storage by providing both integrity and confidentiality of data. For this purpose, we proposed a client-side encryption method, which is based on the use of both AES and RSA algorithms, it provides the confidentiality and privacy of data besides the performance. Proof of retrievability based on the use of hash function is adopted in our multi-agent framework, to enable data integrity check.

High Speed FPGA Implementation of Cryptographic KECCAK Hash Function Crypto-Processor

Cryptographic hash functions are at the heart of many information security applications like message authentication codes (MACs), digital signatures and other forms of authentication. One of the methods to ensure information integrity is the use of hash functions, which generates a stream of bytes (hash) that must be unique. But most functions can no longer prevent malicious attacks and ensure that the information have just a hash. Because of the weakening of the widely used SHA-1 hash algorithm and concerns over the similarly-structured algorithms of the SHA-2 family, the US National Institute of Standards and Technology (NIST) has initiated the SHA-3 contest in order to select a suitable drop-in replacement. KECCAK hash function has been submitted to SHA-3 competition and it belongs to the final five candidate functions. In this paper, we present the implementation details of the hash function’s KECCAK algorithm, moreover, the proposed KECCAK design has been implemented on XILINX FPGAs. Its area, frequency, throughput and efficiency have been derived and compared and it is shown that the proposed design allows a trade-off between the maximum frequency and the area implementation.

Hash-based Byzantine fault tolerant agreement with enhanced view consistency

This paper presents an authentication-based Byzantine fault tolerant agreement protocol that is capable of detecting the tentative failures in transaction processing systems. The protocol employs a cryptographic hash function to detect crash as well as a few more types of commonly faced arbitrary behaviours manifested by the participating server replicas in the system. We show that the use of hash functions can successfully handle various types of arbitrary faults. In addition, it suggests a preemptive mechanism to proactively detect the malicious replicas. The protocol avoids frequent view changes that contributes to the liveness of the system and ensures continuity in transaction processing.

Research on the Network Security Protocols Based on the Strand Spaces Theory

This paper focuses on different password guessing attack forms of attacker performed based on the strand spaces model. We extend the attacker’s strand spaces model in order to describe and analyze the guessing ability of the attacker. A protocol has been improved by the use of Hash function. The improved protocol has been proved to resist password guessing attack.

Cryptanalysis of a Fragile Watermark Based H.264/AVC Video Authentication Scheme

H.264/AVC is a widespread standard for high definition video (HD) for example DVD and HD videos on the internet. To prevent unauthorized modifications, video authentication can be used. In this paper, we present a cryptanalysis of a H.264/AVC video authentication scheme proposed by Saadi et al. [1] at EUSIPCO 2009. Our result will prevent situations where newer schemes are developed from the scheme thus amplifying the flaw. The designers claimed that the scheme can detect modifications on watermarked video. However, we show that an attacker can modify the watermarked video and compute a valid watermark such that the recipient will retrieve a watermark from the modified watermarked video that will match what the recipient computes during video authentication check. Thus, the recipient will think the tampered video is authentic. The first main problem of the scheme is its use of hash functions for watermark generation. Since hash functions are public functions not depending on any secret, the attacker can modify the watermarked video and feed this through the hash function to compute a new watermark. The second problem is that it is possible for the attacker to perform watermark embedding thus producing a modified watermarked video. On receiving the modified video, the recipient recomputes the watermark and compares this with the watermark extracted from the video. They will match because the embedded watermark and recomputed watermark use the same hash function based watermark generation and the same input i.e. the modified video. Our cryptanalysis strategy applies to any watermarking based video authentication scheme where the watermark and embedding are not functions of secrets. As countermeasure, the functions should be designed so that only legitimate parties can perform them. We present two improved schemes that solve this problem based on private key signing functions and message authentication functions respectively.

A Key Establishment Protocol for RFID User in IPTV Environment

In recent years, the usage of IPTV (Internet Protocol Television) has been increased. The reason is a technological convergence of broadcasting and telecommunication delivering interactive applications and multimedia content through high speed Internet connections. The main critical point of IPTV security requirements is subscriber authentication. That is, IPTV service should have the capability to identify the subscribers to prohibit illegal access. Currently, IPTV service does not provide a sound authentication mechanism to verify the identity of its wireless users (or devices). This paper focuses on a lightweight authentication and key establishment protocol based on the use of hash functions. The proposed approach provides effective authentication for a mobile user with a RFID tag whose authentication information is communicated back and forth with the IPTV authentication server via IPTV set-top box (STB). That is, the proposed protocol generates user's authentication information that is a bundle of two public keys derived from hashing user's private keys and RFID tag's session identifier, and adds 1bit to this bundled information for subscriber's information confidentiality before passing it to the authentication server.

Leaky Random Oracle

This work focuses on a vulnerability of hash functions due to sloppy usages or implementations in the real world. If our cryptographic research community succeeded in the development of a perfectly secure random function as the random oracle, it might be broken in some sense by invalid uses. In this paper, we propose a new variant of the random oracle model in order to analyze the security of cryptographic protocols under the situation of an invalid use of hash functions. Our model allows adversaries to obtain contents of the hash list of input and output pairs arbitrarily. Also, we analyze the security of several prevailing protocols (FDH, OAEP, Cramer-Shoup cryptosystem, Kurosawa-Desmedt cryptosystem, NAXOS) in our model. As the result of analyses, we clarify that FDH and Cramer-Shoup cryptosystem are still secure but others are insecure in our model. This result shows the separation between our model and the standard model.

On the Use of Hash Functions as Preprocessing Algorithms to Detect Defects on Repeating Definite Textures

Hash functions are one way functions and often used in cryptography to ensure the integrity of files by creating a binary signature specific to that file. In a similar way, a family of special hash functions can be developed and used to generate one dimensional signatures of an image. The resultant signatures can then be used to compare the image either to a golden template or, if the image consists of repeating definite patterns, then to the texture itself. While such hash functions are sensitive enough to detect small changes and defects in repeating texture, they are immune to changes in illumination and contrast. In this paper we discuss the generation of suitable hash functions for textured images, which are simple enough to fit into a very small FPGA, and provide several examples of their use.

Security Flaw in SAS-2 Protocol

SAS-2 is an alternative of a one-time password authentication protocol SAS, and is developed in order to reduce overhead due to the use of hash functions. The idea of both algorithms is sharing a similar secret number called the verifier that allows a client to be authenticated and that is changed for each new session. However, some of the combinations proposed in [1] to transmit the verifier may contain a security flaw, and the insecure combination results in vulnerability to impersonation attacks.

A new threshold signature scheme using self-certified public keys

To prevent active attack, we propose a new threshold signature scheme using self-certified public keys, which makes use of hash function and discrete logarithm problem. The scheme has less commutnication and computation cost than previous schemes. Furthermore, the signature process of the proposed scheme is non-interative.

Space Efficient Hash Tables with Worst Case Constant Access Time

We generalize Cuckoo Hashing to d-ary Cuckoo Hashing and show how this yields a simple hash table data structure that stores n elements in (1 + e)n memory cells, for any constant e > 0. Assuming uniform hashing, accessing or deleting table entries takes at most d=O (ln (1/e)) probes and the expected amortized insertion time is constant. This is the first dictionary that has worst case constant access time and expected constant update time, works with (1 + e)n space, and supports satellite information. Experiments indicate that d = 4 probes suffice for e ≈ 0.03. We also describe variants of the data structure that allow the use of hash functions that can be evaluated in constant time.

A logic of authentication

Questions of belief are essential in analysing protocols for the authentication of principals in distributed computing systems. In this paper we motivate, set out, and exemplify a logic specifically designed for this analysis: we show how various protocols differ subtly with respect to the required initial assumptions of the participants and their final beliefs. Our formalism has enabled us to isolate and express these differences with a precision that was not previously possible. It has drawn attention to features of protocols of which we and their authors were previously unaware, and allowed us to suggest improvements to the protocols. The reasoning about some protocols has been mechanically verified. This paper starts with an informal account of the problem, goes on to explain the formalism to be used, and gives examples of its application to protocols from the literature, both with shared-key cryptography and with public-key cryptography. Some of the examples are chosen because of their practical importance, whereas others serve to illustrate subtle points of the logic and to explain how we use it. We discuss extensions of the logic motivated by actual practice; for example, to account for the use of hash functions in signatures. The final sections contain a formal semantics of the logic and some conclusions.

A remark on hash functions for message authentication

This paper considers the use of hash functions for message authentication. It is shown that a proposed method for using hash functions does not provide a secure non-repudiation service.