Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Cryptography: Theory and Practice,Second Edition
Cryptography: Theory and Practice,Second Edition
Handbook of Applied Cryptography
Handbook of Applied Cryptography
A Design Principle for Hash Functions
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Generic Groups, Collision Resistance, and ECDSA
Designs, Codes and Cryptography
Note: Construction of universal one-way hash functions: Tree hashing revisited
Discrete Applied Mathematics
Cryptanalysis of the GOST Hash Function
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
How to Fill Up Merkle-Damgård Hash Functions
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
Discrete Applied Mathematics
Digital signature and hash function irregularity
TELE-INFO'09 Proceedings of the 8th Wseas international conference on Telecommunications and informatics
Non-interactive manual channel message authentication based on eTCR hash functions
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
WSEAS Transactions on Information Science and Applications
A multi purpose web-based contractual management system
WSEAS Transactions on Information Science and Applications
A Simple and Generic Construction of Authenticated Encryption with Associated Data
ACM Transactions on Information and System Security (TISSEC)
Second-preimage analysis of reduced SHA-1
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
An improved discrete logarithm-based multisignature scheme
Security and Communication Networks
KALwEN: a new practical and interoperable key management scheme for body sensor networks
Security and Communication Networks
On capabilities of hash domain extenders to preserve enhanced security properties
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Finding collisions for round-reduced SM3
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
| Hi-index | 0.00 |
In this paper, we study issues related to the notion of "secure" hash functions. Several necessary conditions are considered, as well as a popular sufficient condition (the so-called random oracle model). We study the security of various problems that are motivated by the notion of a secure hash function. These problems are analyzed in the random oracle model, and we prove that the obvious trivial algorithms are optimal. As well, we look closely at reductions between various problems. In particular, we consider the important question "does collision resistance imply preimage resistance?". We provide partial answers to this question --- both positive and negative! --- based on uniformity properties of the hash function under consideration.