Fully homomorphic encryption with auxiliary inputs

DOI10.1007/978-3-319-16745-9_13MaRDI QIDQ3454587zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

fully homomorphic encryptionlearning with errorsauxiliary inputsleakage resilient cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

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

Cited in

(4)

• scientific article; zbMATH DE number 6874618 (Why is no real title available?)
• 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)