Obfuscating evasive decision trees

DOI10.1007/978-3-031-56235-8_5MaRDI QIDQ6623349zbMATH OpenFDO

Authors Shalini Banerjee, Steven D. Galbraith, Giovanni Russello

Publication date 23 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-56235-8_5

zbMATH Keywords

cryptographic hash functionsdecision treesprogram obfuscation

Mathematics Subject Classification ID

Trees (05C05) Data encryption (aspects in computer science) (68P25) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60)

Recommendations

• Obfuscation for evasive functions
• On the (im)possibility of obfuscating programs
• Advances in Cryptology - EUROCRYPT 2004
• scientific article; zbMATH DE number 1842483
• Obfuscating finite automata

Cites work

• A simple obfuscation scheme for pattern-matching with wildcards
• BDPL: a boundary differentially private layer against machine learning model extraction attacks
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• scientific article; zbMATH DE number 1088253 (Why is no real title available?)
• New techniques for obfuscating conjunctions
• Obfuscated fuzzy Hamming distance and conjunctions from subset product problems
• Obfuscation for evasive functions
• Obfuscation of hyperplane membership
• On obfuscating point functions

This page was built for publication: Obfuscating evasive decision trees

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