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

DOI10.1016/j.ins.2023.119900MaRDI QIDQ6192306

No author found.

Publication date: 12 February 2024

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

learning with errorsattribute-based threshold proxy re-encryptionhonest re-encryption attacksshare updatethreshold proxy re-encryption

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• (Leveled) Fully Homomorphic Encryption without Bootstrapping
• Chosen-ciphertext secure bidirectional proxy re-encryption schemes without pairings
• A CCA-secure key-policy attribute-based proxy re-encryption in the adaptive corruption model for dropbox data sharing system
• Lattice-based HRA-secure attribute-based proxy re-encryption in standard model
• What about Bob? The inadequacy of CPA security for proxy reencryption
• Chosen-ciphertext secure multi-hop identity-based conditional proxy re-encryption with constant-size ciphertexts
• How to share a secret
• Improved proxy re-encryption schemes with applications to secure distributed storage
• Trapdoors for hard lattices and new cryptographic constructions
• Identity-Based Proxy Re-encryption
• Public-key cryptosystems from the worst-case shortest vector problem
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
• On lattices, learning with errors, random linear codes, and cryptography
• Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation

This page was built for publication: HRA-secure attribute-based threshold proxy re-encryption from lattices