Efficient chameleon hash functions in the enhanced collision resistant model

DOI10.1016/J.INS.2019.09.001MaRDI QIDQ2658065zbMATH OpenOpenAlexWikidataFDO

Authors Mojtaba Khalili, Mohammad Dakhilalian, Willy Susilo

Publication date 18 March 2021

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2019.09.001

zbMATH Keywords

chameleon hash functionsenhanced collision resistant modelGroth-Sahai proofsSNARKsstandard model

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Chameleon-hashes with ephemeral trapdoors and applications to invisible sanitizable signatures
• Fully collision-resistant chameleon-hashes from simpler and post-quantum assumptions
• Tightly secure chameleon hash functions in the multi-user setting and their applications
• A characterization of chameleon hash functions and new, efficient designs
• Chameleon-hashes with dual long-term trapdoors and their applications

Cites work

• A characterization of chameleon hash functions and new, efficient designs
• All-but-many lossy trapdoor functions
• An algebraic framework for Diffie-Hellman assumptions
• Applied Cryptography and Network Security
• Chameleon-hashes with dual long-term trapdoors and their applications
• Chameleon-hashes with ephemeral trapdoors and applications to invisible sanitizable signatures
• Comments and improvements on key-exposure free chameleon hashing based on factoring
• Discrete logarithm based chameleon hashing and signatures without key exposure
• Efficient Generic On-Line/Off-Line Signatures Without Key Exposure
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Financial Cryptography
• Fully-Secure and Practical Sanitizable Signatures
• scientific article; zbMATH DE number 1302835 (Why is no real title available?)
• scientific article; zbMATH DE number 1842501 (Why is no real title available?)
• Identity-based chameleon hashing and signatures without key exposure
• Information Security
• Minimum disclosure proofs of knowledge
• One-time signatures and chameleon hash functions
• Public Key Cryptography – PKC 2004
• Quadratic span programs and succinct NIZKs without PCPs
• Sanitizable signatures
• Security in Communication Networks
• Short and Stateless Signatures from the RSA Assumption
• Short pairing-based non-interactive zero-knowledge arguments
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• Structure-preserving signatures and commitments to group elements
• Tightly-Secure Signatures from Chameleon Hash Functions
• Tweaking TBE/IBE to PKE Transforms with Chameleon Hash Functions

Cited in

(9)

• Chameleon-hashes with dual long-term trapdoors and their applications
• Tightly secure chameleon hash functions in the multi-user setting and their applications
• Fully collision-resistant chameleon-hashes from simpler and post-quantum assumptions
• scientific article; zbMATH DE number 1857513 (Why is no real title available?)
• Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes
• Chameleon-hashes with ephemeral trapdoors and applications to invisible sanitizable signatures
• Bringing order to chaos: the case of collision-resistant chameleon-hashes
• Tagged chameleon hash from lattices and application to redactable blockchain
• Practical generic construction of fully collision resistant chameleon hash and instantiations

This page was built for publication: Efficient chameleon hash functions in the enhanced collision resistant model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2658065)