Perfect indistinguishability obfuscation for Boolean polynomial vector spaces via learning

DOI10.1007/978-981-96-1093-8_37MaRDI QIDQ6955089zbMATH OpenFDO

Authors Ning Ding

Publication date 23 July 2025

Full work available at URL https://doi.org/10.1007/978-981-96-1093-8_37

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A theory of the learnable
• Candidate iO from homomorphic encryption schemes
• Candidate obfuscation via oblivious LWE sampling
• Equations over finite fields. An elementary approach
• Factoring and pairings are not necessary for iO: circular-secure LWE suffices
• Fully homomorphic encryption over the integers
• Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
• Indistinguishability obfuscation from circular security
• Indistinguishability obfuscation from well-founded assumptions
• Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
• Indistinguishability obfuscation: from approximate to exact
• On Best-Possible Obfuscation
• On PAC learning algorithms for rich Boolean function classes
• On the (im)possibility of obfuscating programs
• On virtual grey box obfuscation for general circuits

This page was built for publication: Perfect indistinguishability obfuscation for Boolean polynomial vector spaces via learning

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