Pages that link to "Item:Q5259586"
From MaRDI portal
The following pages link to On the existence of extractable one-way functions (Q5259586):
Displaying 33 items.
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input (Q1688409) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Reductions in \textbf{PPP} (Q1730025) (← links)
- On subversion-resistant SNARKs (Q2039405) (← links)
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics (Q2102078) (← links)
- On instantiating the algebraic group model from falsifiable assumptions (Q2119007) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- Practical algorithm substitution attack on extractable signatures (Q2119943) (← links)
- A note on perfect correctness by derandomization (Q2146431) (← links)
- On the (In)security of Kilian-based SNARGs (Q2175953) (← links)
- The magic of ELFs (Q2318089) (← links)
- Contention in Cryptoland: Obfuscation, Leakage and UCE (Q2799108) (← links)
- Point-Function Obfuscation: A Framework and Generic Constructions (Q2799109) (← links)
- The Magic of ELFs (Q2835598) (← links)
- On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption (Q2945373) (← links)
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
- A Shuffle Argument Secure in the Generic Model (Q2953798) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Absolute results concerning one-way functions and their applications (Q3833992) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- Toward RSA-OAEP Without Random Oracles (Q5041161) (← links)
- A Note on Perfect Correctness by Derandomization (Q5267419) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
- Explicit two-source extractors and resilient functions (Q5361870) (← links)
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way (Q5738980) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- Knowledge encryption and its applications to simulatable protocols with low round-complexity (Q6135438) (← links)
- To label, or not to label (in generic groups) (Q6163942) (← links)
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation (Q6169370) (← links)
- A simple and efficient framework of proof systems for NP (Q6562565) (← links)
- Witness semantic security (Q6637541) (← links)
- Constant-size zk-SNARKs in ROM from falsifiable assumptions (Q6637561) (← links)
