Obfuscating finite automata
From MaRDI portal
Publication:832331
DOI10.1007/978-3-030-81652-0_4zbMATH Open1485.94087OpenAlexW3185101702MaRDI QIDQ832331FDOQ832331
Authors: 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
Recommendations
Cites Work
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Title not available (Why is that?)
- Obfuscation of hyperplane membership
- Advances in Cryptology - EUROCRYPT 2004
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Obfuscation for evasive functions
- Pattern matching on encrypted streams
- A simple obfuscation scheme for pattern-matching with wildcards
- 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
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Obfuscating conjunctions
- Packing messages and optimizing bootstrapping in GSW-FHE
- On the Concept of Software Obfuscation in Computer Security
- Graph-induced multilinear maps from lattices
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)
