scientific article
From MaRDI portal
Publication:3549641
zbMath1232.68057MaRDI QIDQ3549641
Katael Pass, Muthuramakrishnan Venkitasubramaniam
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Concurrent knowledge extraction in public-key models ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ Simultaneous Secrecy and Reliability Amplification for a General Channel Model ⋮ Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs ⋮ Parallel repetition of computationally sound protocols revisited ⋮ Predictable Arguments of Knowledge ⋮ Parallel and concurrent security of the HB and \(HB^{+}\) protocols ⋮ Interactive Coding for Interactive Proofs ⋮ Chernoff-type direct product theorems ⋮ An Efficient Parallel Repetition Theorem ⋮ Parallel Repetition Theorems for Interactive Arguments ⋮ Amplifying the security of functional encryption, unconditionally
