Time-based attribute-based proxy re-encryption with decryption key update

DOI10.1007/S10623-024-01467-XMaRDI QIDQ6651908FDO

Authors F. Zhao, Jian Weng, Wenli Xie, Ming Li

Publication date 11 December 2024

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

learning with errorskey updateattribute-based proxy re-encryptiondecryption key exposure resistancehonest re-encryption attackstime-based delegation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• HRA-secure attribute-based threshold proxy re-encryption from lattices
• Revocable attribute-based proxy re-encryption
• Efficient attribute-based proxy re-encryption with constant size ciphertexts
• Revisiting proxy re-encryption: forward secrecy, improved security, and applications
• Flexible attribute-based proxy re-encryption for efficient data sharing

Cites work

• scientific article; zbMATH DE number 1303118 (Why is no real title available?)
• scientific article; zbMATH DE number 1405637 (Why is no real title available?)
• (Leveled) fully homomorphic encryption without bootstrapping
• An Introduction to Computational Physics
• Bonsai trees, or how to delegate a lattice basis
• CCA-secure revocable identity-based encryption schemes with decryption key exposure resistance
• Efficient lattice (H)IBE in the standard model
• Efficient ratcheting: almost-optimal guarantees for secure messaging
• Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
• HRA-secure attribute-based threshold proxy re-encryption from lattices
• Lattice-based HRA-secure attribute-based proxy re-encryption in standard model
• Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
• On lattices, learning with errors, random linear codes, and cryptography
• Revocable identity-based encryption revisited: security model and construction
• Security analysis and improvements for the IETF MLS standard for group messaging
• Smallest singular value of random matrices and geometry of random polytopes
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Updatable public key encryption in the standard model
• What about Bob? The inadequacy of CPA security for proxy reencryption

Cited in

(1)

• HRA-secure attribute-based threshold proxy re-encryption from lattices

This page was built for publication: Time-based attribute-based proxy re-encryption with decryption key update

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6651908)