Show simple item record

dc.contributor.authorBauer, David
dc.contributor.authorBlough, Douglas M.
dc.date.accessioned2007-01-26T18:22:13Z
dc.date.available2007-01-26T18:22:13Z
dc.date.issued2006
dc.identifier.urihttp://hdl.handle.net/1853/13184
dc.description.abstractPublic-key based certificates provide a standard way to prove one's identity, as certified by some certificate authority (CA). But standard certificates provide a binary identification: either the whole identity of the subject is known, or nothing is known. By using a Merkle hash tree structure, it is possible for a single certificate to certify many separate claims or attributes, each of which may be proved independently, without revealing the others. Additionally, trees from multiple sources can be combined together by modifying the tree structure slightly. This allows claims by different authorities, such as an employer or professional organization, to be combined under a single tree, without the CA needing to know (let alone verify) all of the claims.en
dc.format.extent184018 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen
dc.publisherGeorgia Institute of Technologyen
dc.relation.ispartofseriesCERCS;GIT-CERCS-06-14en
dc.subjectAttributesen
dc.subjectCertificate Authority (CA)en
dc.subjectClaimsen
dc.subjectCopy-resistant credentialsen
dc.subjectMerkle hash tree structureen
dc.subjectMinimum information disclosureen
dc.subjectPublic Key Infrastructure (PKI)en
dc.titleCopy-Resistant Credentials with Minimum Information Disclosureen
dc.typeTechnical Reporten


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record