Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting

DOI10.1142/S0129054120500252zbMath1461.94081OpenAlexW3049227096WikidataQ114978627 ScholiaQ114978627MaRDI QIDQ5859633

Zhen Gu, Juyan Li, Chun-Guang Ma

Publication date: 19 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054120500252

zbMATH Keywords

latticesauxiliary inputslearning with errordeterministic public key proxy re-encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Generating shorter bases for hard random lattices
• Multi-use unidirectional identity-based proxy re-encryption from hierarchical identity-based encryption
• Probabilistic encryption
• Key-Private Proxy Re-encryption under LWE
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Pseudorandom Functions and Lattices
• Deterministic Public Key Encryption and Identity-Based Encryption from Lattices in the Auxiliary-Input Setting
• A Homomorphic Proxy Re-encryption from Lattices
• Improved proxy re-encryption schemes with applications to secure distributed storage
• Trapdoors for hard lattices and new cryptographic constructions
• A Simple BGN-Type Cryptosystem from LWE
• Efficient Lattice (H)IBE in the Standard Model
• Identity-Based Proxy Re-encryption
• Deterministic and Efficiently Searchable Encryption
• Key-Private Proxy Re-encryption
• Lattice-Based Identity-Based Homomorphic Conditional Proxy Re-Encryption for Secure Big Data Computing in Cloud Environment
• Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
• Advances in Cryptology - EUROCRYPT 2004
• Proxy Re-encryption from Lattices
• Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
• On lattices, learning with errors, random linear codes, and cryptography