A characterization of chameleon hash functions and new, efficient designs
type: Item
instance of: scholarly article
title: A characterization of chameleon hash functions and new, efficient designs
zbMATH Open document ID: 1301.94107
author: M. Bellare
author: Todor Ristov
published in: Journal of Cryptology
publication date: 2015-01-07T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 6383989
zbMATH Keywords: hash functions
zbMATH Keywords: collision-resistance
zbMATH Keywords: chameleon hash functions
zbMATH Keywords: Fiat-Shamir paradigm
zbMATH Keywords: sigma protocols
zbMATH Keywords: identification schemes
zbMATH Keywords: VSH
zbMATH Keywords: GQ
zbMATH Keywords: Schnorr
describes a project that uses: gmp
describes a project that uses: SWIFFT
MaRDI profile type: Publication
full work available at URL: s00145-013-9155-8
OpenAlex ID: W2078739299
cites work: Seven-Property-Preserving Iterated Hashing: ROX
cites work: Financial Cryptography
cites work: Security in Communication Networks
cites work: Multi-Property-Preserving Hash Domain Extension and the EMD Transform
cites work: Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
cites work: Hash Functions from Sigma Protocols and Improvements to VSH
cites work: Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Cryptographic hash functions from expander graphs
cites work: Q4035740
cites work: VSH, an Efficient and Provable Collision-Resistant Hash Function
cites work: Merkle-Damgård Revisited: How to Construct a Hash Function
cites work: Q4950056
cites work: On-line/off-line digital signatures
cites work: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
cites work: Q4434887
cites work: Realizing Hash-and-Sign Signatures under Standard Assumptions
cites work: Short and Stateless Signatures from the RSA Assumption
cites work: Theory of Cryptography
cites work: Designated Verifier Proofs and Their Applications
cites work: Public Key Cryptography - PKC 2006
cites work: Generalized Compact Knapsacks Are Collision Resistant
cites work: SWIFFT: A Modest Proposal for FFT Hashing
cites work: Bit commitment using pseudorandomness
cites work: Q4036898
cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
cites work: Full Cryptanalysis of LPS and Morgenstern Hash Functions
cites work: Faster and Smoother – VSH Revisited
cites work: Efficient signature generation by smart cards
cites work: Q4783735
cites work: Q4249649
cites work: Public Key Cryptography – PKC 2004
cites work: How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
cites work: Collisions for the LPS Expander Graph Hash Function
cites work: Finding Collisions in the Full SHA-1
cites work: How to Break MD5 and Other Hash Functions
DOI: 10.1007/S00145-013-9155-8
description: scientific article; zbMATH DE number 6383989