Paper 2023/068
Obfuscating Evasive Decision Trees
Abstract
We present a new encoder for hiding parameters in an interval membership function. As an application, we design a simple and efficient virtual black-box obfuscator for evasive decision trees. The security of our construction is proved in the random oracle model. Our goal is to increase the class of programs that have practical and cryptographically secure obfuscators.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. INDOCRYPT 2023
- Keywords
- Program ObfuscationPrivacy-Preserving ClassificationDecision TreesVBB Security
- Contact author(s)
-
shalini banerjee @ auckland ac nz
s galbraith @ auckland ac nz
g russello @ auckland ac nz - History
- 2024-02-12: last of 3 revisions
- 2023-01-20: received
- See all versions
- Short URL
- https://ia.cr/2023/068
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/068, author = {Shalini Banerjee and Steven D. Galbraith and Giovanni Russello}, title = {Obfuscating Evasive Decision Trees}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/068}, year = {2023}, url = {https://eprint.iacr.org/2023/068} }