Fully Homomorphic Encryption with Auxiliary Inputs

DOI10.1007/978-3-319-16745-9_13zbMath1400.94175OpenAlexW209108230MaRDI QIDQ3454587

Fuqun Wang, Kun-Peng Wang

Publication date: 25 November 2015

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-16745-9_13

zbMATH Keywords

auxiliary inputsfully homomorphic encryptionlearning with errorsleakage resilient cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• (Leveled) fully homomorphic encryption without bootstrapping
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• How to Run Turing Machines on Encrypted Data
• Faster Bootstrapping with Polynomial Error
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Lattice-based FHE as secure as PKE
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Efficient Public-Key Cryptography in the Presence of Key Leakage
• Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
• Leakage-Resilient Signatures
• Public-Key Encryption Schemes with Auxiliary Inputs
• Trapdoors for hard lattices and new cryptographic constructions
• Fully Homomorphic Encryption over the Integers
• Public-Key Encryption in the Bounded-Retrieval Model
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Protecting Cryptographic Keys against Continual Leakage
• An Efficient and Parallel Gaussian Sampler for Lattices
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• Fully homomorphic encryption using ideal lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• On cryptography with auxiliary input
• Fully Homomorphic Encryption over the Integers with Shorter Public Keys
• Scale-Invariant Fully Homomorphic Encryption over the Integers
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Classical hardness of learning with errors
• Leakage Resilient Fully Homomorphic Encryption
• Public-Key Cryptosystems Resilient to Key Leakage
• On lattices, learning with errors, random linear codes, and cryptography
• Theory of Cryptography

This page was built for publication: Fully Homomorphic Encryption with Auxiliary Inputs