Pages that link to "Item:Q2176661"
From MaRDI portal
The following pages link to Homomorphic encryption for finite automata (Q2176661):
Displaying 12 items.
- Obfuscating finite automata (Q832331) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- Gadget-based iNTRU lattice trapdoors (Q2152053) (← links)
- Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic (Q2229267) (← links)
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE (Q2305001) (← links)
- On the (M)iNTRU assumption in the integer case (Q2697921) (← links)
- Finite Automata and Application to Cryptography (Q3508382) (← links)
- NTRU Fatigue: How Stretched is Overstretched? (Q6045070) (← links)
- FINAL: faster FHE instantiated with NTRU and LWE (Q6132410) (← links)
- On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices (Q6134037) (← links)
- The cut operation in subclasses of convex languages (Q6165559) (← links)
- Identity-based encryption from lattices using approximate trapdoors (Q6535489) (← links)