QuasiModo: Efficient Certificate Validation and Revocation [chapter]

Farid F. Elwailly, Craig Gentry, Zulfikar Ramzan
2004 Lecture Notes in Computer Science  
We present two new schemes for efficient certificate revocation. Our first scheme is a direct improvement on a well-known tree-based variant of the NOVOMODO system of Micali [11] . Our second scheme is a direct improvement on a tree-based variant of a multi-certificate revocation system by Aiello, Lodha, and Ostrovsky [1] . At the core of our schemes is a novel construct termed a QuasiModo tree, which is like a Merkle tree but contains a length-2 chain at the leaves and also directly utilizes
more » ... terior nodes. This concept is of independent interest, and we believe such trees will have numerous other applications. The idea, while simple, immediately provides a strict improvement in the relevant time and communication complexities over previously published schemes. A very preliminary portion of this work was conducted when F. Elwailly and Z. Ramzan were at IP Dynamics, Inc.
doi:10.1007/978-3-540-24632-9_27 fatcat:hjt7szcipzbbvacwv3jamw3gua