Tightly-Secure Signatures from Chameleon Hash Functions
From MaRDI portal
Recommendations
- Tightly secure chameleon hash functions in the multi-user setting and their applications
- Chameleon-hashes with ephemeral trapdoors and applications to invisible sanitizable signatures
- Discrete logarithm based chameleon hashing and signatures without key exposure
- Identity-based chameleon hashing and signatures without key exposure
- One-time signatures and chameleon hash functions
- Secure Hash-and-Sign Signatures Without the Random Oracle
- Tightly secure signatures and public-key encryption
- Tightly Secure Signatures and Public-Key Encryption
- A Practical and Tightly Secure Signature Scheme Without Hash Function
- Improved (almost) tightly-secure structure-preserving signatures
Cited in
(35)- Tightly-secure signatures from five-move identification protocols
- Tightly secure chameleon hash functions in the multi-user setting and their applications
- Verifiable random functions with optimal tightness
- Short identity-based signatures with tight security from lattices
- Skipping the \(q\) in group signatures
- Optimal tightness for chain-based unique signatures
- Tight security for the generic construction of identity-based signature (in the multi-instance setting)
- 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
- Tightly-secure signatures from the decisional composite residuosity assumption
- A generic construction of tightly secure signatures in the multi-user setting
- Efficient chameleon hash functions in the enhanced collision resistant model
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography
- Strong security from probabilistic signature schemes
- Towards tightly secure lattice short signature and id-based encryption
- Iterated random oracle: a universal approach for finding loss in security reduction
- One-time signatures and chameleon hash functions
- Tighter security proofs for post-quantum key encapsulation mechanism in the multi-challenge setting
- How to prove security of a signature with a tighter security reduction
- scientific article; zbMATH DE number 2079916 (Why is no real title available?)
- Financial Cryptography
- A characterization of chameleon hash functions and new, efficient designs
- Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes
- Chameleon-hashes with ephemeral trapdoors and applications to invisible sanitizable signatures
- Equivalences and black-box separations of matrix Diffie-Hellman problems
- Chameleon hash functions and one-time signature schemes from inner automorphism groups
- Fine-grained verifier NIZK and its applications
- Identity-based encryption in DDH hard groups
- Lattice-based signatures with tight adaptive corruptions and more
- Tightly secure lattice identity-based signature in the quantum random oracle model
- Bringing order to chaos: the case of collision-resistant chameleon-hashes
- Toothpicks: more efficient fork-free two-round multi-signatures
- From one-time to two-round reusable multi-signatures without nested forking
- Short signatures from DDH without pairings or random oracles
- Generic construction for tightly-secure signatures from discrete log
This page was built for publication: Tightly-Secure Signatures from Chameleon Hash Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941195)
