Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 206,206,022 papers from all fields of science
Search
Sign In
Create Free Account
Security of cryptographic hash functions
Known as:
Provably secure cryptographic hash function
, Provably secure hash function
In cryptography, cryptographic hash functions can be divided into two main categories. In the first category are those functions whose designs are…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
25 relations
Average-case complexity
Birthday attack
Bitwise operation
Computational complexity theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2022
2022
A new design paradigm for provably secure keyless hash function with subsets and two variables polynomial function
P. Karthik
,
P. Shanthi Bala
J. King Saud Univ. Comput. Inf. Sci.
2022
Corpus ID: 208104129
2017
2017
Short Solutions to Nonlinear Systems of Equations
Alan Szepieniec
,
B. Preneel
NuTMiC
2017
Corpus ID: 3612788
This paper presents a new hard problem for use in cryptography, called Short Solutions to Nonlinear Equations (SSNE). This…
Expand
2013
2013
Provable Security of Cryptographic Hash Functions (Bewijsbare veiligheid van cryptografische hashfuncties) ; Provable Security of Cryptographic Hash Functions
Bart Mennink
2013
Corpus ID: 40637446
2011
2011
Towards efficient lattice-based cryptography
Richard Lindner
2011
Corpus ID: 17070916
One essential quest in cryptography is the search for hard instances of a given computational problem that is known to be hard in…
Expand
2010
2010
How to authenticate graphs without leaking
Ashish Kundu
,
E. Bertino
EDBT '10
2010
Corpus ID: 19008525
Secure data sharing in multi-party environments requires that both authenticity and confidentiality of the data be assured…
Expand
2009
2009
Template Protection via Piecewise Hashing
C. Nickel
,
C. Busch
,
Xuebing Zhou
Fifth International Conference on Intelligent…
2009
Corpus ID: 14972831
When biometric recognition is used for identification or verification it is important to assure the privacy of the data subject…
Expand
2009
2009
Hardware Implementations of a Variant of the Zémor-Tillich Hash Function: Can a Provably Secure Hash Function be very efficient ?
G. D. Meulenaer
,
C. Petit
,
J. Quisquater
IACR Cryptol. ePrint Arch.
2009
Corpus ID: 9541653
Hash functions are widely used in Cryptography, and hardware implementations of hash functions are of interest in a variety of…
Expand
Review
2009
Review
2009
Cryptographic hash functions based on ALife
M. Bedau
,
R. Crandall
,
M. Raven
2009
Corpus ID: 16426091
There is a long history of cryptographic hash functions, i.e. functions mapping variable-length strings to fixed-length strings…
Expand
Highly Cited
2005
Highly Cited
2005
A scalable and provably secure hash-based RFID protocol
Gildas Avoine
,
P. Oechslin
Third IEEE International Conference on Pervasive…
2005
Corpus ID: 1018326
The biggest challenge for RFID technology is to provide benefits without threatening the privacy of consumers. Many solutions…
Expand
Highly Cited
1996
Highly Cited
1996
Provably Secure Blind Signature Schemes
D. Pointcheval
,
J. Stern
ASIACRYPT
1996
Corpus ID: 11027697
In this paper, we give a provably secure design for blind signatures, the most important ingredient for anonymity in off-line…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE