Attribute-based conditional proxy re-encryption in the standard model under LWE
From MaRDI portal
Publication:2148755
Recommendations
- Attribute-based proxy re-encryption from standard lattices
- A novel lattice-based ciphertext-policy attribute-based proxy re-encryption for cloud sharing
- Revocable attribute-based proxy re-encryption
- Key-private proxy re-encryption under LWE
- Fine-grained conditional proxy re-encryption and application
Cites work
- scientific article; zbMATH DE number 1303118 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Attribute-based proxy re-encryption from standard lattices
- Better key sizes (and attacks) for LWE-based encryption
- Bonsai trees, or how to delegate a lattice basis
- Chosen-ciphertext secure multi-hop identity-based conditional proxy re-encryption with constant-size ciphertexts
- Classical hardness of learning with errors
- Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation
- Efficient lattice (H)IBE in the standard model
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fine-grained conditional proxy re-encryption and application
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fuzzy conditional proxy re-encryption
- Generating shorter bases for hard random lattices
- Identity-Based Proxy Re-encryption
- Key-private proxy re-encryption under LWE
- Lattice-based identity-based homomorphic conditional proxy re-encryption for secure big data computing in cloud environment
- Multi-use and unidirectional identity-based proxy re-encryption schemes
- Multi-use unidirectional identity-based proxy re-encryption from hierarchical identity-based encryption
- On lattices, learning with errors, random linear codes, and cryptography
- Public-key cryptosystems from the worst-case shortest vector problem
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
Cited in
(10)- Deniable Attribute Based Encryption for Branching Programs from LWE
- Fine-grained conditional proxy re-encryption and application
- Fine-grained proxy re-encryption: definitions and constructions from LWE
- Lattice-based HRA-secure attribute-based proxy re-encryption in standard model
- HRA-secure attribute-based threshold proxy re-encryption from lattices
- Revocable attribute-based proxy re-encryption
- Attribute-based proxy re-encryption from standard lattices
- \(\mathrm{mR}_{\mathrm{LWE}}\)-CP-ABE: a revocable CP-ABE for post-quantum cryptography
- A novel lattice-based ciphertext-policy attribute-based proxy re-encryption for cloud sharing
- Key-private proxy re-encryption under LWE
This page was built for publication: Attribute-based conditional proxy re-encryption in the standard model under LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2148755)