Puncturable identity-based and attribute-based encryption from lattices
From MaRDI portal
Publication:2166727
DOI10.1016/J.TCS.2022.06.028OpenAlexW4283078801WikidataQ114848017 ScholiaQ114848017MaRDI QIDQ2166727
Dung Hoang Duong, Priyanka Dutta, Willy Susilo, Partha Sarathi Roy
Publication date: 25 August 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.06.028
Related Items (1)
Cites Work
- Unnamed Item
- Revisiting proxy re-encryption: forward secrecy, improved security, and applications
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Public-Key Puncturable Encryption: Modular and Compact Constructions
- Public-key cryptosystems from the worst-case shortest vector problem
- 0-RTT Key Exchange with Full Forward Secrecy
- Watermarking cryptographic capabilities
- Efficient Identity-Based Encryption Without Random Oracles
- Generating Shorter Bases for Hard Random Lattices
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
- Theory of Cryptography
- Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange
- Puncturable Encryption: A Generic Construction from Delegatable Fully Key-Homomorphic Encryption
- Puncturable Identity-Based Encryption from Lattices
This page was built for publication: Puncturable identity-based and attribute-based encryption from lattices
