Lattice-based HRA-secure attribute-based proxy re-encryption in standard model
From MaRDI portal
Publication:2148757
DOI10.1007/978-3-030-88428-4_9zbMath1498.68059OpenAlexW3201663907MaRDI QIDQ2148757
Priyanka Dutta, Willy Susilo, Partha Sarathi Roy, Dung Hoang Duong
Publication date: 24 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-88428-4_9
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25)
Related Items (2)
Zero-knowledge range arguments for signed fractional numbers from lattices ⋮ HRA-secure attribute-based threshold proxy re-encryption from lattices
Cites Work
- A CCA-secure key-policy attribute-based proxy re-encryption in the adaptive corruption model for dropbox data sharing system
- Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model
- Universal proxy re-encryption
- What about Bob? The inadequacy of CPA security for proxy reencryption
- Adaptively secure proxy re-encryption
- (Leveled) fully homomorphic encryption without bootstrapping
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Functional Re-encryption and Collusion-Resistant Obfuscation
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Improved proxy re-encryption schemes with applications to secure distributed storage
- 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
- Securely Obfuscating Re-encryption
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Obfuscation of Probabilistic Circuits and Applications
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Lattice-based HRA-secure attribute-based proxy re-encryption in standard model
