Attacking a levelled fully homomorphic encryption system with topological data analysis

DOI10.1007/978-3-031-64529-7_5MaRDI QIDQ6637787zbMATH OpenFDO

Authors Aaruni Kaushik

Publication date 13 November 2024

Full work available at URL https://doi.org/10.1007/978-3-031-64529-7_5

zbMATH Keywords

Craig Gentryfully homomorphic encryptionlattice-based encryptionmachine learning

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Cryptography (94A60)

Recommendations

• Comparison-based attacks against noise-free fully homomorphic encryption schemes
• Breaking fully-homomorphic-encryption challenges. (Abstract)
• (Leveled) fully homomorphic encryption without bootstrapping
• Efficient fully homomorphic encryption from (standard) LWE
• An overview of torus fully homomorphic encryption

Cites work

• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Attacking a levelled fully homomorphic encryption system with topological data analysis

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