Efficient chameleon hash functions in the enhanced collision resistant model

DOI10.1016/J.INS.2019.09.001zbMATH Open1456.94092OpenAlexW2971979484WikidataQ127321632 ScholiaQ127321632MaRDI QIDQ2658065FDOQ2658065

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

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

zbMATH Keywords

standard modelGroth-Sahai proofschameleon hash functionsSNARKsenhanced collision resistant model

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

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

Cited In (8)

• Fully collision-resistant chameleon-hashes from simpler and post-quantum assumptions
• Chameleon-hashes with ephemeral trapdoors and applications to invisible sanitizable signatures
• Bringing order to chaos: the case of collision-resistant chameleon-hashes
• Tightly secure chameleon hash functions in the multi-user setting and their applications
• Chameleon-hashes with dual long-term trapdoors and their applications
• Tagged chameleon hash from lattices and application to redactable blockchain
• Title not available (Why is that?)
• Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes

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)