Fully homomorphic encryption with auxiliary inputs

DOI10.1007/978-3-319-16745-9_13zbMATH Open1400.94175OpenAlexW209108230MaRDI QIDQ3454587FDOQ3454587

Authors: 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

Recommendations

• Leakage resilient fully homomorphic encryption
• Fully homomorphic encryption using ideal lattices
• (Leveled) fully homomorphic encryption without bootstrapping
• (Leveled) fully homomorphic encryption without bootstrapping
• Efficient fully homomorphic encryption from (standard) LWE

zbMATH Keywords

fully homomorphic encryptionlearning with errorsauxiliary inputsleakage resilient cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Implementing Gentry's fully-homomorphic encryption scheme
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption using ideal lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• Fully homomorphic encryption over the integers with shorter public keys
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• On lattices, learning with errors, random linear codes, and cryptography
• Efficient public-key cryptography in the presence of key leakage
• Trapdoors for hard lattices and new cryptographic constructions
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• Classical hardness of learning with errors
• (Leveled) fully homomorphic encryption without bootstrapping
• Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
• Leakage-resilient signatures
• Public-key encryption schemes with auxiliary inputs
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• On cryptography with auxiliary input
• Public-Key Cryptosystems Resilient to Key Leakage
• Theory of Cryptography
• Trapdoors for lattices: simpler, tighter, faster, smaller
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Public-key encryption in the bounded-retrieval model
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• How to run Turing machines on encrypted data
• An efficient and parallel Gaussian sampler for lattices
• Scale-invariant fully homomorphic encryption over the integers
• Protecting cryptographic keys against continual leakage
• Faster Bootstrapping with Polynomial Error
• Leakage resilient fully homomorphic encryption
• Lattice-based FHE as secure as PKE

Cited In (4)

• Title not available (Why is that?)
• Attribute-Based Fully Homomorphic Encryption with a Bounded Number of Inputs
• Leakage resilient fully homomorphic encryption
• Practical Fully Homomorphic Encryption for Fully Masked Neural Networks

This page was built for publication: Fully homomorphic encryption with auxiliary inputs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454587)