Pages that link to "Item:Q2826067"

The following pages link to From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again (Q2826067):

Displayed 50 items.

• Refereed delegation of computation (Q385709) ‎ (← links)
• Outsourcing computation: the minimal refereed mechanism (Q777972) ‎ (← links)
• Batch verifiable computation of outsourced functions (Q887441) ‎ (← links)
• Scalable zero knowledge via cycles of elliptic curves (Q1688401) ‎ (← links)
• The hunting of the SNARK (Q1698394) ‎ (← links)
• Practical homomorphic message authenticators for arithmetic circuits (Q1747657) ‎ (← links)
• Generic hardness of inversion on ring and its relation to self-bilinear map (Q1989358) ‎ (← links)
• Multi-server verifiable delegation of computations: unconditional security and practical efficiency (Q2051777) ‎ (← links)
• SPARKs: succinct parallelizable arguments of knowledge (Q2055636) ‎ (← links)
• On succinct arguments and witness encryption from groups (Q2096510) ‎ (← links)
• Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) ‎ (← links)
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) ‎ (← links)
• Succinct non-interactive arguments via linear interactive proofs (Q2136170) ‎ (← links)
• Composition with knowledge assumptions (Q2139641) ‎ (← links)
• Non-interactive batch arguments for NP from standard assumptions (Q2139642) ‎ (← links)
• SoK: communication across distributed ledgers (Q2147221) ‎ (← links)
• Families of SNARK-friendly 2-chains of elliptic curves (Q2170053) ‎ (← links)
• Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation (Q2182074) ‎ (← links)
• Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) ‎ (← links)
• Trojan-resilience without cryptography (Q2697869) ‎ (← links)
• The Feasibility of Outsourced Database Search in the Plain Model (Q2827726) ‎ (← 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 Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption (Q2945373) ‎ (← links)
• On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) ‎ (← links)
• An Introduction to the Use of zk-SNARKs in Blockchains (Q3294800) ‎ (← links)
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) ‎ (← links)
• Multikey Fully Homomorphic Encryption and Applications (Q4599146) ‎ (← links)
• On the Connection between Leakage Tolerance and Adaptive Security (Q4916027) ‎ (← links)
• Constant-Round Interactive Proofs for Delegating Computation (Q4997311) ‎ (← links)
• Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) ‎ (← links)
• (Q5002694) ‎ (← links)
• Toward RSA-OAEP Without Random Oracles (Q5041161) ‎ (← links)
• Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) ‎ (← links)
• Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) ‎ (← links)
• Chosen-Ciphertext Secure Fully Homomorphic Encryption (Q5738757) ‎ (← links)
• An Efficient Self-blindable Attribute-Based Credential Scheme (Q5854421) ‎ (← links)
• Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge (Q6045075) ‎ (← links)
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates (Q6061371) ‎ (← links)
• A survey of elliptic curves for proof systems (Q6063127) ‎ (← links)
• (Q6081719) ‎ (← links)
• Oblivious message retrieval (Q6097269) ‎ (← links)
• Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) ‎ (← links)
• Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier (Q6132419) ‎ (← links)
• Brakedown: linear-time and field-agnostic SNARKs for R1CS (Q6145784) ‎ (← links)
• Onion routing with replies (Q6157533) ‎ (← links)
• \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions (Q6157543) ‎ (← links)
• Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? (Q6157611) ‎ (← links)
• Nova: recursive zero-knowledge arguments from folding schemes (Q6166957) ‎ (← links)
• Threshold signatures with private accountability (Q6166965) ‎ (← links)