Pages that link to "Item:Q5261695"
From MaRDI portal
The following pages link to Public-Coin Differing-Inputs Obfuscation and Its Applications (Q5261695):
Displaying 22 items.
- Strongly full-hiding inner product encryption (Q511916) (← links)
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input (Q1688409) (← links)
- Leakage-resilient cryptography from puncturable primitives and obfuscation (Q1710617) (← 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)
- Random walks and concurrent zero-knowledge (Q2229263) (← links)
- Leakage resilience from program obfuscation (Q2318088) (← links)
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) (← links)
- Output-Compressing Randomized Encodings and Applications (Q2796121) (← links)
- Functional Encryption for Turing Machines (Q2796122) (← links)
- Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits (Q2817870) (← links)
- Constrained PRFs for Unbounded Inputs with Short Keys (Q2822688) (← links)
- Signatures Resilient to Uninvertible Leakage (Q2827729) (← links)
- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits (Q2947522) (← links)
- Selective-Opening Security in the Presence of Randomness Failures (Q2953780) (← links)
- Multi-input Functional Encryption with Unbounded-Message Security (Q2953788) (← links)
- Standard Security Does Not Imply Indistinguishability Under Selective Opening (Q3181024) (← links)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software (Q5270360) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Bounded Collusion ABE for TMs from IBE (Q6041291) (← links)
- R3PO: reach-restricted reactive program obfuscation and its applications (Q6635820) (← links)
