Reusable Garbled Deterministic Finite Automata from Learning With Errors

DOI10.4230/LIPIcs.ICALP.2017.36zbMath1441.68116OpenAlexW2739694080MaRDI QIDQ5111367

Ishaan Preet Singh, Shweta Agrawal

Publication date: 27 May 2020

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7501/pdf/LIPIcs-ICALP-2017-36.pdf/

zbMATH Keywords

Turing machinesdeterministic finite automatafunctional encryptionlearning with errorsgarbled DFA

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data encryption (aspects in computer science) (68P25) Classical models of computation (Turing machines, etc.) (68Q04)

Related Items (6)

FE and iO for Turing machines from minimal assumptions ⋮ Functional encryption for Turing machines with dynamic bounded collusion from LWE ⋮ Attribute based encryption for deterministic finite automata from DLIN ⋮ Bounded functional encryption for Turing machines: adaptive security from general assumptions ⋮ Collusion-resistant functional encryption for RAMs ⋮ ABE for DFA from LWE against bounded collusions, revisited

This page was built for publication: Reusable Garbled Deterministic Finite Automata from Learning With Errors