Pages that link to "Item:Q3642859"
From MaRDI portal
The following pages link to Universal Arguments and their Applications (Q3642859):
Displaying 42 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- Refereed delegation of computation (Q385709) (← links)
- Parallel repetition of computationally sound protocols revisited (Q421032) (← links)
- Combinatorial PCPs with efficient verifiers (Q483706) (← links)
- Handling expected polynomial-time strategies in simulation-based security proofs (Q1021232) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
- Constant-round leakage-resilient zero-knowledge from collision resistance (Q2135523) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Non-malleable commitments against quantum attacks (Q2170101) (← links)
- On the (In)security of Kilian-based SNARGs (Q2175953) (← links)
- PCPs and the hardness of generating synthetic data (Q2210447) (← links)
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits (Q2267359) (← links)
- Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries (Q2379685) (← links)
- Fully leakage-resilient signatures (Q2392093) (← links)
- Non-black-box simulation in the fully concurrent setting, revisited (Q2423842) (← 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)
- On the Existence of Extractable One-Way Functions (Q2829449) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits (Q2947522) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation (Q3449562) (← links)
- Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge (Q3454578) (← links)
- Proofs of Space (Q3457086) (← links)
- Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation (Q3457115) (← links)
- Succinct NP Proofs from an Extractability Assumption (Q3507432) (← links)
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (Q3627426) (← links)
- On the Connection between Leakage Tolerance and Adaptive Security (Q4916027) (← links)
- Distinguishing Distributions Using Chernoff Information (Q4933218) (← links)
- Limitation on the Rate of Families of Locally Testable Codes (Q4933361) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)
- No-signaling linear PCPs (Q5915596) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Rigid matrices from rectangular PCPs (Q6491304) (← links)
- The NISQ complexity of collision finding (Q6637517) (← links)
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance (Q6637522) (← links)
- Reusable online-efficient commitments (Q6653022) (← links)
- Fully malicious authenticated PIR (Q6653043) (← links)
