SZK proofs for black-box group problems
From MaRDI portal
Recommendations
- SZK Proofs for Black-Box Group Problems
- scientific article; zbMATH DE number 1284153
- Counting Complexity of Solvable Black-Box Group Problems
- scientific article; zbMATH DE number 1104166
- Solvable black-box group problems are low for \(\mathrm{PP}\)
- Solvable black-box group problems are low for PP
- Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
- scientific article; zbMATH DE number 2059223
- Zero-knowledge proofs of knowledge for group homomorphisms
- scientific article; zbMATH DE number 7716603
Cites work
- scientific article; zbMATH DE number 475362 (Why is no real title available?)
- scientific article; zbMATH DE number 1775426 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- scientific article; zbMATH DE number 1418312 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Bounded Round Interactive Proofs in Finite Groups
- Foundations of Cryptography
- Graph Isomorphism is in SPP
- Graph isomorphism is low for PP
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Short presentations for finite groups
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
Cited in
(6)- Zero knowledge and circuit minimization
- The hidden subgroup problem and MKTP
- scientific article; zbMATH DE number 1104166 (Why is no real title available?)
- scientific article; zbMATH DE number 2059223 (Why is no real title available?)
- SZK Proofs for Black-Box Group Problems
- Solvable black-box group problems are low for PP
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 Q929290)