Tightly-Secure Signatures from Chameleon Hash Functions

DOI10.1007/978-3-662-46447-2_12zbMath1345.94043OpenAlexW2107912502WikidataQ59163666 ScholiaQ59163666MaRDI QIDQ2941195

Olivier Blazy, Jia-xin Pan, Saqib A. Kakvi, Eike Kiltz

Publication date: 27 August 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46447-2_12

zbMATH Keywords

signaturestandard modeltight reductionchameleon hash

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (19)

Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes ⋮ Skipping the \(q\) in group signatures ⋮ Efficient chameleon hash functions in the enhanced collision resistant model ⋮ Optimal tightness for chain-based unique signatures ⋮ A generic construction of tightly secure signatures in the multi-user setting ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction ⋮ Fine-grained verifier NIZK and its applications ⋮ Identity-based encryption in DDH hard groups ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ Tight security for the generic construction of identity-based signature (in the multi-instance setting) ⋮ Tighter Security Proofs for Post-quantum Key Encapsulation Mechanism in the Multi-challenge Setting ⋮ Chameleon-Hashes with Ephemeral Trapdoors ⋮ Equivalences and Black-Box Separations of Matrix Diffie-Hellman Problems ⋮ Verifiable random functions with optimal tightness ⋮ Short tightly secure signatures for signing a vector of group elements: a new approach ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions ⋮ Short identity-based signatures with tight security from lattices

This page was built for publication: Tightly-Secure Signatures from Chameleon Hash Functions