On perfect correctness in (lockable) obfuscation

From MaRDI portal
Publication:2055721

DOI10.1007/978-3-030-64375-1_9zbMath1479.94321OpenAlexW2978083886MaRDI QIDQ2055721

Satyanarayana Vusirikala, Venkata Koppula, Brent Waters, Rishab Goyal

Publication date: 1 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-64375-1_9




Related Items (32)

Impossibility of quantum virtual black-box obfuscation of classical circuitsNew approaches for quantum copy-protectionHidden cosets and applications to unclonable cryptographyObfuscating finite automataWhite box traitor tracingSimpler constructions of asymmetric primitives from obfuscationDecentralized policy-hiding ABE with receiver privacyObfuscated fuzzy Hamming distance and conjunctions from subset product problemsNew approaches to traitor tracing with embedded identitiesMulti-key and multi-input predicate encryption from learning with errorsBroadcast, trace and revoke with optimal parameters from polynomial hardnessStructure-preserving compilers from new notions of obfuscationsLattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)Rate-1 incompressible encryption from standard assumptionsmrNISC from LWE with polynomial modulusWitness encryption and null-iO from evasive LWEUniversal amplification of KDM security: from 1-key circular to multi-key KDMMulti-input attribute based encryption and predicate encryptionAugmented random oraclesLockable obfuscation from circularly insecure fully homomorphic encryptionPost-quantum insecurity from LWEInstantiability of classical random-oracle-model encryption transformsNonmalleable digital lockers and robust fuzzy extractors in the plain modelHow to use (plain) witness encryption: registered ABE, flexible broadcast, and moreDecentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDHImpossibility results for lattice-based functional encryption schemesDecentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}Post-quantum multi-party computationSecure software leasingA performance evaluation of pairing-based broadcast encryption systems(Commit-and-prove) predictable arguments with privacyWeak Zero-Knowledge beyond the Black-Box Barrier






This page was built for publication: On perfect correctness in (lockable) obfuscation