Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

25 relations
Average-case complexityBirthday attackBitwise operationComputational complexity theory
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Short Solutions to Nonlinear Systems of Equations
This paper presents a new hard problem for use in cryptography, called Short Solutions to Nonlinear Equations (SSNE). This… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
2013
2013
Provable Security of Cryptographic Hash Functions (Bewijsbare veiligheid van cryptografische hashfuncties) ; Provable Security of Cryptographic Hash Functions
 
2011
2011
Towards efficient lattice-based cryptography
One essential quest in cryptography is the search for hard instances of a given computational problem that is known to be hard in… Expand
  • figure 4.1
  • figure 4.2
  • figure 4.3
  • figure 5.1
  • figure 5.2
2010
2010
How to authenticate graphs without leaking
Secure data sharing in multi-party environments requires that both authenticity and confidentiality of the data be assured… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
2009
2009
Hardware Implementations of a Variant of the Zémor-Tillich Hash Function: Can a Provably Secure Hash Function be very efficient ?
Hash functions are widely used in Cryptography, and hardware implementations of hash functions are of interest in a variety of… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
2009
2009
Template Protection via Piecewise Hashing
When biometric recognition is used for identification or verification it is important to assure the privacy of the data subject… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Review
2009
Review
2009
Cryptographic hash functions based on ALife
There is a long history of cryptographic hash functions, i.e. functions mapping variable-length strings to fixed-length strings… Expand
  • figure 1
  • figure 2
2009
2009
A Note on the Security of Cryptographic Hash Functions
 
Highly Cited
2005
Highly Cited
2005
A scalable and provably secure hash-based RFID protocol
The biggest challenge for RFID technology is to provide benefits without threatening the privacy of consumers. Many solutions… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
Highly Cited
1996
Highly Cited
1996
Provably Secure Blind Signature Schemes
In this paper, we give a provably secure design for blind signatures, the most important ingredient for anonymity in off-line… Expand
  • figure 1
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