Revocable policy-based chameleon hash using lattices
From MaRDI portal
Publication:6657367
DOI10.1515/JMC-2023-0012MaRDI QIDQ6657367
Mohammed Anwarul Hasan, Jean Belo Klamti
Publication date: 6 January 2025
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating shorter bases for hard random lattices
- On-line/off-line digital signatures
- Bonsai trees, or how to delegate a lattice basis
- Fully collision-resistant chameleon-hashes from simpler and post-quantum assumptions
- Revocable policy-based chameleon hash
- Fully secure attribute-based encryption for \(t\)-CNF from LWE
- Large modulus ring-LWE \(\geq \) module-LWE
- Hardness of SIS and LWE with Small Parameters
- Constrained Pseudorandom Functions and Their Applications
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- Revocable Identity-Based Encryption from Lattices
- Comments and Improvements on Key-Exposure Free Chameleon Hashing Based on Factoring
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Efficient Generic On-Line/Off-Line Signatures Without Key Exposure
- Security of Sanitizable Signatures Revisited
- Financial Cryptography
- Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes
- Fuzzy Identity-Based Encryption
- Chameleon-Hashes with Ephemeral Trapdoors
- Sanitizable Signatures
- On lattices, learning with errors, random linear codes, and cryptography
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
This page was built for publication: Revocable policy-based chameleon hash using lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657367)
