New techniques for obfuscating conjunctions

DOI10.1007/978-3-030-17659-4_22OpenAlexW2899403849MaRDI QIDQ2292710

Fermi Ma, James Bartusek, Tancrède Lepoint, 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

Reed-Solomon codedistributional VBB securityrandom binary linear code

Mathematics Subject Classification ID

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

Related Items (8)

Obfuscating finite automata ⋮ 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 ⋮ How to obfuscate MPC inputs ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Nonmalleable digital lockers and robust fuzzy extractors in the plain model ⋮ Unclonable encryption, revisited

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