Pages that link to "Item:Q2874523"
From MaRDI portal
The following pages link to On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input (Q2874523):
Displaying 31 items.
- Leakage-resilient cryptography from puncturable primitives and obfuscation (Q1710617) (← links)
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs (Q1791668) (← 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)
- Simpler constructions of asymmetric primitives from obfuscation (Q2152062) (← links)
- Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications (Q2179397) (← links)
- Leakage resilience from program obfuscation (Q2318088) (← links)
- The magic of ELFs (Q2318089) (← links)
- Disappearing cryptography in the bounded storage model (Q2697865) (← links)
- Output-Compressing Randomized Encodings and Applications (Q2796121) (← links)
- How to Avoid Obfuscation Using Witness PRFs (Q2799104) (← links)
- Contention in Cryptoland: Obfuscation, Leakage and UCE (Q2799108) (← links)
- Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits (Q2817870) (← links)
- Offline Witness Encryption (Q2822676) (← links)
- Signatures Resilient to Uninvertible Leakage (Q2827729) (← links)
- Obfuscation Combiners (Q2829229) (← links)
- The Magic of ELFs (Q2835598) (← links)
- Simulation-Based Secure Functional Encryption in the Random Oracle Model (Q2946439) (← links)
- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits (Q2947522) (← links)
- Multi-input Functional Encryption with Unbounded-Message Security (Q2953788) (← links)
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) (← links)
- Standard Security Does Not Imply Indistinguishability Under Selective Opening (Q3181024) (← links)
- Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge (Q3454578) (← 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)
- Storing and Retrieving Secrets on a Blockchain (Q5087260) (← links)
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software (Q5270360) (← links)
- Predictable Arguments of Knowledge (Q5738785) (← links)
- Fully Leakage-Resilient Codes (Q5738793) (← links)