A Novel Provably Secure Key-Agreement Using Secret Subgroup Generator
This addresses the need for post-quantum key exchange schemes in cryptography, but appears incremental as it builds on existing exponentiation methods.
The paper tackles the problem of secure key agreement by proposing a new scheme that is provably secure in a shared secret key indistinguishability model, with the result that it hides the generator of a cyclic subgroup to potentially resist quantum attacks, though no concrete numbers are provided.
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.