Certificate discovery using SPKI/SDSI 2.0 certificates
Jean-Emile Elien · DSpace@MIT (Massachusetts Institute of Technology) · 1998
In this thesis, a framework was designed to implement certificate discovery in SPKI/-SDSI. The process of discovering a valid certificate chain is shown to be analogous to a string re-writing problem of finding certain string derivations. Given this framework, an algorithm was devloped to solve the problem and is shown to a time polynomial in the number of certificates. Given the theoretical framework, two certificate discovery implementations were developed. The first, written in Perl, tooks a simple certificate format and generated the necessary sequence based upon the chain desired. The second implementation, in C, was written as part of a library that is designed for the SPKI/SDSI framework.