Obfuscating finite automata

DOI10.1007/978-3-030-81652-0_4zbMath1485.94087OpenAlexW3185101702MaRDI QIDQ832331

Steven D. Galbraith, Lukas Zobernig

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81652-0_4

zbMATH Keywords

evasive deterministic finite automataperfect circuit-hiding obfuscatorvirtual black box

Mathematics Subject Classification ID

Computational learning theory (68Q32) Cryptography (94A60)

Cites Work

• A simple obfuscation scheme for pattern-matching with wildcards
• Pattern matching on encrypted streams
• GGH15 beyond permutation branching programs: proofs, attacks, and candidates
• On perfect correctness in (lockable) obfuscation
• Obfuscated fuzzy Hamming distance and conjunctions from subset product problems
• Homomorphic encryption for finite automata
• New techniques for obfuscating conjunctions
• Obfuscating Conjunctions under Entropic Ring LWE
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
• Obfuscating Conjunctions
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Packing Messages and Optimizing Bootstrapping in GSW-FHE
• Obfuscation of Hyperplane Membership
• On the Concept of Software Obfuscation in Computer Security
• Graph-Induced Multilinear Maps from Lattices
• Advances in Cryptology - EUROCRYPT 2004
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
• Obfuscation for Evasive Functions
• Unnamed Item