scientific article; zbMATH DE number 5485477

MaRDI QIDQ3549641zbMATH OpenFDO

Authors Katael Pass, Muthuramakrishnan Venkitasubramaniam

Publication date 5 January 2009

zbMATH Keywords

Arthur-Merlin gamesinteractive proof systemparallel-repetition theoremreduction

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited in

(14)

• Chernoff-type direct product theorems
• Fiat-Shamir for highly sound protocols is instantiable
• Amplifying the security of functional encryption, unconditionally
• Concurrent knowledge extraction in public-key models
• Interactive Coding for Interactive Proofs
• Simultaneous secrecy and reliability amplification for a general channel model
• An efficient parallel repetition theorem
• Parallel repetition theorems for interactive arguments
• Parallel repetition of computationally sound protocols revisited
• Predictable arguments of knowledge
• Parallel and concurrent security of the HB and \(HB^{+}\) protocols
• Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
• On witness encryption and laconic zero-knowledge arguments
• An efficient dual-balanced-influence optimization approach for target influence maximization in complex networks

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)