Attribute-based proxy re-encryption from standard lattices

DOI10.1016/j.tcs.2021.02.036zbMath1497.68161OpenAlexW3134098021WikidataQ122657777 ScholiaQ122657777MaRDI QIDQ2661778

Fuqun Wang, Fucai Luo, Saif Al-Kuwari, Ke-Fei Chen

Publication date: 8 April 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.02.036

zbMATH Keywords

attribute-based encryptionproxy re-encryptionkey-policylearning with errorsattribute-based proxy re-encryption

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

Attribute-based conditional proxy re-encryption in the standard model under LWE

Cites Work

• Unnamed Item
• Efficient selective identity-based encryption without random oracles
• A CCA-secure key-policy attribute-based proxy re-encryption in the adaptive corruption model for dropbox data sharing system
• Watermarking PRFs from lattices: stronger security via extractable PRFs
• Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Targeted Homomorphic Attribute-Based Encryption
• Predicate Encryption for Circuits from LWE
• 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
• Public-key cryptosystems from the worst-case shortest vector problem
• Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• An Introduction to Computational Physics
• Private Puncturable PRFs from Standard Lattice Assumptions
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Attribute-based proxy re-encryption from standard lattices