In this paper, we explore a strategy for recovering a PKI system without reconstructing the whole one when the trust anchor has been broken. Specifically, we propose two distributed signature schemes based on the hyper-powering discrete logarithm problem, which is a two-dimensional extension of the discrete logarithm problem. We show that these schemes are existentially unforgeable against the adaptively chosen message attack.
