scientific article; zbMATH DE number 5485477
From MaRDI portal
Publication:3549641
zbMATH Open1232.68057MaRDI QIDQ3549641FDOQ3549641
Authors: Katael Pass, Muthuramakrishnan Venkitasubramaniam 
Publication date: 5 January 2009
Title of this publication is not available (Why is that?)
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (12)
- Interactive Coding for Interactive Proofs
- Concurrent knowledge extraction in public-key models
- Parallel repetition of computationally sound protocols revisited
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
- Fiat-Shamir for highly sound protocols is instantiable
- Simultaneous secrecy and reliability amplification for a general channel model
- An efficient parallel repetition theorem
- Parallel repetition theorems for interactive arguments
- Chernoff-type direct product theorems
- Predictable arguments of knowledge
- Amplifying the security of functional encryption, unconditionally
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549641)
