Minimizing the number of bootstrappings in fully homomorphic encryption

DOI10.1007/978-3-319-31301-6_2zbMATH Open1339.94057OpenAlexW2463885712MaRDI QIDQ2807191FDOQ2807191

Authors: Marie Paindavoine, Bastien Vialla 

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

Recommendations

• Optimization of bootstrapping in circuits
• Better bootstrapping in fully homomorphic encryption
• FHEW: bootstrapping homomorphic encryption in less than a second
• Practical bootstrapping in quasilinear time
• Faster Bootstrapping with Polynomial Error

zbMATH Keywords

fully homomorphic encryptionbootstrappingmixed integer linear programmingcomplexity analysis

Mathematics Subject Classification ID

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

Cites Work

• Faster homomorphic linear transformations in HElib
• Fully homomorphic encryption with polylog overhead
• Homomorphic evaluation of the AES circuit
• 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
• Minimum \(k\)-path vertex cover
• (Leveled) fully homomorphic encryption without bootstrapping
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Fully homomorphic SIMD operations
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• FHEW: bootstrapping homomorphic encryption in less than a second
• DAG reversal is NP-complete

Cited In (9)

• Better bootstrapping in fully homomorphic encryption
• Bootstrapping fully homomorphic encryption with ring plaintexts within polynomial noise
• A multi-start heuristic for multiplicative depth minimization of Boolean circuits
• Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
• Optimization of bootstrapping in circuits
• A randomized parallel algorithm for efficiently finding near-optimal universal hitting sets
• Improved bootstrapping for approximate homomorphic encryption
• Somewhat/fully homomorphic encryption: implementation progresses and challenges
• Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits

Uses Software

• HElib
• FHEW
• fhe

This page was built for publication: Minimizing the number of bootstrappings in fully homomorphic encryption

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