A Homomorphic Proxy Re-encryption from Lattices
From MaRDI portal
Publication:2953873
DOI10.1007/978-3-319-47422-9_21zbMath1381.94080OpenAlexW2531399365MaRDI QIDQ2953873
Weiping Ouyang, Juyan Li, Chun-Guang Ma
Publication date: 6 January 2017
Published in: Provable Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-47422-9_21
Related Items (5)
Multi-key Homomorphic Proxy Re-Encryption ⋮ Lattice-Based Identity-Based Homomorphic Conditional Proxy Re-Encryption for Secure Big Data Computing in Cloud Environment ⋮ A Novel Lattice-Based Ciphertext-Policy Attribute-Based Proxy Re-encryption for Cloud Sharing ⋮ Homomorphic Proxy Re-Authenticators and Applications to Verifiable Multi-User Data Aggregation ⋮ Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting
Cites Work
- Unnamed Item
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Key-Private Proxy Re-encryption under LWE
- Faster Bootstrapping with Polynomial Error
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Packing Messages and Optimizing Bootstrapping in GSW-FHE
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Improved proxy re-encryption schemes with applications to secure distributed storage
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: A Homomorphic Proxy Re-encryption from Lattices