XMLDSIG Working Group Richard D. Brown GlobeSet, Inc. Expires December 1999 June 1999 Digital Signatures for XML ------- ---------- --- --- Richard D. Brown GlobeSet, Inc. Document Status This document, file name is intended to become a Proposed Standard RFC. Distribution of this document is unlimited. Comments should be sent to the XMLDSIG mailing list or to the author. Additional information can be found on the web sites maintained by the working group. This document is an Internet-Draft and is in full conformance with all provisions of Section 10 of RFC2026. Internet-Drafts are working documents of the Internet Engineering Task Force (IETF), its areas, and its working groups. Note that other groups may also distribute working documents as Internet-Drafts. Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress." The list of current Internet-Drafts can be accessed at http://www.ietf.org/ietf/1id-abstracts.txt The list of Internet-Draft Shadow Directories can be accessed at http://www.ietf.org/shadow.html Abstract This specification defines syntax and procedures for the computation, verification, and encoding of digital signatures using XML. In addition, it proposes a solution to authenticating Web resources by means of XML. Richard D. Brown [Page 1] INTERNET-DRAFT July 1998 Digital Signatures for XML Revision History 18-June-99: Remove Comments and Suggestions chapter, Change Mailing List Reference Add Contacts Section 04-April-99: Fix numerous typos, Complete the algorithm chapters, Add a Comments and Suggestions chapter, Insert the DTD definition, Add a Resources element -- CS #99122601 13-October-98: Revision to reflect 1998-09-16 XML Namespaces proposal 16-June-98: Initial Draft Contacts Chair(s): Donald Eastlake 3rd Joseph Reagle Jr. Author: Richard D. Brown Mailing List: Discussion: w3c-ietf-xmldsig@w3.org Archive: http://lists.w3.org/Archives/Public/w3c-ietf-xmldsig Subscription: w3c-ietf-xmldsig-request@w3.org specify (un)subscribe in SUBJECT line with an empty body. Web Sites: IETF: http://www.ietf.org/html.charters/xmldsig-charter.html W3C: http://www.w3.org/Signature Richard D. Brown [Page 2] INTERNET-DRAFT July 1998 Digital Signatures for XML Table of Contents Document Status............................................1 Abstract .................................................1 Revision History ..........................................2 Contacts...................................................2 Table of Contents..........................................3 1. Introduction............................................5 2. Objective and Requirements..............................5 3. Signature Basics........................................6 3.1 Signature Element......................................6 3.2 Resources Element......................................7 3.3 Other Attributes Element...............................7 3.4 Originator and Recipient Information Elements..........8 3.5 Key Agreement Algorithm Element........................9 3.6 Signature Algorithm Element............................9 4. Signature Principles....................................9 4.1 Enabling Signature in XML Applications.................9 4.2 Encapsulating Arbitrary Contents......................10 4.3 Implementing Endorsement..............................11 4.4 Supporting Composite Documents........................11 4.5 Facilitating One-pass Processing......................13 5. Syntax Comments........................................14 5.1 Namespace Attributes..................................14 5.2 dsig:eval Global Attribute............................14 5.3 Uniform Resource Names................................15 5.4 Basic Data Types......................................16 5.5 Algorithm Definitions.................................16 6. Detailed Signature Syntax..............................17 6.1 Algorithm.............................................17 6.2 Attribute.............................................18 6.3 Attributes............................................18 6.4 Certificate...........................................19 6.5 Certificates..........................................20 6.6 ContentInfo...........................................20 6.7 Date..................................................21 6.8 Digest................................................21 6.9 DigestAlgorithms......................................22 6.10 Identifier...........................................22 6.11 Integer..............................................23 6.12 IssuerAndSerialNumber................................23 6.13 KeyAgreementAlgorithm................................24 6.14 Keyword..............................................24 6.15 Locator..............................................25 6.16 Manifest.............................................25 6.17 OriginatorInfo.......................................26 6.18 Package..............................................27 6.19 Parameter............................................27 6.20 Real.................................................28 6.21 RecipientInfo........................................29 Richard D. Brown [Page 3] INTERNET-DRAFT July 1998 Digital Signatures for XML 6.22 Resource.............................................29 6.23 Resources............................................30 6.24 Signature............................................30 6.25 SignatureAlgorithm...................................31 6.26 Signatures...........................................31 6.27 Value................................................32 7. Default Document Element...............................32 8. Standard Attributes....................................34 8.1 Signing-time Attribute................................34 9. Digest Algorithms......................................34 9.1 SHA1..................................................35 9.2 DOM-HASH..............................................35 9.3 XHASH.................................................36 10. Key Agreement Algorithms..............................37 10.1 PKCS12-PBE...........................................38 11. Key Exchange Algorithms...............................39 11.2 Diffie Hellman.......................................39 12. Signature Algorithms..................................39 12.1 HMAC.................................................39 12.2 DSA..................................................41 12.3 RSA-Encryption.......................................42 12.4 ECDSA................................................43 13. References............................................43 14. Signature DTD.........................................44 15. Embedded Content Example..............................49 16. Detached Signature Example............................51 17. Domain-specific Example...............................52 Richard D. Brown [Page 4] INTERNET-DRAFT July 1998 Digital Signatures for XML 1. Introduction XML, the Extensible Markup Language [x], is a syntactical standard elaborated by the World Wide Web Consortium. Subset of an international text-processing standard known as SGML (Standard Generalized Markup Language), XML is intended primarily for structuring data exchanged and served over the World Wide Web. Structuring information permits data to be easily read, exchanged, and acted upon by software agents. It is a first step toward the production of a Web of machine-readable semantics. But, the usefulness of such structured information is limited if its authenticity and trustworthiness cannot be verified. The Web cannot suffice with XML - it needs Signed-XML. 2. Objective and Requirements The objective of this specification is to define syntax and procedures for the computation, verification, and encoding of digital signatures using XML. It proposes a solution to authenticating Web resources by means of XML. This specification has been established in light of the requirements that have been gathered while reviewing diverse projects and alternative proposals such as IOTP [x], BIPS [x], SDML [x], FSML [x] and XMLDSIG [x]. Previous experiences with binary cryptographic syntaxes such as PKCS#7 [x] and CMS [x] have also played an important role in this specification. The redaction of this specification has been driven by the following requirements: - The solution shall provide a means for building authentication into XML applications, but shall also propose an XML alternative to binary signature syntax for signing arbitrary contents. - The solution shall provide for digital signature and message authentication codes, considering symmetric and asymmetric authentication schemes as well as dynamic establishment of keying material. - The solution shall provide for certificate-based and account-based authentication schemes. - The solution shall provide a mechanism that eases the production of composite documents that consist of the combination by addition or deletion of authenticated blocks of information, while preserving verifiability of the origin and authenticity of these blocks of information. Richard D. Brown [Page 5] INTERNET-DRAFT July 1998 Digital Signatures for XML - The solution shall enable authentication of part or totality of a Web document. - The solution shall enable authentication of internal and external resources. - The solution shall provide for extended signature functionality such as co-signature, endorsement, plurality of recipients, etc. 3. Signature Basics 3.1 Signature Element This specification consists primarily of the definition of an XML element known as the Signature element. This element is comprised of two sub elements. The first one is a set of authenticated attributes, known as the signature Manifest, which comprises such things as a unique reference to the resources being authenticated and an indication of the keying material and algorithms being used. The second sub-element consists of the digital signature value. (resources information block) (other attributes) (originator information block) (recipient information block) (key agreement algorithm information block) (signature algorithm information block) (encoded signature value) The digital signature is not computed directly from the pieces of information to be authenticated. Instead, the digital signature is computed from a set of authenticated attributes (the Manifest), which includes a reference to, and a digest of, these pieces of information. The authentication is therefore 'indirect'. Richard D. Brown [Page 6] INTERNET-DRAFT July 1998 Digital Signatures for XML 3.2 Resources Element The Resources element consists of a collection of Resource elements that, in turn, consist of a unique and unambiguous reference to a resource being authenticated. Each Resource element is constructed of a locator, a fingerprint, and optionally a content-type qualifier. (digest information block) ... The resource locator is implemented as a simple XML Link [x]. This not only provides a unique addressing scheme for internal and external resources, but also facilitates authentication of composite documents. 3.3 Other Attributes Element The Attributes element consists of a collection of Attribute elements that enable attachment and authentication of specific pieces of information that relate to a given signature. An Attribute element is constructed of a type, a criticality, and a value. (ANY attribute value) The attribute value consists of ANY content that is defined in the application DTD. Nevertheless, to facilitate the adoption of 'standard' attributes, the Signature DTD provides for common types such as 'signing time.' Richard D. Brown [Page 7] INTERNET-DRAFT July 1998 Digital Signatures for XML 3.4 Originator and Recipient Information Elements The purpose of the Originator and Recipient information elements consists of providing identification and keying material for these respective parties. (identification information block) (keying material information block) (identification information block) (keying material information block) The actual content of these two elements depends on the authentication scheme being used and the existence or non-existence of a prior relationship between the parties. In some circumstances, it may be quite difficult to distinguish between identification and keying material information. A unique reference to a digital certificate provides for both. This may also stand true for an account number when a prior relationship exists between the parties. The Originator information element is mandatory. Depending on the existence or non-existence of a prior relationship with the recipient, this block either refers to a public credential such as a digital certificate or displays a unique identifier known by the recipient. The Recipient information element may be used when a document contains multiple signature information blocks, each being intended for a particular recipient. A unique reference in the Recipient information block helps the recipients identify their respective Signature information block. The Recipient information element may also be used when determination of the authentication key consists of a combination of keying material provided by both parties. This would be the case, for example, when establishing a key by means of Diffie Hellman [x ] Key Exchange algorithm. Richard D. Brown [Page 8] INTERNET-DRAFT July 1998 Digital Signatures for XML 3.5 Key Agreement Algorithm Element The Key Agreement Algorithm element is an optional element that could be used to indicate the algorithm to be used for deriving a one-time session key from a master key. Usage of one-time session key prevents some kinds of attack that require a large volume of cipher-text to be produced by a given key. (algorithm information block) 3.6 Signature Algorithm Element The Signature Algorithm element indicates the algorithm to be used for computation of the signature value. (algorithm information block) In consideration of the requirements stated previously, this document uses the terminology of 'signature' for qualifying indifferently signature and authentication schemes. Therefore, the signature algorithm mentioned above might refer to a signature algorithm such as DSS or to a message authentication code (MAC) such as HMAC. 4. Signature Principles 4.1 Enabling Signature in XML Applications As mentioned previously, this specification provides among others a means for building authentication into XML applications. The mechanism adopted herein considers the 'XML Namespaces' specification [x], which defines the requirements for combining multiple DTDs or parts of individual DTD into a single document According to this specification, an XML application can build digital signature support by referring explicitly to the elements defined in the Signature DTD. This is accomplished by associating a namespace prefix to the Signature DTD and qualifying Signature element names by means of this prefix. Richard D. Brown [Page 9] INTERNET-DRAFT July 1998 Digital Signatures for XML Association of a namespace prefix to a DTD shall be done by means of a xmlns attribute, which could appear in any element that either refers to or contains sub-elements that refer to elements of the DTD considered. A qualified name consists of a namespace prefix, a colon, and a name. ... ... ... 4.2 Encapsulating Arbitrary Contents To facilitate encapsulation of arbitrary contents into an XML document, the Signature DTD defines a Package element. Quite similar to a MIME wrapper, this element provides for such things as content type and content encoding. (safe content) Richard D. Brown [Page 10] INTERNET-DRAFT July 1998 Digital Signatures for XML 4.3 Implementing Endorsement Endorsement consists of signing another signature. To facilitate endorsement, the definition of the Signature element provides for an element identifier attribute, which can be used to target a Signature element from a Resource element. ... ... ... ... ... ... 4.4 Supporting Composite Documents Some protocols consist of the exchange of documents that result from the combination by addition or deletion of common information blocks. The current proposal shall preserve verifiability of the origin and authenticity of these blocks of information as they are exchanged between parties To facilitate authentication of such composite documents, this specification has adopted an 'indirect' authentication scheme - the signature is applied to unambiguous references to the resources being authenticated instead of their contents. Signature verification does not require the actual contents of the resources. Richard D. Brown [Page 11] INTERNET-DRAFT July 1998 Digital Signatures for XML This indirect scheme can be further extended when multiple signatures must be produced for a large number of resources -- repeating the resource elements in multiple signature Manifests might not be optimal. In such circumstances, the application DTD can leverage the Resources element to share the resource definitions between multiple signature elements. ... ... ... ... ... ... ... ... ... The adoption of simple XML links as resource locators makes possible the authentication of composite documents. If IDREFs were used instead, it would have been impossible to ensure validity of partial documents - some IDREFs could have been left referencing non- embedded IDs. Richard D. Brown [Page 12] INTERNET-DRAFT July 1998 Digital Signatures for XML 4.5 Facilitating One-pass Processing Without further definitions, it would be impossible to determine which blocks of information require authentication and which algorithms need to be employed before interpretation of the Resource elements. These elements being generally located at the end of the document, this restriction would prevent computation of the digests during acquisition of the blocks of information. To facilitate one-pass processing, the current specification uses another functionality offered by the namespaces proposal. This functionality provides for the definition of global attributes that may be used and recognized across multiple elements. This document specifies the dsig:eval global attribute, which could be used for identifying the blocks of information to be authenticated The dsig:eval attribute shall refer to an Algorithm element or list of Algorithm elements that identify the algorithms and parameters to be used for computation of the digest of the element being authenticated. To comply with the requirements of one-pass processing, the Algorithm element should be declared before making use of the dsig:eval attribute. ... ANBbdshh456wh5== ... ... Richard D. Brown [Page 13] INTERNET-DRAFT July 1998 Digital Signatures for XML When encountering the dsig:eval global attribute on an element, the XML parser is immediately aware of the requirement of computing the digest or digests of this element. All the pieces of information necessary for such computation are provided by the Algorithm element or elements referenced by the attribute. The dsig:eval attribute is purely declarative. Discrepancies between the dsig:eval attribute and the digest algorithm definition in the Resource element shall not invalidate the signature. At the most, such discrepancies will result in a verification failure if the signature-agent cannot memorize nor rewind its input stream. 5. Syntax Comments 5.1 Namespace Attributes All the elements defined by the Signature DTD are explicitly bound to the XMLDSIG namespace by means of a dsig prefix. In order to make sure that every element could be individually imported by other XML applications, the element definitions given hereinafter systematically declare a fixed xmlns:dsig attribute. Recall that many XML applications, presumably including namespaces sensitive ones, fail to require validating processors. For correct operations with such applications, namespaces declarations must be also provided either directly or via default attributes declared in the internal subset of the DTD. 5.2 dsig:eval Global Attribute As mentioned previously, this specification defines a dsig:eval global attribute that could be used for identifying a block of information to be authenticated. This attribute shall refer to an Algorithm element or elements, which should be declared before making use of the attribute. Richard D. Brown [Page 14] INTERNET-DRAFT July 1998 Digital Signatures for XML The XML Namespaces specifications do not explicitly provide for declaration of global attributes. Distinguishing between global attributes and element attributes exists only in the prose description of such attributes. An essential property of global attributes consists nonetheless of the uniqueness of their name that is independent of the elements where they are defined. The definition of elements that could be subject to authentication may define the dsig:eval attribute as follows: Recall that the namespace prefix that is bound to the XMLDSIG namespace shall be defined before being employed. However, such definition may occur in the element that defines the dsig:eval attribute. The reader shall notice that the terminology 'dsig:eval' is inappropriate and used solely for illustrative purposes. This simply means that the name of this attribute is eval and it belongs to the XMLDSIG namespace (whatever prefix is used). 5.3 Uniform Resource Names To prevent potential name conflicts in the definition of the numerous type qualifiers considered herein, this specification uses Uniform Resource Names [RFC 2141]. Nonetheless, this specification leverages established standards such as MIME types by providing unambiguous mapping conventions. A complete list of proposed URNs is given in appendix. This list is temporary and will be submitted for approval to the authors or promoters of the algorithms and data types referenced by these URNs. Richard D. Brown [Page 15] INTERNET-DRAFT July 1998 Digital Signatures for XML 5.4 Basic Data Types To facilitate the adoption of common procedures for the encoding of attribute and parameter values, this specification defines a series of elements not directly mandated by the Signature DTD. These definitions propose a common approach to encoding basic data types such as Integer, Float, Date, etc... It is expected that these definitions will be reconsidered, as the results of other W3C Activities in this area (i.e. XML-Data) will be adopted. 5.5 Algorithm Definitions This specification adopts a unique Algorithm data type. Though noticeably different from its ASN1 counterpart, this data type serves a similar purpose and provides for the definition of algorithm specific parameters. The most noticeable difference with ASN1 consists of the assimilation of sub algorithms as parameters of the primary algorithm. In other words, where ASN1 recognizes an algorithm of the type AlgxWithAlgy (i.e. DsaWithSha1) the current specifications recognize Algx with an Algy parameter. This recursive construct is expected to be more versatile and shall provide a solution applicable to the definition of algorithms in general. However, this definition does not preclude the adoption of shortcuts such as the ones proposed by ASN1. It does not preclude either the adoption of default parameter values. Richard D. Brown [Page 16] INTERNET-DRAFT July 1998 Digital Signatures for XML 6. Detailed Signature Syntax 6.1 Algorithm The Algorithm element consists of a basic data type that uniquely identifies a given algorithm and indicates the parameter values to be used during computation. The construct is recursive and allows a parameter value to refer to another Algorithm element. Content Description Parameter: The contents of an Algorithm element consists of an optional collection of Parameter elements, which are specified on a per algorithm basis. Attributes Description id: Element identifier that could be used for referencing this element (from a dsig:eval global attribute for example). type: The type of the algorithm expressed as a Uniform Resource name. Richard D. Brown [Page 17] INTERNET-DRAFT July 1998 Digital Signatures for XML 6.2 Attribute The Attribute element consists of a complementary piece of information, which shall be included in the authenticated part of the document. Though this specification defines standard attributes, this element has been defined primarily for enabling some level of customization in the signature element. An Attribute element consists of a value, a type, and a criticality. Content Description ANY: The actual value of an attribute depends solely upon its type. Attributes Description type: Type of the attribute expressed as a Uniform Resource Name. critical: Boolean value that indicates if the attribute is critical (true) or not (false). A recipient shall reject a signature that contains a critical attribute that he does not recognize. However, an unrecognized non-critical attribute may be ignored. 6.3 Attributes The Attributes element consists of a collection of complementary attributes, which shall be included in the authenticated part of the document. Content Description Attribute: Collection of Attribute elements. Richard D. Brown [Page 18] INTERNET-DRAFT July 1998 Digital Signatures for XML 6.4 Certificate The Certificate element may be used for either providing the value of a digital certificate or specifying a location from where it may be retrieved. Content Description IssuerAndSerialNumber: Unique identifier of this certificate.This element has been made mandatory is order to prevent unnecessary decoding during validation of a certificate chain. This feature also helps certificates caching, especially when the value is not directly provided. Value: Encoding of the certificate value. The actual value to be encoded depends upon the type of the certificate Locator: XML link element that could be used for retrieving a copy of the digital certificate. The actual value being returned by means of this locator depends upon the protocol being used. Attributes Description type: Type of the digital certificate expressed as a Uniform Resource Name. Richard D. Brown [Page 19] INTERNET-DRAFT July 1998 Digital Signatures for XML 6.5 Certificates The Certificates element consists of a collection of Certificate elements. The Certificate elements contained in this element are intended to be sufficient to make chains from the originator credential(s) to a recognized 'certification authority' for all the recipients. However, this element may contain more Certificate elements than necessary or, alternatively, less than necessary if it is known that recipients have an alternate means of obtaining necessary certificates. Content Description Certificate: A collection of Certificate elements. 6.6 ContentInfo The purpose of the ContentInfo element is to describe a given content such that a receiving user agent can deal with the data in an appropriate manner. Attributes Description type: Type of the content expressed as a Uniform Resource Name. subtype: Optional sub-classing of the content type. Richard D. Brown [Page 20] INTERNET-DRAFT July 1998 Digital Signatures for XML 6.7 Date The Date element consists of a constrained ISO 8601:1998 date and time value. Attributes Description value: The date value expressed according to the format defined below. Date Format This specification requires date values to be expressed according to the following pattern: YYYY '-' MM '-' DD 'T' hh ':' mm [':' ss ['.' f+]]('+' | '-') zzzz YYYY: four-digit year MM: two-digit month (01=January, etc.) DD: two-digit day of the month (01-31) hh: two digits of hour (00-23) mm: two digits of minute (00-59) ss: two digits of second (00-59) optional f: digit(s) of fractions of second - optional zzzz: four digits of amount of offset from UTC expressed in hour (00-11) and minute (00-59) For example, '1994-11-05T16:15:02.031-0500' denotes November 5, 1994, 4:15:02 pm and 31 milliseconds, US Eastern Standard Time. 6.8 Digest The Digest element consists of the fingerprint of a given resource. This element is constructed of two sub-elements. This first one indicates the algorithm to be used for computation of the fingerprint. The second element consists of the fingerprint value. Richard D. Brown [Page 21] INTERNET-DRAFT July 1998 Digital Signatures for XML Content Description Algorithm: Algorithm to be used for computation of the digest value. Value: Digest value after proper encoding. 6.9 DigestAlgorithms The DigestAlgorithms element consists of a collection of Algorithm elements that define the algorithms and parameter values to be employed in the computation of digest values. It is primarily used along with the dsig:eval global attribute for enabling one-pass processing. Content Description Algorithm: A collection of digest algorithm definitions. 6.10 Identifier The Identifier element enables identification between parties that benefit from a prior relationship. The actual meaning and content of this element is left to the parties. Attributes Description value: Identification data value. Richard D. Brown [Page 22] INTERNET-DRAFT July 1998 Digital Signatures for XML 6.11 Integer The Integer element is a primary data type that is used in the definition of algorithm parameters. Attributes Description value: Value of the element given according to the format given below. Integer Format This specification requires integer values to be expressed according to the following pattern: ['+'|'-'] n+ For example, +128, -35635, and 64535 are valid integer values. 6.12 IssuerAndSerialNumber The IssuerAndSerialNumber element identifies a certificate, and thereby an entity and a public key, by the distinguished name of the certificate issuer and an issuer-specific certificate serial number. Attributes Description issuer: Distinguished name of the issuing certification authority. number: Issuer-specific certificate serial number. Richard D. Brown [Page 23] INTERNET-DRAFT July 1998 Digital Signatures for XML 6.13 KeyAgreementAlgorithm The KeyAgreementAlgorithm element specifies the algorithm to be employed for establishment of a one-time session key. Content Description Algorithm: Algorithm and parameters to be used for establishment of the session key. 6.14 Keyword The Keyword element is a primary data type that is used in the definition of algorithm parameters. Attributes Description value: Value of the element given as a free form string. Richard D. Brown [Page 24] INTERNET-DRAFT July 1998 Digital Signatures for XML 6.15 Locator The Locator element consists of simple XML link [XLink]. This element allows unambiguous reference to a resource or fragment of a resource. Attributes Description xml:link: Required XML link attribute that specifies the nature of the link (simple in this case). href: Locator value that may contains either a URI [RFC 2396], a fragment identifier, or both. 6.16 Manifest The Manifest element consists of a collection of attributes that specify such things as a unique reference to the resource being authenticated and an indication of the keying material and algorithms to be used. The signature value is actually computed from the Manifest. Richard D. Brown [Page 25] INTERNET-DRAFT July 1998 Digital Signatures for XML Content Description Resources: A collection of Resource elements that consist of a unique and unambiguous reference to the resources being authenticated. Attributes: Optional element that consists of a collection of complementary attributes to be authenticated. OriginatorInfo: Element that provides identification and keying material information related to the originator. RecipientInfo: Optional element that provides identification and keying material information related to the recipient. KeyAgreementAlgorithm: Optional element that indicates the algorithm to be used for establishment of a one-time session key. SignatureAlgorithm: Algorithm to be used for computation of the signature value. 6.17 OriginatorInfo The OriginatorInfo element is used for providing identification and keying material information for the originator. Content Description ANY: Identification and keying material information may consist of ANY construct. Such a definition allows the adoption of application-specific schemes. However, implementations that comply with the current DTD MUST be able to recognize and process the elements Identifier and IssuerAndSerialNumber defined below. Richard D. Brown [Page 26] INTERNET-DRAFT July 1998 Digital Signatures for XML 6.18 Package The Package element enables encapsulation of an arbitrary content into an XML document. Behaving like a MIME wrapper, the Package element provides for such things as content type identification and content encoding. Content Description ContentInfo: Element that provides type information regarding the content of the Package. Value: Element that displays the content value of the Package and provides information regarding possible encoding. Attributes Description id: Element identifier that could be used for referencing this element from a Resource element. 6.19 Parameter A Parameter element provides the value of a particular algorithm parameter, whose name and format have been specified for the algorithm considered. Richard D. Brown [Page 27] INTERNET-DRAFT July 1998 Digital Signatures for XML Content Description ANY: The contents of a Parameter element consists of ANY valid construct, which is specified on a per algorithm per parameter basis. Attributes Description type: The type of the parameter expressed as a free form string, whose value is specified on a per algorithm basis. 6.20 Real The Real element is a primary data type that is used in the definition of algorithm parameters. Attributes Description value: Value of the element given according to the format given below. Real Format This specification requires real values to be expressed according to the following pattern: ['+'|'-'] n+ ['.' f+] ['E' ('+'|'-') ee] For example, 12, -12.34, +12.34E-01, and +0.5 are valid real values. Richard D. Brown [Page 28] INTERNET-DRAFT July 1998 Digital Signatures for XML 6.21 RecipientInfo The RecipientInfo element is used for providing identification and keying material information for the recipient. This element is used either for enabling recognition of a Signature element by a given recipient or when determination of the authentication key consists of the combination of keying material provided by both the recipient and the originator. Content Description The content of this element is similar to the one defined for the originator (cf. OriginatorInfo element description). 6.22 Resource The Resource element consists of a unique and unambiguous reference to a resource being authenticated. It is comprised of a resource locator, a fingerprint, and optionally a content-type qualifier. Content Description ContentInfo: Optional element that provides type information regarding the resource. Locator: Locator value that contains a URI [RFC 2396], a fragment identifier, or both. Notice that making use of a fragment identifier for a document content other than XML is out of the scope of this specification and may lead to inconsistent results. Digest: Fingerprint of the resource. Richard D. Brown [Page 29] INTERNET-DRAFT July 1998 Digital Signatures for XML 6.23 Resources The Resources element consists of a collection of Resource elements. Though inaccessible from the Document element of the Signature DTD, this element is available to more sophisticated constructs that make use of composite documents. Content Description Resource: A collection of Resource elements. Attributes Description id: Element identifier that could be used for referencing this element from a Resource element. 6.24 Signature The Signature element constitutes the core of this specification. It is comprised of two sub-elements. The first one is a set of attributes, known as the Manifest, which actually constitutes the authenticated part of the document. The second sub-element consists of the signature value. Content Description Manifest: Element constructed from the set of attributes that constitute the authenticated part of the document. Value: The signature value after proper encoding. Richard D. Brown [Page 30] INTERNET-DRAFT July 1998 Digital Signatures for XML Attributes Description id: Element identifier that could be used for referencing the Signature element from a Resource element when implementing endorsement. 6.25 SignatureAlgorithm The SignatureAlgorithm element specifies the algorithm to be employed for computation of a signature value. Content Description Algorithm: Algorithm and parameters to be used for computation of the signature value. 6.26 Signatures The Signatures element consists of a collection of Signature elements. As mentioned in a previous paragraph, this element has been defined for the purpose of facilitating DOM manipulations. Content Description Signature: A collection of Signature elements. Richard D. Brown [Page 31] INTERNET-DRAFT July 1998 Digital Signatures for XML 6.27 Value The Value element consists of a primary data type that is used throughout this proposal for inlining and encoding of arbitrary values. Content Description PCDATA: Content value after adequate encoding. Attributes Description encoding: This attribute specifies the scheme to be employed for recovering the original byte stream from the content of the element. This specification recognizes the following two schemes: none: the content has not been subject to any particular encoding. This does not preclude however the use of native XML encoding such as CDATA section or XML escaping. base64: The content has been encoded by means of the base64 encoding scheme. 7. Default Document Element Though it is primarily intended for enabling authentication in other XML applications, the XML Signature DTD specifies a default document element. This definition has been intentionally kept simple and is intended to provide an XML alternative to the ASN1 data types Authenticated Data and Signed Data defined by CMS [x] and PKCS#7 [x] binary syntax standards. Richard D. Brown [Page 32] INTERNET-DRAFT July 1998 Digital Signatures for XML The definition given below addresses the following requirements: - Authentication of arbitrary contents: This may be done by adequate encapsulation and encoding of the arbitrary contents into the Package element, which shall be further authenticated by means of a Signature element. - Detached signature: This may be done by means of a Signature element that refers to a resource external to the document. - Authentication versus signature: The distinction between authentication and signature only depends upon the algorithms being employed for computation of the 'signature' value. - Plurality of recipients: This consists of the insertion of a plurality of Signature elements, each making use of recipient dependent keying material. - Plurality of signers: This consists of the insertion of a plurality of Signature elements, each making use of originator dependent keying material. Content Description DigestAlgorithms: This element has been made mandatory whenever the document embeds the contents to be authenticated. This element specifies the algorithm to be used for computation of the digest of the Package elements, thus enabling one-pass processing. Package: This element is used for enveloping and encoding of the contents to be authenticated. Whenever employed, this element shall make use of the dsig:eval global attribute Signatures: This element consists of a collection of Signature elements. Certificates: This element consists of a collection of Certificate elements, which may be required by a given key management infrastructure. Richard D. Brown [Page 33] INTERNET-DRAFT July 1998 Digital Signatures for XML 8. Standard Attributes This specification recognizes the following standard attributes. 8.1 Signing-time Attribute Standard attribute that could be used for specifying the time at which the originator purportedly performed the signature process. This attribute content shall be given as a Date element. Specification: URN: urn:ietf-org:xmldsig-signing-time Type: dsig:Date Example: 9. Digest Algorithms This specification contemplates two types of digest algorithms: - Surface string digest algorithms: These algorithms do not have any particular knowledge about the content being digested and operate on the raw content value. Changes in the surface string of a given content affect directly the value of the digest being produced. - Canonical digest algorithms: These algorithms have been tailored for a particular content type and produce a digest value that depends upon the core semantics of such content. Changes limited to the surface string of a given content do not affect the value of the digest being produced. Richard D. Brown [Page 34] INTERNET-DRAFT July 1998 Digital Signatures for XML 9.1 SHA1 Surface string digest algorithm designed by NIST and NSA for use with the Digital Signature Standard. This algorithm is documented in NIST FIPS Publication 180-1. Specifications: URN: urn:nist-gov:sha1 Parameters: This algorithm does not require any parameter. 9.2 DOM-HASH XML canonical digest algorithm proposed by IBM Tokyo Research Laboratory and documented in the DOMHASH proposal [x]. This algorithm operates on the DOM representation of the document and provides an unambiguous means for recursive computation of the hash value of the nodes that constitute the DOM tree. This algorithm has many applications such as computation of digital signature and synchronization of DOM trees. However, because the hash value of an element is computed from the hash values of the inner elements, this algorithm is better adapted to small documents that do not require one-pass processing. As of today, this algorithm is limited to the contents of an XML document and, therefore, does not provide for authentication of the internal or external subset of the DTD. The DOM-HASH algorithm requires a single parameter, which shall consist of a surface string digest algorithm such as SHA1. Specifications: URN: urn:ibm-com:dom-hash Parameters: digest-algorithm Surface string digest algorithm to be used for computation of the digest value. type: dsig:Algorithm default: urn:nist-gov:sha1 Richard D. Brown [Page 35] INTERNET-DRAFT July 1998 Digital Signatures for XML Example: 9.3 XHASH XML canonical digest algorithm proposed by GlobeSet and documented in the XHASH proposal [x]. This algorithm has been inspired by the DOM HASH proposal, but operates closer to the surface string of the document. Elements and attributes are subject to formalization in a way quite similar to the one proposed by DOM-HASH - XML delimiters are represented by binary values and entities are replaced by their actual values. However, formalization happens as elements are acquired. Furthermore, this algorithm takes into account some specifics of this specification (e.g. dsig:eval attribute). The XHASH algorithm makes use of two parameters. The first one consists of a surface string digest algorithm such as SHA1. The second one, optional, may be used for specifying how non-significant SPACE characters shall be handled by default. Actually, the XML Specifications define the xml:space attribute that could be used for specifying if non-significant SPACE characters are to be preserved. However, possible values for this attribute are limited to 'default' and 'preserve'. Thus, there is no known way to explicitly specify that non-significant SPACE characters should be discarded Specifications: URN: urn:globeset-com:xhash Parameters: digest-algorithm Surface string digest algorithm to be used for computation of the digest value. type: dsig:Algorithm default: urn:nist-gov:sha1 Richard D. Brown [Page 36] INTERNET-DRAFT July 1998 Digital Signatures for XML white-spaces Default processing of non-significant SPACE characters. type: dsig:Keyword value: preserve: Non-significant SPACE characters are to be preserved in a way similar to what should be done in presence of an xml:space preserve attribute. ignore: Unless overridden by means of an xml:space preserve attribute, non-significant SPACE characters shall be ignored during computation of the canonical form of the contents. default: ignore Example 10. Key Agreement Algorithms A key-agreement algorithm consists of a function that is used for deriving a one-time session key from a given master key. Usage of one-time session keys prevents some kinds of attacks that require a large volume of cipher-text to be produced with a given key. Usage of a key-agreement algorithm is recommended when authentication is based upon a shared secret. This shared secret could have been exchanged either by offline means (e.g. mail) or computed dynamically by means of a key-exchange algorithm such as Diffie Hellman [x]. Richard D. Brown [Page 37] INTERNET-DRAFT July 1998 Digital Signatures for XML 10.1 PKCS12-PBE Key-agreement algorithm proposed by RSA Laboratories and documented in PKCS12 [x]. This algorithm is a generalization of the PBE algorithm defined in PKCS5 [x] and provides for the generation of symmetric keys and other cryptographic parameters from an established password. This algorithm requires three parameters. The first one consists of a one-way hash function (i.e. SHA1), the second one of a random string (salt), and the last one of an iteration count Specifications URN: urn:rsasdi-com:pkcs12-pbe Parameters: digest-algorithm One-way hash function used as the pseudo- random number generator. type: dsig:Algorithm default: urn:nist-gov:sha1 random-string Random string value used to seed the PRNG. type: dsig:Value default: no default. iteration-count type: dsig:Integer default: 256 Example Abkirjegks123qwgtawd456g47 Richard D. Brown [Page 38] INTERNET-DRAFT July 1998 Digital Signatures for XML 11. Key Exchange Algorithms A key-exchange algorithm enables dynamic establishment of a master secret key that results from the combination of keying material provided by the parties involved in an exchange. The parties may further establish a one-time session key from such a master secret key by means of a key-agreement algorithm. Key-exchange algorithms shall not be defined in the body of a signed document. Their usage is implicit and depends solely upon the keying material being used for authentication. 11.1 Diffie Hellman Key-exchange algorithm named from its authors and documented in X9.42. 12. Signature Algorithms This specification abusively uses the terminology of 'digital signature' for qualifying indifferently digital signature and message authentication codes. Thus, the signature algorithms contemplated herein include public-key digital signature algorithms such as DSA and message authentication codes such as HMAC. 12.1 HMAC Message Authentication Code proposed by H. Krawczyk and al. and documented in RFC2104 This specification adopts a scheme that differs a bit from the common usage of this algorithm -- computation of the MAC is performed on the hash of the contents being authenticated instead of the actual contents. Thence, the actual signature value output by the algorithm might be depicted as follows: SignatureValue = HMAC( SecretKet, H(dsig:Manifest)) This specification also considered HMAC output truncation such as proposed by Preneel and van Oorschot. In their paper [x] these two researchers have shown some analytical advantages of truncating the output of hash-based MAC functions. Such output truncation is also considered in the RFC document. Richard D. Brown [Page 39] INTERNET-DRAFT July 1998 Digital Signatures for XML HMAC requires three parameters. The first one consists of a canonical digest algorithm. The second one consists of a hash function. The last one is optional and specifies the length in bit of the truncated output. If this last parameter is absent, no truncation shall occur. Specifications URN: urn:ietf-org:hmac Parameters: digest-algorithm Canonical or surface-string digest algorithm to be is used for computation of the Manifest fingerprint. type: dsig:Algorithm default: urn:nist-gov:sha1 hash-function Hash function that is used to compute the MAC value from the secret key and the fingerprint of the signature Manifest. type: dsig:Algorithm default: urn:nist-gov:sha1 output-length Length in bits of the truncated MAC value. type: dsig:Integer default: no default. Signature Value Encoding: The output of this algorithm can be assumed as a large integer value. The signature value shall consist of the octet-encoded value of this integer. Integer to octet-stream conversion shall be done according to PKCS#1 [x] specification with a k parameter equals to ((Hlen +7) mod8), Mlen being the length in bits of the MAC value. Richard D. Brown [Page 40] INTERNET-DRAFT July 1998 Digital Signatures for XML Example 12.2 DSA Public-key signature algorithm proposed by NIST for use with the Digital Signature Standard. This standard is documented in NIST FIPS Publication 186 [x] and ANSI X9.30 [x]. The DSA algorithm requires a single parameter, which consists of the canonical digest algorithm to be used for computing the fingerprint of the signature Manifest. Specifications URN: urn:nist-gov:dsa Parameters: digest-algorithm Canonical or surface-string digest algorithm to be is used for computation of the Manifest fingerprint. type: dsig:Algorithm default: urn:nist-gov:sha1 Signature Value Encoding: The output of this algorithm consists of a pair of integers usually referred by the pair (r, s). The signature value shall consist of the concatenation of two octet-streams that respectively result from the octet-encoding of the values r and s. Integer to octet-stream conversion shall be done according to PKCS#1 [x] specification with a k parameter equals to 20. Richard D. Brown [Page 41] INTERNET-DRAFT July 1998 Digital Signatures for XML Example 12.3 RSA-Encryption Public-key signature algorithm proposed by RSA Laboratories and documented in PKCS#1 [x]. This specification adopts the RSA encryption algorithm with padding block type 01. For computing the signature value, the signer shall first digest the signature Manifest and then encrypt the resulting digest with his private key. This signature algorithm requires a single parameter, which consists of the canonical digest algorithm to be used for computing the fingerprint of the signature Manifest. Specifications URN: urn:rsasdi-com:rsa-encryption Parameters: digest-algorithm Canonical or surface-string digest algorithm to be is used for computation of the Manifest fingerprint. type: dsig:Algorithm default: urn:nist-gov:sha1 Signature Value Encoding: The output of this algorithm consists of single octet-stream. No further encoding is required. Example Richard D. Brown [Page 42] INTERNET-DRAFT July 1998 Digital Signatures for XML 12.4 ECDSA Public-key signature algorithm proposed independently by Neil Koblitz and Victor Miller. This algorithm is being proposed as an ANSI standard and is documented in ANSI X9.62 standard proposal [x] and IEEE/P1363 standard draft proposal [x]. The ECDSA algorithm requires a single parameter, which consists of the canonical digest algorithm to be used for computing the fingerprint of the signature Manifest. Specifications URN: urn:ansi-org:ecdsa Parameters: digest-algorithm Canonical or surface-string digest algorithm to be is used for computation of the Manifest fingerprint. type: dsig:Algorithm default: urn:nist-gov:sha1 Signature Value Encoding: The output of this algorithm consists of a pair of integers usually referred by the pair (r, s). The signature value shall consist of the concatenation of two octet-streams that respectively result from the octet-encoding of the values r and s. Integer to octet-stream conversion shall be done according to PKCS#1 [x] specification with a k parameter equals to 20. Example 13. References [...more to come...] Richard D. Brown [Page 43] INTERNET-DRAFT July 1998 Digital Signatures for XML 14. Signature DTD <-- XML Signature DTD - 990404 - Revision 0 ---> Richard D. Brown [Page 44] INTERNET-DRAFT July 1998 Digital Signatures for XML Richard D. Brown [Page 45] INTERNET-DRAFT July 1998 Digital Signatures for XML Richard D. Brown [Page 46] INTERNET-DRAFT July 1998 Digital Signatures for XML Richard D. Brown [Page 47] INTERNET-DRAFT July 1998 Digital Signatures for XML Richard D. Brown [Page 48] INTERNET-DRAFT July 1998 Digital Signatures for XML 15. Embedded Content Example This example illustrates use of the default document element for attachment and authentication of an arbitrary piece of information. abncjflf311257gghn6mj2k134h64AANHdd12== bndWGryrt245u6t1dgURTIrr4ir5= Richard D. Brown [Page 49] INTERNET-DRAFT July 1998 Digital Signatures for XML xsqsfasDys2h44u4ehJDe54he5j4dJYTJ= xsqsfasDys2h44u4ehJDe54he5j4dJYTJ= Richard D. Brown [Page 50] INTERNET-DRAFT July 1998 Digital Signatures for XML 16. Detached Signature Example This example illustrates use of the default document element for production of a detached-signature. This example assumes that recipient and originator benefit from a prior relationship. bndWGryrt245u6t1dgURTIrr4ir5= Richard D. Brown [Page 51] INTERNET-DRAFT July 1998 Digital Signatures for XML xsqsfasDys2h44u4ehJDe54he5j4dJYTJ= 17. Domain-specific Example This example illustrates how to leverage the XML Signature DTD to enable authentication in another XML application. This application contemplates the production of authenticated Ticket documents that conform to the following DTD %XmlDsigDtd; Richard D. Brown [Page 52] INTERNET-DRAFT July 1998 Digital Signatures for XML The following consists of a Ticket document that conforms to the previous DTD. The system makes use of a public-key signature algorithm (RSA) and relies upon X509v3 credentials. bndWGryrt245u6t1dgURTIrr4ir5= Richard D. Brown [Page 53] INTERNET-DRAFT July 1998 Digital Signatures for XML xsqsfasDys2h44u4ehJDe54he5j4dJYTJ= xsqsfasDys2h44u4ehJDe54he5j4dJYTJ= File Name: draft-ietf-xmldsig-signature-00.txt Expires: Deember 1999 Richard D. Brown [Page 54]