A characterization of chameleon hash functions and new, efficient designs
From MaRDI portal
Publication:484332
DOI10.1007/S00145-013-9155-8zbMATH Open1301.94107OpenAlexW2078739299MaRDI QIDQ484332FDOQ484332
Authors: M. Bellare, Todor Ristov
Publication date: 7 January 2015
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-013-9155-8
Recommendations
hash functionschameleon hash functionscollision-resistanceFiat-Shamir paradigmGQidentification schemesSchnorrsigma protocolsVSH
Cites Work
- SWIFFT: A Modest Proposal for FFT Hashing
- Advances in Cryptology - EUROCRYPT 2004
- Bit commitment using pseudorandomness
- Efficient signature generation by smart cards
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Multi-Property-Preserving Hash Domain Extension and the EMD Transform
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- On-line/off-line digital signatures
- Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
- Cryptographic hash functions from expander graphs
- Finding Collisions in the Full SHA-1
- Short and Stateless Signatures from the RSA Assumption
- Generalized Compact Knapsacks Are Collision Resistant
- Title not available (Why is that?)
- Public Key Cryptography – PKC 2004
- Full Cryptanalysis of LPS and Morgenstern Hash Functions
- How to Break MD5 and Other Hash Functions
- Seven-Property-Preserving Iterated Hashing: ROX
- VSH, an Efficient and Provable Collision-Resistant Hash Function
- Title not available (Why is that?)
- Title not available (Why is that?)
- Security in Communication Networks
- Designated verifier proofs and their applications
- Title not available (Why is that?)
- Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
- Faster and smoother -- VSH revisited
- Hash Functions from Sigma Protocols and Improvements to VSH
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- Title not available (Why is that?)
- Financial Cryptography
- How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
- Collisions for the LPS Expander Graph Hash Function
- Theory of Cryptography
- Public Key Cryptography - PKC 2006
Cited In (12)
- Chameleon-hashes with ephemeral trapdoors and applications to invisible sanitizable signatures
- A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
- Financial Cryptography
- On-line/off-line DCR-based homomorphic encryption and applications
- Bringing order to chaos: the case of collision-resistant chameleon-hashes
- Hash Functions from Sigma Protocols and Improvements to VSH
- Tightly secure chameleon hash functions in the multi-user setting and their applications
- Efficient chameleon hash functions in the enhanced collision resistant model
- One-time signatures and chameleon hash functions
- Redactable Transactions in Consortium Blockchain: Controlled by Multi-authority CP-ABE
- Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes
- Chameleon hash functions and one-time signature schemes from inner automorphism groups
Uses Software
This page was built for publication: A characterization of chameleon hash functions and new, efficient designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q484332)