SZK proofs for black-box group problems
type: Item
instance of: scholarly article
title: SZK proofs for black-box group problems
zbMATH Open document ID: 1148.68020
author: Vikraman Arvind
author: Bireswar Das
published in: Theory of Computing Systems
publication date: 2008-06-17T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 20-04
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 5288689
MaRDI profile type: Publication
full work available at URL: s00224-007-9028-3
OpenAlex ID: W2020251611
cites work: Graph Isomorphism is in SPP
cites work: Bounded Round Interactive Proofs in Finite Groups
cites work: Short presentations for finite groups
cites work: Q4542559
cites work: Foundations of Cryptography
cites work: Q4941874
cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Graph isomorphism is low for PP
cites work: Q4273608
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Theory of Cryptography
cites work: Q4787523
DOI: 10.1007/S00224-007-9028-3
Recommended article: SZK Proofs for Black-Box Group Problems
Recommended article: Q4240509
Recommended article: Counting Complexity of Solvable Black-Box Group Problems
Recommended article: Q4370033
Recommended article: Solvable black-box group problems are low for PP
Recommended article: Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Recommended article: Q4455756
Recommended article: Zero-knowledge proofs of knowledge for group homomorphisms
Recommended article: Q6176155
description: scientific article; zbMATH DE number 5288689