Revocable attribute-based proxy re-encryption
From MaRDI portal
Publication:2048189
Recommendations
- Attribute-based proxy re-encryption from standard lattices
- Efficient attribute-based proxy re-encryption with constant size ciphertexts
- Attribute-based conditional proxy re-encryption in the standard model under LWE
- A novel lattice-based ciphertext-policy attribute-based proxy re-encryption for cloud sharing
- Directly revocable key-policy attribute-based encryption with verifiable ciphertext delegation
Cites work
- A CCA-secure key-policy attribute-based proxy re-encryption in the adaptive corruption model for dropbox data sharing system
- An Introduction to Computational Physics
- Attribute-based encryption supporting direct/indirect revocation modes
- Bonsai trees, or how to delegate a lattice basis
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Conditional Proxy Broadcast Re-Encryption
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Efficient lattice (H)IBE in the standard model
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fully private revocable predicate encryption
- Functional encryption for inner product predicates from learning with errors
- scientific article; zbMATH DE number 1303118 (Why is no real title available?)
- scientific article; zbMATH DE number 1842485 (Why is no real title available?)
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
- Lattice-based revocable identity-based encryption with bounded decryption key exposure resistance
- New revocable IBE in prime-order groups: adaptively secure, decryption key exposure resistant, and with short public parameters
- Predicate encryption for circuits from LWE
- Private puncturable PRFs from standard lattice assumptions
- Public-key cryptosystems from the worst-case shortest vector problem
- Revocable hierarchical identity-based encryption with shorter private keys and update keys
- Revocable Identity-Based Encryption from Lattices
- Revocable predicate encryption from lattices
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Watermarking PRFs from lattices: stronger security via extractable PRFs
Cited in
(8)- Revocable predicate encryption from lattices
- Outsourcing the re-encryption key generation: flexible ciphertext-policy attribute-based proxy re-encryption
- Attribute-based conditional proxy re-encryption in the standard model under LWE
- Efficient attribute-based proxy re-encryption with constant size ciphertexts
- Attribute-based proxy re-encryption from standard lattices
- Hybrid proxy re-encryption scheme for attribute-based encryption
- HRA-secure attribute-based threshold proxy re-encryption from lattices
- Time-based attribute-based proxy re-encryption with decryption key update
This page was built for publication: Revocable attribute-based proxy re-encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048189)
