Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance
- 1 January 2004
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- Vol. 2004, 371-388
- https://doi.org/10.1007/978-3-540-25937-4_24
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Handbook of Applied CryptographyPublished by Taylor & Francis Ltd ,2018
- Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGVLecture Notes in Computer Science, 2002
- A Design Principle for Hash FunctionsPublished by Springer Science and Business Media LLC ,2001
- Hash Functions: From Merkle-Damgård to ShoupLecture Notes in Computer Science, 2001
- Formal Security Proofs for a Signature Scheme with Partial Message RecoveryLecture Notes in Computer Science, 2001
- Collision Free Hash Functions and Public Key Signature SchemesLecture Notes in Computer Science, 2000
- Collision-Resistant hashing: Towards making UOWHFs practicalLecture Notes in Computer Science, 1997
- One Way Hash Functions and DESPublished by Springer Science and Business Media LLC ,1990
- Universal one-way hash functions and their cryptographic applicationsPublished by Association for Computing Machinery (ACM) ,1989
- Probabilistic encryptionJournal of Computer and System Sciences, 1984