Homomorphic encryption for finite automata

DOI10.1007/978-3-030-34621-8_17zbMath1455.94157OpenAlexW2989741158MaRDI QIDQ2176661

Daniele Micciancio, Craig Gentry, Shai Halevi, Nicholas Genise, Baiyu Li

Publication date: 5 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-34621-8_17

zbMATH Keywords

regular expressionsfinite automatahomomorphic encryptioninhomogeneous NTRU

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cryptography (94A60)

Related Items (12)

Towards faster polynomial-time lattice reduction ⋮ Obfuscating finite automata ⋮ Gadget-based iNTRU lattice trapdoors ⋮ NTRU Fatigue: How Stretched is Overstretched? ⋮ Fiat-Shamir signatures based on module-NTRU ⋮ FINAL: faster FHE instantiated with NTRU and LWE ⋮ On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices ⋮ The cut operation in subclasses of convex languages ⋮ Fast blind rotation for bootstrapping FHEs ⋮ Compact lattice gadget and its applications to hash-and-sign signatures ⋮ On the (M)iNTRU assumption in the integer case ⋮ Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic

This page was built for publication: Homomorphic encryption for finite automata