| Carl M. Ellison, Bill Frantz, Butler Lampson, Ron Rivest, Brian Thomas, and Tatu Ylonen. SPKI Examples. The Internet Society, March 1998. See http://www.clark.net/pub/cme/examples.txt; This is draft-ietf-spki-cert-examples-01.txt. |
....synthesis has been called SPKI SDSI. Sometimes, for brevity, it has been called just SPKI or just SDSI, but the reference is now always to the merged design. A SPKI working group of the IETF was formed in 1996 that has continued to re ne the design[20] Various RFC s and Internet drafts[10, 12, 13, 14] document this work. Two web sites [27, 11] give further pointers to work on SPKI SDSI. Several MIT EECS Master s theses [16, 26, 9, 8, 24] have studied various algorithmic and implementation aspects of SPKI SDSI. Of most relevance is JeanEmile Elien s master s thesis[9] which focuses on the ....
....groups of keys, and the auth certs can be used to authorize those keys or groups of keys for speci c operations. We digress for just a moment to talk about authorization tags. The syntax and details of authorization tags are not important to us here; we refer the reader to the relevant documents [11, 13, 14, 12]. We note the following important points about authorization tags: An authorization tag can be viewed as a representation of the the set of requests it authorizes. Given two authorization tags, it is simple for anyone to form an authorization tag that represents the intersection of the sets ....
Carl M. Ellison, Bill Frantz, Butler Lampson, Ron Rivest, Brian Thomas, and Tatu Ylonen. SPKI Examples. The Internet Society, March 1998. See http://www.clark.net/pub/cme/examples.txt; This is draft-ietf-spki-cert-examples-01.txt.
....synthesis has been called SPKI SDSI. Sometimes, for brevity, it has been called just SPKI or just SDSI, but the reference is now always to the merged design. A SPKI working group of the IETF was formed in 1996 that has continued to refine the design[15] Various RFC s and Internet drafts[8, 9, 10, 11] document this work. Two web sites [20, 7] give further pointers to work on SPKI SDSI. Several MIT EECS Master s theses [13, 19, 6, 5] have studied various algorithmic and implementation aspects of SPKI SDSI. Of most relevance is JeanEmile Elien s master s thesis[6] which focuses on the ....
Carl M. Ellison, Bill Frantz, Butler Lampson, Ron Rivest, Brian Thomas, and Tatu Ylonen. SPKI Examples. The Internet Society, March 1998. See http://www.clark.net/pub/cme/examples.txt; This is draft-ietf-spki-cert-examples-01.txt.
....synthesis has been called SPKI SDSI. Sometimes, for brevity, it has been called just SPKI or just SDSI, but the reference is now always to the merged design. A SPKI working group of the IETF was formed in 1996 that has continued to refine the design[15] Various RFC s and Internet drafts[8, 9, 10, 11] document this work. Two web sites [20, 7] give further pointers to work on SPKI SDSI. Several MIT EECS Master s theses [13, 19, 6, 5] have studied various algorithmic and implementation aspects of SPKI SDSI. Of most relevance is JeanEmile Elien s master s thesis[6] which focuses on the ....
Carl M. Ellison, Bill Frantz, Butler Lampson, Ron Rivest, Brian Thomas, and Tatu Ylonen. SPKI Examples. The Internet Society, March 1998. See http://www.clark.net/pub/cme/examples.txt; This is draft-ietf-spki-cert-examples-01.txt.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC