Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic

DOI10.1007/978-3-030-57808-4_6OpenAlexW3082668723MaRDI QIDQ2229267

Hilder Vitor Lima Pereira

Publication date: 23 February 2021

Full work available at URL: http://orbilu.uni.lu/handle/10993/44996

zbMATH Keywords

homomorphic encryptionnondeterministic finite automatanaïve Bayes classifierAGCD

Mathematics Subject Classification ID

Cryptography (94A60) Computer security (68M25)

Related Items (2)

Bootstrapping fully homomorphic encryption over the integers in less than one second ⋮ An optimized GHV-type HE scheme: simpler, faster, and more versatile

Cites Work

• Unnamed Item
• On Kilian's randomization of multilinear map encodings
• Homomorphic encryption for finite automata
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Security Analysis of Multilinear Maps over the Integers
• Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
• Packing Messages and Optimizing Bootstrapping in GSW-FHE
• Fully Homomophic Encryption over the Integers Revisited
• Algorithms for the approximate common divisor problem
• Fully Homomorphic Encryption over the Integers
• Batch Fully Homomorphic Encryption over the Integers
• Fully homomorphic encryption using ideal lattices
• Scale-Invariant Fully Homomorphic Encryption over the Integers
• FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime

This page was built for publication: Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic