On extractability obfuscation
From MaRDI portal
Recommendations
Cited in
(77)- Upgrading to functional encryption
- Fiat-Shamir for highly sound protocols is instantiable
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
- Function-private functional encryption in the private-key setting
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- How to build time-lock encryption
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
- Weakly extractable one-way functions
- Abuse resistant law enforcement access systems
- Multi-client functional encryption for separable functions
- Incompressible cryptography
- From minicrypt to obfustopia via private-key functional encryption
- Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications
- KDM security for identity-based encryption: constructions and separations
- Offline witness encryption with semi-adaptive security
- Obfuscating simple functionalities from knowledge assumptions
- A new approach to practical function-private inner product encryption
- Leakage resilience from program obfuscation
- The magic of ELFs
- On the power of rewinding simulators in functional encryption
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
- Verifiable functional encryption using Intel SGX
- Output-compressing randomized encodings and applications
- Functional Encryption for Turing Machines
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- How to avoid obfuscation using witness PRFs
- Contention in cryptoland: obfuscation, leakage and UCE
- Point-function obfuscation: a framework and generic constructions
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Offline witness encryption
- Constrained PRFs for unbounded inputs with short keys
- Signatures Resilient to Uninvertible Leakage
- Bounded KDM security from iO and OWF
- The Magic of ELFs
- Simulation-based secure functional encryption in the random oracle model
- Multi-input functional encryption with unbounded-message security
- How to Generate and Use Universal Samplers
- Leakage-resilient IND-CCA KEM from the extractable hash proofs with indistinguishability obfuscation
- Limits on the power of indistinguishability obfuscation and functional encryption
- Delegating RAM computations with adaptive soundness and privacy
- Adaptive succinct garbled RAM or: how to delegate your database
- From selective to adaptive security in functional encryption
- A punctured programming approach to adaptively secure functional encryption
- Constant-round concurrent zero-knowledge from indistinguishability obfuscation
- Indistinguishability obfuscation from compact functional encryption
- On Best-Possible Obfuscation
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- scientific article; zbMATH DE number 6866298 (Why is no real title available?)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Strongly full-hiding inner product encryption
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Cryptanalyses of Candidate Branching Program Obfuscators
- On the (im)possibility of obfuscating programs
- CCA-secure inner-product functional encryption from projective hash functions
- Fully Leakage-Resilient Codes
- From Minicrypt to Obfustopia via private-key functional encryption
- One-Way Functions and (Im)perfect Obfuscation
- Bounded Collusion ABE for TMs from IBE
- Unbounded quadratic functional encryption and more from pairings
- Structure-preserving compilers from new notions of obfuscations
- On the security of functional encryption in the generic group model
- Identity-based encryption in DDH hard groups
- Public-key watermarking schemes for pseudorandom functions
- Security-preserving distributed samplers: how to generate any CRS in one round without random oracles
- Tracing quantum state distinguishers via backtracking
- Software with certified deletion
- Pseudorandom obfuscation and applications
- Succinct PPRFs via memory-tight reductions
- Succinct arguments for \textsf{BatchQMA} and friends under 8 rounds
- Gap MCSP is not (Levin) NP-complete in obfustopia
- Universal computational extractors and multi-bit AIPO from lattice assumptions
- A meta-complexity theoretic approach to indistinguishability obfuscation and witness pseudo-canonicalization
- (Multi-input) \textsf{FE} for randomized functionalities, revisited
- Lower bounds on the overhead of indistinguishability obfuscation
- Unbounded quadratic functional encryption and more from pairings
- Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
This page was built for publication: On extractability obfuscation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746332)
