On the Double Coset Membership Problem for Permutation Groups

TL;DR

This paper demonstrates that the Double Coset Membership problem for permutation groups has perfect zero-knowledge proofs, advancing understanding of cryptographic protocols in group theory.

Contribution

It introduces the first perfect zero-knowledge proof system for the Double Coset Membership problem in permutation groups.

Findings

Established the existence of perfect zero-knowledge proofs for the problem.

Provides a new cryptographic protocol framework for permutation groups.

Enhances security analysis in group-based cryptography.

Abstract

We show that the Double Coset Membership problem for permutation groups possesses perfect zero-knowledge proofs.