Pages that link to "Item:Q3408184"

The following pages link to An Efficient Parallel Repetition Theorem (Q3408184):

Displaying 16 items.

• Concurrent knowledge extraction in public-key models (Q271592) (← links)
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
• Parallel repetition of computationally sound protocols revisited (Q421032) (← links)
• Fiat-Shamir for highly sound protocols is instantiable (Q1637340) (← links)
• Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
• Amplifying the security of functional encryption, unconditionally (Q2096505) (← links)
• A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence (Q2102080) (← links)
• Interactive proofs for social graphs (Q2102081) (← links)
• A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
• Tight state-restoration soundness in the algebraic group model (Q2128989) (← links)
• Channels of small log-ratio leakage and characterization of two-party differentially private computation (Q2175926) (← links)
• Interactive Coding for Interactive Proofs (Q2799101) (← links)
• Simultaneous Secrecy and Reliability Amplification for a General Channel Model (Q3179359) (← links)
• An Efficient Parallel Repetition Theorem (Q3408184) (← links)
• Parallel Repetition Theorems for Interactive Arguments (Q3408185) (← links)
• Predictable Arguments of Knowledge (Q5738785) (← links)