The following pages link to On Extractability Obfuscation (Q5746332):
Displaying 50 items.
- Strongly full-hiding inner product encryption (Q511916) (← links)
- Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption (Q887451) (← links)
- Upgrading to functional encryption (Q1629441) (← links)
- Fiat-Shamir for highly sound protocols is instantiable (Q1637340) (← links)
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input (Q1688409) (← links)
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions (Q1747658) (← links)
- Function-private functional encryption in the private-key setting (Q1747663) (← links)
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions (Q1753168) (← links)
- How to build time-lock encryption (Q1791669) (← links)
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
- Abuse resistant law enforcement access systems (Q2056806) (← links)
- Multi-client functional encryption for separable functions (Q2061944) (← links)
- Incompressible cryptography (Q2170026) (← links)
- From minicrypt to obfustopia via private-key functional encryption (Q2175213) (← links)
- Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications (Q2179397) (← links)
- KDM security for identity-based encryption: constructions and separations (Q2215124) (← links)
- Offline witness encryption with semi-adaptive security (Q2229274) (← links)
- A new approach to practical function-private inner product encryption (Q2317860) (← links)
- Leakage resilience from program obfuscation (Q2318088) (← links)
- The magic of ELFs (Q2318089) (← links)
- On the power of rewinding simulators in functional encryption (Q2407055) (← links)
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions (Q2661695) (← links)
- Verifiable functional encryption using Intel SGX (Q2697922) (← links)
- Output-Compressing Randomized Encodings and Applications (Q2796121) (← links)
- Functional Encryption for Turing Machines (Q2796122) (← links)
- Perfect Structure on the Edge of Chaos (Q2796138) (← links)
- How to Avoid Obfuscation Using Witness PRFs (Q2799104) (← links)
- Contention in Cryptoland: Obfuscation, Leakage and UCE (Q2799108) (← links)
- Point-Function Obfuscation: A Framework and Generic Constructions (Q2799109) (← links)
- Offline Witness Encryption (Q2822676) (← links)
- Constrained PRFs for Unbounded Inputs with Short Keys (Q2822688) (← links)
- Signatures Resilient to Uninvertible Leakage (Q2827729) (← links)
- Bounded KDM Security from iO and OWF (Q2827740) (← links)
- The Magic of ELFs (Q2835598) (← links)
- Simulation-Based Secure Functional Encryption in the Random Oracle Model (Q2946439) (← links)
- Multi-input Functional Encryption with Unbounded-Message Security (Q2953788) (← links)
- How to Generate and Use Universal Samplers (Q2953794) (← links)
- Leakage-Resilient IND-CCA KEM from the Extractable Hash Proofs with Indistinguishability Obfuscation (Q2980862) (← links)
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) (← links)
- Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database (Q3181022) (← links)
- From Selective to Adaptive Security in Functional Encryption (Q3457089) (← links)
- A Punctured Programming Approach to Adaptively Secure Functional Encryption (Q3457090) (← links)
- Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation (Q3457115) (← links)
- Indistinguishability Obfuscation from Compact Functional Encryption (Q3457116) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- (Q4638057) (← links)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software (Q5270360) (← links)
- CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions (Q5738751) (← links)
