Comparison-based attacks against noise-free fully homomorphic encryption schemes

DOI10.1007/978-3-030-01950-1_11MaRDI QIDQ2218947zbMATH OpenOpenAlexWikidataFDO

Authors Alessandro Barenghi, Nicholas Mainardi, Gerardo Pelosi

Publication date 18 January 2021

Full work available at URL https://doi.org/10.1007/978-3-030-01950-1_11

zbMATH Keywords

plaintext recovery attackFHEnoise-free schemes

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Towards constructing fully homomorphic encryption without ciphertext noise from group theory
• Homomorphic encryption and secure comparison
• Toward basing fully homomorphic encryption on worst-case hardness
• New ideas to build noise-free homomorphic cryptosystems
• Breaking fully-homomorphic-encryption challenges. (Abstract)
• \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
• Feasibility and infeasibility of adaptively secure fully homomorphic encryption
• On key recovery attacks against existing somewhat homomorphic encryption schemes
• Cryptanalysis of the MORE symmetric key fully homomorphic encryption scheme
• Attacking noisy secret CRT-RSA exponents in binary method

Cited in

(5)

• Cryptanalysis of a homomorphic encryption scheme
• Reaction attack on outsourced computing with fully homomorphic encryption schemes
• On the practical \(\mathrm{CPA}^D\) security of ``exact and threshold FHE schemes and libraries
• Attacking a levelled fully homomorphic encryption system with topological data analysis
• A complete break of an homomorphic encryption algorithm based on polynomial rings

This page was built for publication: Comparison-based attacks against noise-free fully homomorphic encryption schemes

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