Pages that link to "Item:Q1413647"
From MaRDI portal
The following pages link to On interactive proofs with a laconic prover (Q1413647):
Displayed 25 items.
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Transparent SNARKs from DARK compilers (Q2055634) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
- A PCP theorem for interactive proofs and applications (Q2170038) (← links)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- Statistical difference beyond the polarizing regime (Q2175943) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- Polylogarithmic two-round argument systems (Q3612244) (← links)
- A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- (Q5009546) (← links)
- On Emulating Interactive Proofs with Public Coins (Q5098777) (← links)
- (Q5121910) (← links)
- Predictable Arguments of Knowledge (Q5738785) (← links)
- Witness-succinct universally-composable SNARKs (Q6061363) (← links)
- Succinct interactive oracle proofs: applications and limitations (Q6155266) (← links)
- A toolbox for barriers on interactive oracle proofs (Q6169366) (← links)