Certificate revocation protocol using k-ary hash tree

Certificate Revocation is a critical issue for a practical. public-key infr astructure. A new efficient revocation protocol using a one-way hash tree s tructure (instead of the classical list structure, which is known as a stan dard for revocation), was proposed and examined to reduce communication and computation costs. In this paper, we analysis a k-ary hash tree for certif icate revocation and prove that k = 2 minimizes communication cost.