Fully collision-resistant chameleon-hashes from simpler and post-quantum assumptions

DOI10.1007/978-3-030-57990-6_21MaRDI QIDQ2106658zbMATH OpenOpenAlexFDO

Authors David Derler, Stephan Krenn, Kai Samelin, Daniel Slamanig

Publication date 16 December 2022

Full work available at URL https://doi.org/10.1007/978-3-030-57990-6_21

zbMATH Keywords

hash-functionsperfectly correct IND-CPA secure public-key encryption schemessimulation-sound extractable NIZKs

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• Efficient chameleon hash functions in the enhanced collision resistant model
• Tightly secure chameleon hash functions in the multi-user setting and their applications
• Chameleon-hashes with dual long-term trapdoors and their applications
• Chameleon-hashes with ephemeral trapdoors and applications to invisible sanitizable signatures
• Security in Communication Networks

Cited in

(8)

• Issuer-hiding attribute-based credentials
• Efficient chameleon hash functions in the enhanced collision resistant model
• Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes
• Collision resistance of the OAM-based quantum hashing
• Bringing order to chaos: the case of collision-resistant chameleon-hashes
• Tagged chameleon hash from lattices and application to redactable blockchain
• Revocable policy-based chameleon hash using lattices
• Practical generic construction of fully collision resistant chameleon hash and instantiations

This page was built for publication: Fully collision-resistant chameleon-hashes from simpler and post-quantum assumptions

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