The following pages link to The hunting of the SNARK (Q1698394):
Displaying 43 items.
- SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- Keyed-fully homomorphic encryption without indistinguishability obfuscation (Q2096599) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Permuted puzzles and cryptographic hardness (Q2175950) (← links)
- On the (In)security of Kilian-based SNARGs (Q2175953) (← links)
- Incrementally verifiable computation via incremental PCPs (Q2175954) (← links)
- The hunting of a snark with total chromatic number 5 (Q2448882) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
- Constrained PRFs for Unbounded Inputs with Short Keys (Q2822688) (← links)
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again (Q2826067) (← links)
- On the existence of extractable one-way functions (Q2829449) (← links)
- The Continuing Saga of Snarks (Q2901263) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database (Q3181022) (← links)
- Delegating RAM Computations (Q3181023) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- (Q4638056) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- Toward RSA-OAEP Without Random Oracles (Q5041161) (← links)
- Chosen-Ciphertext Secure Fully Homomorphic Encryption (Q5738757) (← links)
- No-signaling linear PCPs (Q5915596) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge (Q6045075) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- NIZK from SNARGs (Q6110372) (← links)
- Verifiable Computation and Succinct Arguments for NP (Q6111785) (← links)
- Parallelizable delegation from LWE (Q6114288) (← links)
- Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG (Q6157544) (← links)
- Snarky ceremonies (Q6157546) (← links)
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? (Q6157611) (← 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)
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance (Q6637522) (← links)
- Monotone-policy aggregate signatures (Q6637524) (← links)
- Adaptive security in SNARGs via iO and lossy functions (Q6660293) (← links)
- How to prove statements obliviously? (Q6660309) (← links)
- zk-Bench: a toolset for comparative evaluation and performance benchmarking of SNARKs (Q6660380) (← links)
- Attribute-based keyed fully homomorphic encryption (Q6660543) (← links)
