Collision-resistant hashing: Towards making UOWHFs practical
From MaRDI portal
Recommendations
Cited in
(37)- Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
- How to sign digital streams
- Security analysis of randomize-hash-then-sign digital signatures
- Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation
- Efficient hybrid encryption from ID-based encryption
- Hash function based on quantum walks
- Construction of universal one-way hash functions: tree hashing revisited
- Locally computable UOWHF with linear shrinkage
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Higher order eTCR hash functions
- Concealment and its applications to authenticated encryption
- One-time signatures and chameleon hash functions
- XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
- New second-preimage attacks on hash functions
- A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function
- Digital Signatures Out of Second-Preimage Resistant Hash Functions
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- How to Fill Up Merkle-Damgård Hash Functions
- An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations
- On Randomizing Hash Functions to Strengthen the Security of Digital Signatures
- Analysis of Property-Preservation Capabilities of the ROX and ESh Hash Domain Extenders
- Characterizing Padding Rules of MD Hash Functions Preserving Collision Security
- A Three-Property-Secure Hash Function
- scientific article; zbMATH DE number 177052 (Why is no real title available?)
- Low-complexity cryptographic hash functions
- Collapseability of tree hashes
- Multi-block Collisions in Hash Functions Based on 3C and 3C+ Enhancements of the Merkle-Damgård Construction
- Boosting Merkle-Damgård Hashing for Message Authentication
- An Equivalence Between Zero Knowledge and Commitments
- How to Construct Universal One-Way Hash Functions of Order r
- Higher Order Universal One-Way Hash Functions
- Public Key Cryptography - PKC 2006
- Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication
- Constant-round arguments from one-way functions
- Memory checking requires logarithmic overhead
- Open problems in hash function security
This page was built for publication: Collision-resistant hashing: Towards making UOWHFs practical
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4364571)
