A characterization of chameleon hash functions and new, efficient designs
From MaRDI portal
Publication:484332
DOI10.1007/s00145-013-9155-8zbMath1301.94107OpenAlexW2078739299MaRDI QIDQ484332
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
identification schemeshash functionschameleon hash functionscollision-resistanceFiat-Shamir paradigmGQSchnorrsigma protocolsVSH
Related Items (4)
Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes ⋮ Efficient chameleon hash functions in the enhanced collision resistant model ⋮ On-line/off-line DCR-based homomorphic encryption and applications ⋮ Chameleon-Hashes with Ephemeral Trapdoors
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- Cryptographic hash functions from expander graphs
- Efficient signature generation by smart cards
- On-line/off-line digital signatures
- Designated Verifier Proofs and Their Applications
- Faster and Smoother – VSH Revisited
- Short and Stateless Signatures from the RSA Assumption
- SWIFFT: A Modest Proposal for FFT Hashing
- Full Cryptanalysis of LPS and Morgenstern Hash Functions
- Generalized Compact Knapsacks Are Collision Resistant
- VSH, an Efficient and Provable Collision-Resistant Hash Function
- Hash Functions from Sigma Protocols and Improvements to VSH
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Financial Cryptography
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- How to Break MD5 and Other Hash Functions
- How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
- Seven-Property-Preserving Iterated Hashing: ROX
- Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
- Finding Collisions in the Full SHA-1
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Collisions for the LPS Expander Graph Hash Function
- Multi-Property-Preserving Hash Domain Extension and the EMD Transform
- Security in Communication Networks
- Theory of Cryptography
- Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
- Public Key Cryptography - PKC 2006
- Public Key Cryptography – PKC 2004
This page was built for publication: A characterization of chameleon hash functions and new, efficient designs
