Multi-identity and Multi-key Leveled FHE from Learning with Errors

DOI10.1007/978-3-662-48000-7_31zbMath1351.94033OpenAlexW2296488250MaRDI QIDQ3457088

Ciarán McGoldrick, Michael Clear

Publication date: 10 December 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_31

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Two-round adaptively secure multiparty computation from standard assumptions ⋮ Multi-key FHE from LWE, Revisited ⋮ Targeted Homomorphic Attribute-Based Encryption ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ An improved affine equivalence algorithm for random permutations ⋮ From FE combiners to secure MPC and back ⋮ Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles ⋮ Multi-key and multi-input predicate encryption from learning with errors ⋮ Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption ⋮ Multi-key Homomorphic Proxy Re-Encryption ⋮ Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ Multi-input attribute based encryption and predicate encryption ⋮ Unnamed Item ⋮ Batched fully dynamic multi-key FHE from FHEW-like cryptosystems ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ Secure MPC: laziness leads to GOD ⋮ Maliciously circuit-private multi-key FHE and MPC based on LWE ⋮ Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based ⋮ A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE ⋮ Chosen-Ciphertext Secure Fully Homomorphic Encryption ⋮ Circuit-Private Multi-key FHE ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Post-quantum multi-party computation ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption ⋮ Spooky Encryption and Its Applications ⋮ Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts ⋮ Breaking the Circuit Size Barrier for Secure Computation Under DDH ⋮ A new Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Keyed-fully homomorphic encryption without indistinguishability obfuscation ⋮ Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS ⋮ Homomorphic Encryption