Faster Bootstrapping with Polynomial Error

DOI10.1007/978-3-662-44371-2_17zbMath1336.94034OpenAlexW2176745559MaRDI QIDQ2874511

Chris Peikert, Jacob Alperin-Sheriff

Publication date: 7 August 2014

Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44371-2_17

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (53)

Constraining and Watermarking PRFs from Milder Assumptions ⋮ Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ Homomorphic Encryption Standard ⋮ An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers ⋮ Fully Homomorphic Encryption with Auxiliary Inputs ⋮ Blending FHE-NTRU Keys – The Excalibur Property ⋮ Multi-key FHE from LWE, Revisited ⋮ Deniable Attribute Based Encryption for Branching Programs from LWE ⋮ Targeted Homomorphic Attribute-Based Encryption ⋮ Survey of information security ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Towards a Simpler Lattice Gadget Toolkit ⋮ Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles ⋮ FHEW with Efficient Multibit Bootstrapping ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus ⋮ Batch bootstrapping. II: Bootstrapping in polynomial modulus only requires \(\tilde{O}(1)\) FHE multiplications in amortization ⋮ A Homomorphic Proxy Re-encryption from Lattices ⋮ Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption ⋮ Verifiable Decryption for Fully Homomorphic Encryption ⋮ Homomorphic encryption: a mathematical survey ⋮ Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds ⋮ FINAL: faster FHE instantiated with NTRU and LWE ⋮ Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping ⋮ Balanced non-adjacent forms ⋮ Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding ⋮ Batched fully dynamic multi-key FHE from FHEW-like cryptosystems ⋮ Fast blind rotation for bootstrapping FHEs ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ Ring-based identity based encryption -- asymptotically shorter MPK and tighter security ⋮ Vector and functional commitments from lattices ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ Simulatable verifiable random function from the LWE assumption ⋮ Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based ⋮ Cryptanalysis of a Homomorphic Encryption Scheme Over Integers ⋮ Compact Inner Product Encryption from LWE ⋮ Ring Packing and Amortized FHEW Bootstrapping ⋮ A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE ⋮ A more efficient leveled strongly-unforgeable fully homomorphic signature scheme ⋮ FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Candidate iO from homomorphic encryption schemes ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ TFHE: fast fully homomorphic encryption over the torus ⋮ Candidate iO from homomorphic encryption schemes ⋮ Bootstrapping fully homomorphic encryption over the integers in less than one second ⋮ FHE Circuit Privacy Almost for Free ⋮ Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts ⋮ Homomorphic Proxy Re-Authenticators and Applications to Verifiable Multi-User Data Aggregation ⋮ Homomorphic Encryption ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ Key-homomorphic pseudorandom functions from LWE with small modulus

This page was built for publication: Faster Bootstrapping with Polynomial Error