One-time signatures and chameleon hash functions
From MaRDI portal
Publication:3084263
Recommendations
- A characterization of chameleon hash functions and new, efficient designs
- Chameleon hash functions and one-time signature schemes from inner automorphism groups
- Off-Line/On-Line Signatures: Theoretical Aspects and Experimental Results
- Tightly-Secure Signatures from Chameleon Hash Functions
- scientific article; zbMATH DE number 1759322
Cites work
- scientific article; zbMATH DE number 4035726 (Why is no real title available?)
- scientific article; zbMATH DE number 177054 (Why is no real title available?)
- scientific article; zbMATH DE number 503351 (Why is no real title available?)
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- scientific article; zbMATH DE number 1088254 (Why is no real title available?)
- scientific article; zbMATH DE number 1950604 (Why is no real title available?)
- scientific article; zbMATH DE number 2080186 (Why is no real title available?)
- scientific article; zbMATH DE number 1759322 (Why is no real title available?)
- scientific article; zbMATH DE number 1842501 (Why is no real title available?)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Advances in Cryptology - EUROCRYPT 2004
- Asymptotically Efficient Lattice-Based Digital Signatures
- Bonsai trees, or how to delegate a lattice basis
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Efficient hybrid encryption from ID-based encryption
- Efficient signature generation by smart cards
- Fail-Stop Signatures
- Financial Cryptography
- Generic Transformation to Strongly Unforgeable Signatures
- Hash Functions from Sigma Protocols and Improvements to VSH
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
- Information and Communications Security
- Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
- Minimum disclosure proofs of knowledge
- On-line/off-line digital signatures
- Public Key Cryptography - PKC 2006
- Short Hash-Based Signatures for Wireless Sensor Networks
- Short and Stateless Signatures from the RSA Assumption
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2005
- Trapdoors for hard lattices and new cryptographic constructions
- Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
Cited in
(23)- Signcryption schemes with threshold unsigncryption, and applications
- Chameleon hash functions and one-time signature schemes from inner automorphism groups
- Efficient threshold encryption from lossy trapdoor functions
- Chameleon-hashes with ephemeral trapdoors and applications to invisible sanitizable signatures
- Identity-based encryption in DDH hard groups
- A lattice-based fully dynamic group signature scheme without NIZK
- General construction of chameleon all-but-one trapdoor functions
- Tightly secure chameleon hash functions in the multi-user setting and their applications
- New methods and abstractions for RSA-based forward secure signatures
- scientific article; zbMATH DE number 7141562 (Why is no real title available?)
- Identity-based encryption with leakage-amplified chosen-ciphertext attacks security
- Efficient chameleon hash functions in the enhanced collision resistant model
- Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes
- Tightly-Secure Signatures from Chameleon Hash Functions
- scientific article; zbMATH DE number 1759322 (Why is no real title available?)
- Attribute-based versions of Schnorr and ElGamal
- Bringing order to chaos: the case of collision-resistant chameleon-hashes
- Off-Line/On-Line Signatures: Theoretical Aspects and Experimental Results
- A characterization of chameleon hash functions and new, efficient designs
- Adaptive-ID secure hierarchical ID-based authenticated key exchange under standard assumptions without random oracles
- Structure-preserving signatures and commitments to group elements
- An efficient post-quantum one-time signature scheme
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
This page was built for publication: One-time signatures and chameleon hash functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084263)
