Pages that link to "Item:Q293359"

The following pages link to On the complexity of interactive proofs with bounded communication (Q293359):

Displaying 30 items.

• A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
• Interactive proof systems and alternating time-space complexity (Q685437) (← links)
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
• On the P versus NP intersected with co-NP question in communication complexity (Q1044738) (← links)
• The complexity of the max word problem and the power of one-way interactive proof systems (Q1312183) (← links)
• On interactive proofs with a laconic prover (Q1413647) (← links)
• The hunting of the SNARK (Q1698394) (← links)
• Non-interactive proofs of proximity (Q1745962) (← links)
• Uniform generation of NP-witnesses using an NP-oracle (Q1854397) (← links)
• On succinct arguments and witness encryption from groups (Q2096510) (← links)
• Subquadratic SNARGs in the random oracle model (Q2120100) (← links)
• Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
• Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
• Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
• Succinct arguments in the quantum random oracle model (Q2175929) (← links)
• Incrementally verifiable computation via incremental PCPs (Q2175954) (← links)
• On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
• Interactive Oracle Proofs (Q3181021) (← links)
• Polylogarithmic two-round argument systems (Q3612244) (← links)
• (Q4341733) (← links)
• Interactive proofs and the hardness of approximating cliques (Q4371671) (← links)
• Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
• (Q5093399) (← links)
• (Q5121910) (← links)
• On the virtue of succinct proofs (Q5415478) (← links)
• Predictable Arguments of Knowledge (Q5738785) (← links)
• Succinct interactive oracle proofs: applications and limitations (Q6155266) (← links)
• Doubly efficient interactive proofs over infinite and non-commutative rings (Q6169369) (← links)
• Strong batching for non-interactive statistical zero-knowledge (Q6637570) (← links)
• Constant-round arguments for batch-verification and bounded-space computations from one-way functions (Q6660291) (← links)