hash
196112524
Integrity verification for digital Holy Quran verses using cryptographic hash function and compression
Abstract Data Integrity is one of the primary concepts in information security. The main task of the cryptographic hash function is to assure the integrity of the transmitted data. In this work, integrity verification methods for digital verses of the Holy Quran are proposed. The first method uses cryptographic hash functions and generate the hash table of the Holy Quran. SHA256 and RIPEMD160 hash functions are chosen in this work. The second method is a single compression technique which manipulates data during the run time. The compression method makes use of the two bytes in Unicode UTF 8 for the Arabic characters set. The results show that for a digital copy of the Holy Quran encoded in Unicode UTF 8, the sizes of the hash tables generated by SHA256 and RIPEMD160 are 84.73% and 90.46% (6.55 fold and 10.48 fold) smaller respectively. The compressed version of the Holy Quran has a size of 47.24% (1.9 fold) smaller than the original copy. In addition, a second preimage attack on a hash table for the digital Holy Quran produced by using CRC32 hash function is conducted to study the impact of such attacks on the two hash tables proposed in this work.
J. King Saud Univ. Comput. Inf. Sci.
Mishal Almazrooie Azman Samsudin Adnan Abdul-Aziz Gutub Muhammad Syukri Salleh Mohd Adib Omar SHAHIR AKRAM HASSAN
229073672
Recommendation for Stateful Hash Based Signature Schemes
This recommendation specifies two algorithms that can be used to generate a digital signature, both of which are stateful hash based signature schemes: the Leighton Micali Signature (LMS) system and the eXtended Merkle Signature Scheme (XMSS) along with their multi tree variants, the Hierarchical Signature System (HSS) and multi tree XMSS (XMSSMT)
David A Cooper Daniel Apon Quynh Dang Michal Davidson Morris Dworkin Carl A Miller
210043112
Data Query Mechanism Based on Hash Computing Power of Blockchain in Internet of Things
In the IoT (Internet of Things) environment, smart homes, smart grids, and telematics constantly generate data with complex attributes. These data have low heterogeneity and poor interoperability, which brings difficulties to data management and value mining. The promising combination of blockchain and the Internet of things as BCoT (blockchain of things) can solve these problems. This paper introduces an innovative method DCOMB (dual combination Bloom filter) to firstly convert the computational power of bitcoin mining into the computational power of query. Furthermore, this article uses the DCOMB method to build blockchain based IoT data query model. DCOMB can implement queries only through mining hash calculation. This model combines the data stream of the IoT with the timestamp of the blockchain, improving the interoperability of data and the versatility of the IoT database system. The experiment results show that the random reading performance of DCOMB query is higher than that of COMB (combination Bloom filter) and the error rate of DCOMB is lower. Meanwhile, both DCOMB and COMB query performance are better than MySQL (My Structured Query Language)
Sensors
Yongjun Ren Fujian Zhu Pradip Kumar Sharma Tian Wang Jiongtao Wang Osama Alfarraj Amr M Tolba
211227142
Fast and Accurate Detection of Unknown Tags for RFID Systems Hash Collisions are Desirable
Unknown RFID tags appear when tagged items are not scanned before being moved into a warehouse, which can even cause serious security issues. This paper studies the practically important problem of unknown tag detection. Existing solutions either require low cost tags to perform complex operations or beget a long detection time. To this end, we propose the Collision Seeking Detection (CSD) protocol, in which the server finds out a collision seed to make massive known tags hash collide in the last <inline formula> <tex math notation="LaTeX"$N$ /tex math>/inline formula> slots of a time frame with size <inline formula> <tex math notation="LaTeX"$f$ /tex math>/inline formula> Thus, all the leading <inline formula> <tex math notation="LaTeX"{f N} /tex math>/inline formula> pre empty slots become useful for detection of unknown tags. A challenging issue is that, computation cost for finding the collision seed is very huge. Hence, we propose a supplementary protocol called Balanced Group Partition (BGP) which divides tag population into <inline formula> <tex math notation="LaTeX"$n$ /tex math>/inline formula> small groups. The group number <inline formula> <tex math notation="LaTeX"$n$ /tex math>/inline formula> is able to trade off between communication cost and computation cost. We also give theoretical analysis to investigate the parameters to ensure the required detection accuracy. The major advantages of our CSD+BGP are two fold: (i) it only requires tags to perform lightweight operations, which are widely used in classical framed slotted Aloha algorithms. Thus, it is more suitable for low cost tags; (ii) it is more time efficient to detect the unknown tags. Simulation results reveal that CSD+BGP can ensure the required detection accuracy, meanwhile achieving <inline formula> <tex math notation="LaTeX"$1.7\times /tex math>/inline formula> speedup in the single reader scenarios and <inline formula> <tex math notation="LaTeX"$3.9\times /tex math>/inline formula> speedup in the multi reader scenarios than the state of the art detection protocol.
IEEE/ACM Transactions on Networking
Xiulong Liu Sheng Chen Jia Liu Wenyu Qu Fengjun Xiao Alex X Liu Jiannong Cao Jiangchuan Liu
220117072
SKINNY AEAD and SKINNY Hash
We present the family of authenticated encryption schemes SKINNY AEAD and the family of hashing schemes SKINNY Hash. All of the schemes employ a member of the SKINNY family of tweakable block ciphers, which was presented at CRYPTO 2016, as the underlying primitive. In particular, for authenticated encryption, we show how to instantiate members of SKINNY in the Deoxys I like ThCB3 framework to fulfill the submission requirements of the NIST lightweight cryptography standardization process. For hashing, we use SKINNY to build a function with larger internal state and employ it in a sponge construction. To highlight the extensive amount of third party analysis that SKINNY obtained since its publication, we briefly survey the existing cryptanalysis results for SKINNY 128 256 and SKINNY 128 384 as of February 2020. In the last part of the paper, we provide a variety of ASIC implementations of our schemes and propose new simple SKINNY AEAD and SKINNY Hash variants with a reduced number of rounds while maintaining a very comfortable security margin.
Christof Beierle Jeremy Jean Stefan Kolbl Gregor Leander Amir Moradi Thomas Peyrin Yu Sasaki Pascal Sasdrich Siang Meng Sim
67190216
Dynamic Outsourced Auditing Services for Cloud Storage Based on Batch Leaves Authenticated Merkle Hash Tree
Cloud computing encourages users to outsource their data to cloud storage. Data outsourcing means that users lose physical autonomy on their own data, which makes remote data integrity verification become a critical challenge for potential cloud users. To free user from the burden incurred by frequent integrity verifications, Third Party Auditor (TPA) is introduced to perform verifications on behalf of user for data integrity assurance. However, existing public auditing schemes rely on the assumption that TPA is trusted, thus these schemes cannot be directly extended to support the outsourced auditing model, where TPA might be dishonest and any two of the three involved entities (i.e. user, TPA, and cloud service provider) might be in collusion. In this paper, we propose a dynamic outsourced auditing scheme which cannot only protect against any dishonest entity and collision, but also support verifiable dynamic updates to outsourced data. We present a new approach, based on batch leaves authenticated Merkle Hash Tree (MHT) to batch verify multiple leaf nodes and their own indexes all together, which is more appropriate for the dynamic outsourced auditing system than traditional MHT based dynamism approaches that can only verify many leaf nodes one by one. Experimental results show that our solution minimizes the costs of initialization for both user and TPA (compared to existing static outsourced auditing scheme) and incurs a lower price of dynamism at user side.
IEEE Transactions on Services Computing
Lu Rao Hua Zhang Tengfei Tu
146804531
Secure Hash Algorithm 3(SHA 3) implementation on Xilinx FPGAs, Suitable for IoT Applications
Data integrity is a term used when referring to the accuracy and reliability of data. It ensures that data is not altered during operations, such as transfer, storage, or retrieval. Any changes to the data for example malicious intention, unpredicted hardware failure or human error would results in failure of data integrity. Cryptographic hash functions are generally used for the verification of data integrity. For many Internet of Things (IoT) applications, hardware implementations of cryptographic hash functions are needed to provide near real time data integrity checking. The IoT is a world where billions of objects can sense, share information and communicate over interconnected public or private Internet Protocol (IP) networks. This paper provides an implementation of a newly selected cryptographic hash algorithm called Secure Hash Algorithm 3 (SHA 3) on Xilinx FPGAs (Spartan, Virtex, Kintex and Artix) and also provides the power analysis of the implemented design. An FPGA is the best leading platform of the modern era in terms of flexibility, reliability and re configurability. In this implementation the core functionality of SHA 3 is implemented using LUT 6 primitives and then these primitives are instantiated for the complete implementation of SHA 3. The Xilinx Xpower tool is used for power analysis of the implemented design. This implementation can be used with IoT applications to provide near real time data
Muzaffar Rao Thomas Newe Ian Andrew Grout
211562103
NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations
We present new non interactive zero knowledge argument systems (NIZK) based on standard assumptions that were previously not known to imply it. In particular, we rely on the hardness of both the learning parity with noise (LPN) assumption, and the existence of trapdoor hash functions (TDH, defined by Dottling et al. Crypto 2019) Such TDH can be based on a number of standard assumptions, including DDH, QR, DCR, and LWE.
IACR Cryptol. ePrint Arch.
Zvika Brakerski Venkata Koppula Tamer Mour
214362534
Unkeyed hash function based on chaotic sponge construction and fixed point arithmetic
Chaotic maps have various properties that mirror the security requirements of cryptographic algorithms. As such, researchers have utilized them in the design of algorithms such as hash functions. Although there exist a wide range of chaos based hash functions in literature, most of them are designed in an ad hoc manner rather than relying on well established design paradigms. In addition, they are commonly implemented using floating point operations which are inefficient as compared to their bitwise counterparts. The combination of convoluted designs and floating point representation also leads to hash functions that are difficult to analyze; therefore, claims of security cannot be verified easily. These issues are some of the reasons why chaos based hash functions have not seen widespread use in practice. This paper proposes a new unkeyed hash function based on a chaotic sponge construction and fixed point arithmetic to overcome the aforementioned problems. The use of a sponge construction provides provable security justifications, whereas the use of fixed point arithmetic allows chaotic map operations to be implemented using bitwise operations. The combination of these design elements leads to a design that is both efficient and facilitates future cryptanalysis for security verification. Security and performance evaluations indicate that the proposed hash function has near ideal diffusion, confusion, collision resistance, and distribution properties in addition to a hashing speed that is at least on par with the current state of the art in chaos based hash functions.
Je Sen Teh Moatsum Alawida Jia Jie Ho
218489946
Tight Security Bounds for Double Block Hash then Sum MACs
In this work, we study the security of deterministic MAC constructions with a double block internal state, captured by the double block hash then sum \mathsf {DbHtS} paradigm. Most \mathsf {DbHtS} constructions, including \mathsf {PolyMAC} \mathsf {SUM\text }ECBC} \mathsf {PMAC\text }Plus} \mathsf {3kf9} and \mathsf {LightMAC\text }Plus} have been proved to be pseudorandom up to (2^\frac{2n}{3} queries when they are instantiated with an n bit block cipher, while the best known generic attacks require (2^\frac{3n}{4} queries.
EUROCRYPT
Seongkwan Kim ByeongHak Lee Jooyoung Lee