Pages that link to "Item:Q3449562"

The following pages link to On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation (Q3449562):

Displayed 27 items.

• One-message zero knowledge and non-malleable commitments (Q1629409) ‎ (← links)
• Certifying trapdoor permutations, revisited (Q1629429) ‎ (← links)
• Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) ‎ (← links)
• Pattern matching on encrypted streams (Q1633445) ‎ (← links)
• Non-interactive secure computation from one-way functions (Q1710666) ‎ (← links)
• Statistical ZAPR arguments from bilinear maps (Q2055670) ‎ (← links)
• Non-interactive zero knowledge from sub-exponential DDH (Q2056667) ‎ (← links)
• Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) ‎ (← links)
• New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) ‎ (← links)
• Multi-theorem designated-verifier NIZK for QMA (Q2120083) ‎ (← links)
• New approaches for quantum copy-protection (Q2120093) ‎ (← links)
• COA-secure obfuscation and applications (Q2170027) ‎ (← links)
• Distributed (correlation) samplers: how to remove a trusted dealer in one round (Q2170033) ‎ (← links)
• Non-black-box simulation in the fully concurrent setting, revisited (Q2423842) ‎ (← links)
• Individual simulations (Q2691606) ‎ (← links)
• Post-quantum resettably-sound zero knowledge (Q2695624) ‎ (← links)
• Statistical ZAPs from group-based assumptions (Q2695645) ‎ (← links)
• 3-Message Zero Knowledge Against Human Ignorance (Q3179352) ‎ (← links)
• Pseudorandom Functions: Three Decades Later (Q5021131) ‎ (← links)
• Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) ‎ (← links)
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) ‎ (← links)
• Magic Adversaries Versus Individual Reduction: Science Wins Either Way (Q5738980) ‎ (← links)
• Explainable arguments (Q6045191) ‎ (← links)
• Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) (Q6111540) ‎ (← links)
• Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) (Q6114266) ‎ (← links)
• On non-uniform security for black-box non-interactive CCA commitments (Q6138083) ‎ (← links)
• More efficient verifiable functional encryption (Q6173113) ‎ (← links)