New techniques for obfuscating conjunctions

DOI10.1007/978-3-030-17659-4_22MaRDI QIDQ2292710zbMATH OpenOpenAlexFDO

Authors James Bartusek, Tancrède Lepoint, Fermi Ma, Mark Zhandry

Publication date 4 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-17659-4_22

zbMATH Keywords

distributional VBB securityrandom binary linear codeReed-Solomon code

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05)

Recommendations

• Obfuscating conjunctions
• Obfuscating conjunctions
• Obfuscating conjunctions under entropic ring LWE
• Black-box obfuscation for \(d\)-CNFs
• Obfuscating simple functionalities from knowledge assumptions

Cited in

(18)

• Simpler constructions of asymmetric primitives from obfuscation
• Cryptanalysis of candidate obfuscators for affine determinant programs
• Obfuscated fuzzy Hamming distance and conjunctions from subset product problems
• Unclonable encryption, revisited
• Obfuscating conjunctions under entropic ring LWE
• Obfuscating conjunctions
• Obfuscating conjunctions
• How to obfuscate MPC inputs
• Lockable obfuscation from circularly insecure fully homomorphic encryption
• Nonmalleable digital lockers and robust fuzzy extractors in the plain model
• Small Superset and Big Subset Obfuscation
• Upgrading fuzzy extractors
• Obfuscating evasive decision trees
• Multivariate exponential equations with unknown coefficients
• Obfuscation of evasive algebraic set membership
• Indistinguishability obfuscation from well-founded assumptions
• On the possibility of malicious obfuscation
• Obfuscating finite automata

This page was built for publication: New techniques for obfuscating conjunctions

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