Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption

DOI10.1007/978-3-319-31301-6_2zbMath1339.94057OpenAlexW2463885712MaRDI QIDQ2807191

Bastien Vialla, Marie Paindavoine

Publication date: 19 May 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01181319/file/SAC2015.pdf

zbMATH Keywords

mixed integer linear programmingcomplexity analysisbootstrappingfully homomorphic encryption

Mathematics Subject Classification ID

Mixed integer programming (90C11) Cryptography (94A60)

Related Items (3)

A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets ⋮ Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression ⋮ Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges

Uses Software

• HElib
• FHEW
• fhe

Cites Work

• DAG reversal is NP-complete
• Faster homomorphic linear transformations in HElib
• Minimum \(k\)-path vertex cover
• Fully homomorphic SIMD operations
• (Leveled) fully homomorphic encryption without bootstrapping
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Fully Homomorphic Encryption with Polylog Overhead
• Homomorphic Evaluation of the AES Circuit
• FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Fully Homomorphic Encryption over the Integers
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption over the Integers with Shorter Public Keys
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Theory of Cryptography

This page was built for publication: Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption