SZK proofs for black-box group problems

DOI10.1007/s00224-007-9028-3zbMath1148.68020OpenAlexW2020251611MaRDI QIDQ929290

Bireswar Das, V. Arvind

Publication date: 17 June 2008

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-9028-3

Mathematics Subject Classification ID

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

Related Items (2)

Zero knowledge and circuit minimization ⋮ The hidden subgroup problem and MKTP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph isomorphism is low for PP
• Short presentations for finite groups
• Graph Isomorphism is in SPP
• The Knowledge Complexity of Interactive Proof Systems
• Bounded Round Interactive Proofs in Finite Groups
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography

This page was built for publication: SZK proofs for black-box group problems