A Novel Provably Secure Key-Agreement Using Secret Subgroup Generator

TL;DR

This paper introduces a new key-agreement scheme that is provably secure and conceals the subgroup generator, potentially offering post-quantum security against adversaries capable of solving the Discrete Logarithm Problem.

Contribution

The scheme uniquely hides the subgroup generator while maintaining provable security, advancing post-quantum secure key exchange methods.

Findings

Scheme is provably secure in the shared secret key indistinguishability model.

Generator hiding feature enhances security against Discrete Logarithm Problem solvers.

Potential candidate for post-quantum key exchange schemes.

Abstract

In this paper, a new key-agreement scheme is proposed and analyzed. In addition to being provably secure in shared secret key indistinguishability model, the scheme has an interesting feature: while using exponentiation over a cyclic subgroup to establish the key-agreement, the generator of that subgroup is hidden to secure the scheme against adversaries that are capable of solving the Discrete Logarithm Problem, which means that the scheme might be candidate as a post-quantum key exchange scheme.