SZK Proofs for Black-Box Group Problems

DOI10.1007/11753728_4MaRDI QIDQ3434677zbMATH OpenOpenAlexFDO

Authors Vikraman Arvind, Bireswar Das

Publication date 2 May 2007

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11753728_4

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30)

Recommendations

• SZK proofs for black-box group problems
• scientific article; zbMATH DE number 2059223
• An Unconditional Study of Computational Zero Knowledge
• Bounded Round Interactive Proofs in Finite Groups
• Solvable black-box group problems are low for \(\mathrm{PP}\)

Cited in

(4)

• Solvable black-box group problems are low for PP
• scientific article; zbMATH DE number 1104166 (Why is no real title available?)
• The Complexity of Zero Knowledge
• SZK proofs for black-box group problems

This page was built for publication: SZK Proofs for Black-Box Group Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434677)