\(\mathrm{mR}_{\mathrm{LWE}}\)-CP-ABE: a revocable CP-ABE for post-quantum cryptography
From MaRDI portal
Publication:6193390
DOI10.1515/jmc-2023-0026OpenAlexW4391827012MaRDI QIDQ6193390
Marco Pedicini, Elia Onofri, Marco Cianfriglia
Publication date: 16 March 2024
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2023-0026
lattice-based cryptographypost-quantum cryptographylearning with errorscloud cryptographymediated CP-ABE
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Time-based direct revocable ciphertext-policy attribute-based encryption with short revocation List
- Revocable attribute-based encryption with decryption key exposure resistance and ciphertext delegation
- Attribute based broadcast encryption with short ciphertext and decryption key
- A note on the concrete hardness of the shortest independent vector in lattices
- On the complexity of computing short linearly independent vectors and short bases in a lattice
- How to share a secret
- Trapdoors for hard lattices and new cryptographic constructions
- Some Recent Progress in Lattice-Based Cryptography
- A Ciphertext Policy Attribute-Based Encryption Scheme without Pairings
- Fuzzy Identity-Based Encryption
- Generating Shorter Bases for Hard Random Lattices
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- On the complexity of \(k\)-SAT
- A survey on functional encryption
- Post-quantum insecurity from LWE
This page was built for publication: \(\mathrm{mR}_{\mathrm{LWE}}\)-CP-ABE: a revocable CP-ABE for post-quantum cryptography
