Cryptanalysis of a homomorphic encryption scheme

DOI10.1007/s12095-017-0243-8zbMath1384.94036OpenAlexW2518917232WikidataQ121322988 ScholiaQ121322988MaRDI QIDQ680918

Serge Vaudenay, Sonia Bogos, John Gaspoz

Publication date: 29 January 2018

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/220692/files/main.pdf

zbMATH Keywords

cryptanalysispublic key cryptographyhomomorphic encryptionkey switching

Mathematics Subject Classification ID

Cryptography (94A60)

Uses Software

• fhe

Cites Work

• Unnamed Item
• Unnamed Item
• Advances in cryptology -- EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15--19, 2012. Proceedings
• Fully homomorphic SIMD operations
• (Leveled) fully homomorphic encryption without bootstrapping
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Fully Homomorphic Encryption with Polylog Overhead
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
• Fully Homomorphic Encryption over the Integers
• A Framework for Efficient and Composable Oblivious Transfer
• Packed Ciphertexts in LWE-Based Homomorphic Encryption
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption over the Integers with Shorter Public Keys
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits

This page was built for publication: Cryptanalysis of a homomorphic encryption scheme