Reusable garbled deterministic finite automata from learning with errors

DOI10.4230/LIPICS.ICALP.2017.36MaRDI QIDQ5111367zbMATH OpenOpenAlexFDO

Authors Shweta Agrawal, Ishaan Preet Singh

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

learning with errorsTuring machinesfunctional encryptiondeterministic finite automatagarbled 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)

Recommendations

• Functional encryption for cascade automata
• Functional encryption for regular languages
• Functional Encryption for Turing Machines
• Reusable garbled circuits and succinct functional encryption
• Functional encryption for cascade automata (extended abstract)

Cited in

(12)

• Bounded functional encryption for Turing machines: adaptive security from general assumptions
• How to run Turing machines on encrypted data
• Functional encryption for cascade automata
• FE and iO for Turing machines from minimal assumptions
• Collusion-resistant functional encryption for RAMs
• Attribute based encryption for deterministic finite automata from DLIN
• Functional encryption for regular languages
• A general framework for lattice-based ABE using evasive inner-product functional encryption
• Functional encryption for cascade automata (extended abstract)
• Attribute based encryption for Turing machines from lattices
• ABE for DFA from LWE against bounded collusions, revisited
• Functional encryption for Turing machines with dynamic bounded collusion from LWE

This page was built for publication: Reusable garbled deterministic finite automata from learning with errors

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