Puncturable Identity-Based Encryption from Lattices
From MaRDI portal
Publication:6488397
DOI10.1007/978-3-030-90567-5_29zbMATH Open1521.94041MaRDI QIDQ6488397FDOQ6488397
Priyanka Dutta, Partha Sarathi Roy, Willy Susilo, Dung Hoang Duong
Publication date: 13 April 2023
Cites Work
- Public-key cryptosystems from the worst-case shortest vector problem
- On lattices, learning with errors, random linear codes, and cryptography
- 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
- Efficient Identity-Based Encryption Without Random Oracles
- Classical hardness of learning with errors
- Generating Shorter Bases for Hard Random Lattices
- Theory of Cryptography
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Watersβ IBE Scheme
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Watermarking cryptographic capabilities
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Revisiting proxy re-encryption: forward secrecy, improved security, and applications
- 0-RTT Key Exchange with Full Forward Secrecy
- Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange
- Public-Key Puncturable Encryption: Modular and Compact Constructions
- Puncturable Encryption: A Generic Construction from Delegatable Fully Key-Homomorphic Encryption
Cited In (6)
- Revocable Identity-Based Encryption from Lattices
- Zero-knowledge range arguments for signed fractional numbers from lattices
- Puncturable identity-based and attribute-based encryption from lattices
- A lightweight identification protocol based on lattices
- Spatial encryption revisited: from delegatable multiple inner product encryption and more
- Incremental symmetric puncturable encryption with support for unbounded number of punctures
Recommendations
- A practical implementation of identity-based encryption over NTRU lattices π π
- Wildcarded identity-based encryption from lattices π π
- Revocable Identity-Based Encryption from Lattices π π
- Efficient Identity-Based Encryption over NTRU Lattices π π
- Efficient identity-based encryption from LWR π π
- Almost tight multi-instance multi-ciphertext identity-based encryption on lattices π π
- Deterministic identity-based encryption from lattices with more compact public parameters π π
- Deterministic Public Key Encryption and Identity-Based Encryption from Lattices in the Auxiliary-Input Setting π π
- Lattice-based identity-based resplittable threshold public key encryption scheme π π
This page was built for publication: Puncturable Identity-Based Encryption from Lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488397)