This website does readability filtering of other pages. All styles, scripts, forms and ads are stripped. If you want your website excluded or have other feedback, use this form.

Google Scholar

Loading... The system can't perform the operation now. Try again later.

Cite

Advanced search

ArticlesCase lawProfiles My profileMy libraryAlertsMetrics Settings Sign in Sign in ArticlesScholar 1 result (0.03 sec) My profileMy library
[PDF] springer.com

On the length of cryptographic hash-values used in identification schemes

M Girault, J Stern - Annual International Cryptology Conference, 1994 - Springer Many interactive identification schemes based on the zero-knowledge concept use
cryptographic hash-values, either in their basic design or in specific variants. In this paper,
we first show that 64-bit hash-values, a length often suggested, definitely decrease the level
of the security of all these schemes.(Of course, this does not compromise the security of the
schemes by themselves). Then we prove that collision-resistance is a sufficient condition to
achieve the claimed level of security. Finally, by using a weaker notion of collision … Cited by 72 Related articles All 7 versions HelpPrivacyTerms