One-Time Signatures and Chameleon Hash Functions

DOI10.1007/978-3-642-19574-7_21zbMath1293.94090OpenAlexW1524587198MaRDI QIDQ3084263

Payman Mohassel

Publication date: 15 March 2011

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19574-7_21

zbMATH Keywords

strong unforgeabilityone-time signatureidentification schemechameleon hash function

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items

Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes ⋮ Structure-preserving signatures and commitments to group elements ⋮ Attribute-based versions of Schnorr and ElGamal ⋮ Efficient chameleon hash functions in the enhanced collision resistant model ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Identity-based encryption in DDH hard groups ⋮ Signcryption schemes with threshold unsigncryption, and applications ⋮ New methods and abstractions for RSA-based forward secure signatures ⋮ Chameleon-Hashes with Ephemeral Trapdoors ⋮ Identity-based encryption with leakage-amplified chosen-ciphertext attacks security ⋮ An Efficient Post-Quantum One-Time Signature Scheme ⋮ A lattice-based fully dynamic group signature scheme without NIZK ⋮ General Construction of Chameleon All-But-One Trapdoor Functions ⋮ Efficient Threshold Encryption from Lossy Trapdoor Functions ⋮ Adaptive-ID secure hierarchical ID-based authenticated key exchange under standard assumptions without random oracles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum disclosure proofs of knowledge
• Efficient signature generation by smart cards
• On-line/off-line digital signatures
• Efficient hybrid encryption from ID-based encryption
• Short and Stateless Signatures from the RSA Assumption
• Trapdoors for hard lattices and new cryptographic constructions
• Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
• Bonsai Trees, or How to Delegate a Lattice Basis
• Hash Functions from Sigma Protocols and Improvements to VSH
• Generic Transformation to Strongly Unforgeable Signatures
• Short Hash-Based Signatures for Wireless Sensor Networks
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Fail-Stop Signatures
• Financial Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• Asymptotically Efficient Lattice-Based Digital Signatures
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Information and Communications Security
• Topics in Cryptology – CT-RSA 2005
• Theory of Cryptography
• Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
• Public Key Cryptography - PKC 2006