Minimizing the number of bootstrappings in fully homomorphic encryption

DOI10.1007/978-3-319-31301-6_2MaRDI QIDQ2807191zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

fully homomorphic encryptionbootstrappingmixed integer linear programmingcomplexity analysis

Mathematics Subject Classification ID

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

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

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A public key cryptosystem and a signature scheme based on discrete logarithms
• DAG reversal is NP-complete
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• FHEW: bootstrapping homomorphic encryption in less than a second
• Faster homomorphic linear transformations in HElib
• Fully homomorphic SIMD operations
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption over the integers with shorter public keys
• Fully homomorphic encryption using ideal lattices
• Fully homomorphic encryption with polylog overhead
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Homomorphic evaluation of the AES circuit
• Minimum \(k\)-path vertex cover
• Theory of Cryptography

Cited in

(9)

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

Describes a project that uses

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)