Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,024,636 papers from all fields of science
Search
Sign In
Create Free Account
Collision resistance
Known as:
Collision resistant
, Collision-resistant
Collision resistance is a property of cryptographic hash functions: a hash function H is collision resistant if it is hard to find two inputs that…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
26 relations
Brute-force attack
Claw-free permutation
Collision attack
Cryptographic hash function
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Security of graph data: hashing schemes and definitions
M. Arshad
,
A. Kundu
,
E. Bertino
,
K. Madhavan
,
A. Ghafoor
Conference on Data and Application Security and…
2014
Corpus ID: 6417974
Use of graph-structured data models is on the rise - in graph databases, in representing biological and healthcare data as well…
Expand
2014
2014
Generalized Hash Functions based on Multivariate Ideal Lattices
Maria Francis
,
Ambedkar Dukkipati
arXiv.org
2014
Corpus ID: 16586561
Lyubashevsky & Micciancio (2006) built collision resistant hash functions based on ideal lattices (in the univariate case) that…
Expand
2014
2014
Forward-Secure Sequential Aggregate Message Authentication Revisited
Shoichi Hirose
,
H. Kuwakado
Provable Security
2014
Corpus ID: 32880640
The notion of forward-secure sequential aggregate message authentication was introduced by Ma and Tsudik in 2007. It is suitable…
Expand
2012
2012
Conceptual authentication speech hashing base upon hypotrochoid graph
M. Nouri
,
N. Farhangian
,
Z. Zeinolabedini
,
Mahyar Safarinia
International Symposium on Telecommunications
2012
Corpus ID: 43234241
The speech hash function which maps speech to a short binary string based on the speech's perceptual properties, is proposed as a…
Expand
2011
2011
CRMA: collision-resistant multiple access
Tianji Li
,
M. Han
,
+4 authors
B. Zarikoff
ACM/IEEE International Conference on Mobile…
2011
Corpus ID: 1464966
Efficiently sharing spectrum among multiple users is critical to wireless network performance. In this paper, we propose a novel…
Expand
2011
2011
Exposing iClass Key Diversification
Flavio D. Garcia
,
Gerhard de Koning Gans
,
Roel Verdult
Workshop on Offensive Technologies
2011
Corpus ID: 218626506
iClass is one of the most widely used contactless smartcards on the market. It is used extensively in access control and payment…
Expand
2008
2008
How to Fill Up Merkle-Damgård Hash Functions
K. Yasuda
International Conference on the Theory and…
2008
Corpus ID: 383377
Many of the popular Merkle-Damgard hash functions have turned out to be not collision-resistant (CR). The problem is that we no…
Expand
2008
2008
Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption
Alon Rosen
,
Gil Segev
IACR Cryptology ePrint Archive
2008
Corpus ID: 6780286
Lossy trapdoor functions (Peikert and Waters, STOC ’08) are an intriguing and powerful cryptographic primitive. Their main…
Expand
2008
2008
Securing group key exchange against strong corruptions and key registration attacks
E. Bresson
,
M. Manulis
International Journal of Applied Cryptography
2008
Corpus ID: 15441058
In Group Key Exchange (GKE) protocols, users usually extract the group key using some auxiliary (ephemeral) secret information…
Expand
2006
2006
A Practical Limit of Security Proof in the Ideal Cipher Model : Possibility of Using the Constant As a Trapdoor In Several Double Block Length Hash Functions
D. Chang
IACR Cryptology ePrint Archive
2006
Corpus ID: 46625359
Recently, Shoichi Hirose [2] proposed several double block length (DBL) hash functions. Each DBL hash function uses a constant…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE