Obfuscating finite automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1008506 (Why is no real title available?)
- A simple obfuscation scheme for pattern-matching with wildcards
- Advances in Cryptology - EUROCRYPT 2004
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Graph-induced multilinear maps from lattices
- Homomorphic encryption for finite automata
- New techniques for obfuscating conjunctions
- Obfuscated fuzzy Hamming distance and conjunctions from subset product problems
- Obfuscating conjunctions
- Obfuscating conjunctions under entropic ring LWE
- Obfuscation for evasive functions
- Obfuscation of hyperplane membership
- On perfect correctness in (lockable) obfuscation
- On the Concept of Software Obfuscation in Computer Security
- Packing messages and optimizing bootstrapping in GSW-FHE
- Pattern matching on encrypted streams
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
Cited in
(4)
This page was built for publication: Obfuscating finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832331)