A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Multi-Collision Resistant Hash Functions and Their Applications
[chapter]
2018
Lecture Notes in Computer Science
Preserved Fulltext
In this work we study multi-collision resistant hash functions (MCRH) a natural relaxation of collision resistant hash functions in which it is difficult to find a t-way collision (i.e., t strings that ...
Collision resistant hash functions are functions that shrink their input, but for which it is computationally infeasible to find a collision, namely two strings that hash to the same value (although collisions ...
We also thank Nir Bitansky, Yael Kalai, Ilan Komargodski, Moni Naor, Omer Paneth and Eylon Yogev for helping us provide a good example of a t-way collision. . ...
doi:10.1007/978-3-319-78375-8_5
fatcat:lphuryempnh2zjfdqkgqwqmtbq
Enhanced Message Digest Version 5 Architecture for Secure Hashing
2014
IOSR Journal of Computer Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
It has been used in a variety of security applications and is also commonly used to check data integrity. However MD5 has been found not to be collision resistant. ...
The new password hashing mechanism find applications in areas such as digital signatures and digital certificates. ...
These attacks clearly show that these iterated hash functions do not properly preserve the collision resistance property of their respective compression functions with the fixed IV. ...
doi:10.9790/0661-1657125129
fatcat:hyazildlo5hsnemvphwmgr5bnq
Multi-collision resistance: a paradigm for keyless hash functions
2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
An appealing feature of such hash functions is that unlike their collision-resistant counterparts, they do not necessarily require a key. ...
We show how to replace collision resistance with multi-collision resistance in several foundational applications. ...
Acknowledgements We thank Zvika Brakerski, Ran Raz, and Vinod Vaikuntanathan for their collaboration in the early stage of this project. ...
doi:10.1145/3188745.3188870
dblp:conf/stoc/BitanskyKP18
fatcat:wkozeczwgvhz7cmwj6ev4nmuki
Merkle-Damgård Construction Method and Alternatives
2017
Journal of Information and Organizational Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper provides a review of cryptographic hash function, its security requirements and different design methods of compression function. ...
Cryptographic community had been looking for replacements for these weak hash functions and they have proposed new hash functions based on different variants of Merkle-Damgård construction. ...
Unkeyed hash function is further classified into oneway hash function (OWHF) and collision resistant hash function (CRHF). ...
doi:10.31341/jios.41.2.9
fatcat:cfps47y2pfbmncprc7ejtevule
Merkle-Damgård Construction Method and Alternatives: A Review
2017
Journal of Information and Organizational Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper provides a review of cryptographic hash function, its security requirements and different design methods of compression function. ...
Cryptographic community had been looking for replacements for these weak hash functions and they have proposed new hash functions based on different variants of Merkle-Damgård construction. ...
Unkeyed hash function is further classified into oneway hash function (OWHF) and collision resistant hash function (CRHF). ...
doaj:d297099bed4449efaf9859d6b8ef172d
fatcat:uwue3iswfvhcjbrgk4w6rj3y7i
New concept for cryptographic construction design based on noniterative behavior
2020
IAES International Journal of Artificial Intelligence (IJ-AI)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
<span>Nowadays, cryptography especially hash functions require to move from classical paradigms to an original concept able to handle security issues and new hardware architecture challenges as in distributed ...
Thus, the solution begins with a deep analysis of divers attack strategies; this way can lead to finding a new approach that enables new innovative and reliable candidates as alternative hash functions ...
As a consequence, an iterated construction with an internal collision resistant compression function can be extended to a collision resistant hash function [14] . ...
doi:10.11591/ijai.v9.i2.pp229-235
fatcat:fadnwvdbxbaxpjxlepjoswqhcy
Adaptive Restart and CEGAR-based Solver for Inverting Cryptographic Hash Functions
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
SAT solvers are increasingly being used for cryptanalysis of hash functions and symmetric encryption schemes. ...
The CEGAR technique abstracts away certain steps of the input hash function, replacing them with the identity function, and verifies whether the solution constructed by MapleCrypt indeed hashes to the ...
They applied their tool CryptLogVer on some hash functions like SHA-1 and Keccak to analyze their preimage resistance. ...
arXiv:1608.04720v1
fatcat:nl4rextsdzelpagut2lsaabbwy
Compression Functions Suitable for the Multi-Property-Preserving Transform
2008
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
That is, in the ideal cipher model, the Davies-Meyer compression function is collision resistant, but it is not indifferentiable from a random oracle. ...
Since Bellare and Ristenpart showed a multi-property preserving domain extension transform, the problem of the construction for multi-property hash functions has been reduced to that of the construction ...
These applications require that hash functions satisfy the following properties: preimage resistance, second-preimage resistance, and collision resistance. ...
doi:10.1093/ietfec/e91-a.10.2851
fatcat:2rwl4w6b7bg4degw7nemrvhxai
An efficient multi-use multi-secret sharing scheme based on hash function
2010
Applied Mathematics Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this paper, a renewable, multi-use, multi-secret sharing scheme for general access structure based on one-way collision resistant hash function is presented in which each participant has to carry only ...
By applying collision-resistant one-way hash function, the proposed scheme is secure against conspiracy attacks even if the pseudo-secret shares are compromised. ...
Conclusion In this work, we have presented a multi-secret sharing scheme with general access structures based on a one-way collision resistant hash function. ...
doi:10.1016/j.aml.2010.04.024
fatcat:agyjgf47yrgmnc2ncrvqzuykni
Cryptographic Hash Functions: Theory and Practice
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Cryptographic hash functions are an essential building block for security applications. Until 2005, the amount of theoretical research and cryptanalysis invested in this topic was rather limited. ...
In response to this hash function crisis, a large number of papers has been published with theoretical results and novel designs. ...
The first theoretical result is the construction of a collision-resistance hash function based on a collision-resistant compression function, proven independently by Damgård [3] and Merkle [10] in ...
doi:10.1007/978-3-642-17650-0_1
fatcat:uruaxnklojdenokfs6muvhkhca
Cryptographic Hash Functions: Theory and Practice
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Cryptographic hash functions are an essential building block for security applications. Until 2005, the amount of theoretical research and cryptanalysis invested in this topic was rather limited. ...
In response to this hash function crisis, a large number of papers has been published with theoretical results and novel designs. ...
The first theoretical result is the construction of a collision-resistance hash function based on a collision-resistant compression function, proven independently by Damgård [3] and Merkle [10] in ...
doi:10.1007/978-3-642-17401-8_9
fatcat:yapapyz77rfmbbupaixei5ldoy
The NIST SHA-3 Competition: A Perspective on the Final Year
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
They are expected to satisfy several security properties that include preimage resistance, second preimage resistance, and collision resistance. ...
The free availability of efficient software-oriented hash functions such as MD4, MD5 and SHA-1 has resulted in a very broad deployment of hash functions, way beyond their initial design purposes. ...
The first theoretical result was the construction of a collision-resistance hash function based on a collision-resistant compression function, proposed independently by Damgård [7] and Merkle [15] ...
doi:10.1007/978-3-642-21969-6_26
fatcat:iyifk42qmrfbvgpbgxz4zzw35e
MGR Hash Functions
2019
Cryptologia
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We will also analyze the MGR hash function with respect to its security and efficiency. ...
GOST-R is a Russian Standard Cryptographic Hash function which was first introduced in 1994 by Russian Federal for information processing, information security and digital signature. ...
So MGR is partial collision resistant hash function. ...
doi:10.1080/01611194.2019.1596995
fatcat:4hbsrzfdlral7pctpzytaf6dva
A MATHEMATICAL MODEL OF INTEGRATED CHAOTIC BASED HASH FUNCTION TO IMPROVE RANDOMIZATION AND BIT VARIATION PROPERTIES OF CHAOTIC MAPS
2018
JOURNAL OF MECHANICS OF CONTINUA AND MATHEMATICAL SCIENCES
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The experimental outcomes shows that the proposed model satisfies all cryptographic properties of secure hash functions such as resistant to collisions, high level of sensitivity to initial conditions, ...
In the present internet world, Security is a prime vital concern and the secure hash function is one of the ideal alternative means to guarantee security. ...
Moreover, these hash functions are not keyed, multi-threaded and
collision resistant. ...
doi:10.26782/jmcms.2018.12.00018
fatcat:kvicbqtrlbcftmq6wd2wxo4vi4
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions
[chapter]
2018
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Collision resistant hash functions are one of the more useful cryptographic primitives both in theory and in practice and two prominent applications are in signature schemes and succinct zero-knowledge ...
A collision resistant hash (CRH) function is one that compresses its input, yet it is hard to find a collision, i.e. a x 1 = x 2 s.t. h(x 1 ) = h(x 2 ). ...
We greatly acknowledge Gilad Asharov and Gil Segev for educating us about black-box separations. We thank Iftach Haitner and Eran Omri for answering questions related to [HIOS15] . ...
doi:10.1007/978-3-319-78375-8_6
fatcat:ikqwey5xpff55nysmvvu7nmvd4
« Previous
Showing results 1 — 15 out of 4,743 results