A systems theoretic approach to the design of scalable cryptographic hash functions
Abstract
References
Recommendations
Universal one-way hash functions and their cryptographic applications
STOC '89: Proceedings of the twenty-first annual ACM symposium on Theory of computingWe define a Universal One-Way Hash Function family, a new primitive which enables the compression of elements in the function domain. The main property of this primitive is that given an element x. We prove constructively that universal one-way hash ...
On the design of provably-secure cryptographic hash functions
EUROCRYPT '90: Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptologyRecently, formal complexity-theoretic treatment of cryptographic hash functions was suggested. Two primitives of Collision-free hash functions and Universal one-way hash function families have been defined. The primitives have numerous applications in ...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 1Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in