Lockable obfuscation

DOI10.1109/FOCS.2017.62MaRDI QIDQ6946324zbMATH OpenFDO

Authors Brent Waters, Rishab Goyal, Venkata Koppula

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2017.62

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(27)

• One-time memories secure against depth-bounded quantum circuits
• Lattice-based post-quantum iO from circular security with random opening assumption
• Pseudorandom obfuscation and applications
• Fully anonymous secret sharing
• A note on adaptive security in hierarchical identity-based encryption
• PKE and ABE with collusion-resistant secure key leasing
• Optimal traitor tracing from pairings
• On quantum money and evasive obfuscation
• Universal computational extractors and multi-bit AIPO from lattice assumptions
• Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
• Dynamic decentralized functional encryption: generic constructions with strong security
• Limits on adaptive security for attribute-based encryption
• Multi-client attribute-based and predicate encryption from standard assumptions
• Multi-authority functional encryption with bounded collusions from standard assumptions
• Key-homomorphic and aggregate verifiable random functions
• Registered FE beyond predicates: (attribute-based) linear functions and more
• Obfuscation of evasive algebraic set membership
• Indistinguishability obfuscation from well-founded assumptions
• Fully adaptive decentralized MA-ABE: simplified, optimized, ASP supported
• Succinct witness encryption for batch languages and applications
• Fully-homomorphic encryption from lattice isomorphism
• Zeroizing attacks against evasive and circular evasive LWE
• Foundations of single-decryptor encryption
• Attribute-based encryption for circuits of unbounded depth from lattices: garbled circuits of optimal size, laconic functional evaluation, and more
• Bilateral access control abe from lattices and application to AB-ME
• Certified everlasting secure collusion-resistant functional encryption, and more
• Circular insecure encryption: from long cycles to short cycles

This page was built for publication: Lockable obfuscation

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