Copyright © 2008 W3C® (MIT, ERCIM, Keio), All Rights Reserved. W3C liability, trademark and document use rules apply.
This Note summarizes scenarios, design decisions, and requirements for the XML Signature and Canonical XML specifications, to guide ongoing W3C work to revise these specifications.
This section describes the status of this document at the time of its publication. Other documents may supersede this document. A list of current W3C publications and the latest revision of this technical report can be found in the W3C technical reports index at http://www.w3.org/TR/.
This is a First Public Working Draft of "XML Security Use Cases and Requirements."
This document is expected to be further updated based on both Working Group input and public comments. The Working Group anticipates to eventually publish a stabilized version of this document as a W3C Working Group Note.
The use cases and requirements in this document are expected to help guide the XML Security Working Group's development of a version 2 of XML Signature. This Working Draft is published to solicit early community review.
This document was developed by the XML Security Working Group.
Please send comments about this document to public-xmlsec-comments@w3.org (with public archive).
Publication as a Working Draft does not imply endorsement by the W3C Membership. This is a draft document and may be updated, replaced or obsoleted by other documents at any time. It is inappropriate to cite this document as other than work in progress.
This document was produced by a group operating under the 5 February 2004 W3C Patent Policy. The group does not expect this document to become a W3C Recommendation. W3C maintains a public list of any patent disclosures made in connection with the deliverables of the group; that page also includes instructions for disclosing a patent. An individual who has actual knowledge of a patent which the individual believes contains Essential Claim(s) must disclose the information in accordance with section 6 of the W3C Patent Policy.
1 Introduction
2 Principles
3 Usage Requirements and Design
Options
3.1 Long Term
Signatures
3.1.1 General Requirements
3.1.2 Proving that the signature was generated before a
certain point of time.
3.1.3 Proving that the signature was first verified before
a certain point of time.
3.1.4 Countering algorithm / keys weaknesses or validation
material expiration
3.1.5 XAdES and long term XML Signatures
3.2 Web Services
Security
3.2.1 Assumptions
3.2.2 Requirements
3.3 Derived
Keys
3.3.1 Use Cases and Background
3.3.2 Use Of Derived Keys in Existing WS-*
Specifications
3.3.2.1
Web Services Security: UsernameToken Profile
Version 1.1
3.3.2.2
WS-Trust Version 1.3:
3.3.2.3
WS-SecurityPolicy 1.2:
3.3.2.4
WS-SecureConversation 1.3:
3.3.3 Solution Requirements
3.3.3.1
Use in existing specifications
3.3.3.2
No external dependencies
3.3.3.3
Continued use of existing derivation
methods
3.3.3.4
Future-proof with regards to key
lengths
3.3.3.5
Referential flexibility
3.3.4 Existing Specifications vs. Requirements
3.3.5 Design Options
3.3.5.1
Create a ds:DerivedKeyType type modeled
after the xenc:EncryptedKeyType.
3.4 Transforms
3.5 Algorithm
security and interoperability
3.5.1 Fundamentals
3.5.2 Requirements
3.5.2.1
Address SHA security concerns,
recognize RSA de-facto use.
3.5.2.2
Revise guidance for
DSAwithSHA1
3.5.2.3
Add Suite B algorithm
support
3.5.3 Suite B Elliptic Curve Key Value
Design (ECKeyValue)
3.5.3.1
RFC 4050 issues in XML
Signature context
3.5.3.2
Proposed Solution to
RFC 4050 issues in XML Signature context
4 Acknowledgments
5 References
This use case and requirements document is intended to summarize use cases and requirements driving revisions to XML Signature 2nd Edition [XMLDSIG2nd] , XML Encryption [XMLENC] , and Canonical XML 1.1 [C14N11]. It is not intended to define all possible use cases for these Recommendations, but rather to provide rationale for decisions leading to XML Signature 1.1, XML Encryption 1.1 and XML Signature 2.0 and/or other specifications.
This document outlines general principles, elaborating on those expressed for the original XML Security work and then use cases, requirements and design options that impact the design of revisions to the XML Security specifications. It is a work in progress.
The following design principles will be used to guide further development of XML Security, including XML Signature, XML Encryption and Canonical XML. These principles are intended to encourage consistent design decisions, to provide insight into design rationale and to anchor discussions on requirements and design. This list includes items from the original requirements for XML Signature [XMLDSIG-REQS] as well as general principles from EXI [EXI]. Listed in alphabetical order:
Backward compatibility should not be broken unnecessarily. Versioning should be clearly considered. Consideration must be given, for example, for interoperability with the First and Second Editions of XML Signature [XMLDSIG2nd].
XML Security must be consistent with the Web Architecture [Webarch].
XML Security should enable efficient implementations, in order to remove barriers to adoption and use.
One of primary objectives of XML Signature is to support a wide variety of use cases requiring digital signatures, including situations requiring multiple signatures, counter-signatures, and signatures including multiple items to be included in a signature. Extensibility should be possible, but by default options should be constrained when the flexibility is not needed.
To reach the broadest set of applications, reduce the security threat footprint and improve efficiency, simple, elegant approaches are preferred to large, analytical or complex ones.
Recognize pragmatic issues, including recognizing that software might be implemented in layers, with a security layer independent of an application layer.
Existing open standards should be reused where possible, as long as other principles can be met.
XML Security should adhere to security best practices, and minimize the opportunities for threats based on XML Security mechanisms.
XML Security must integrate well with existing XML technologies, be compatible with the XML Information Set [Infoset], in order to maintain interoperability with existing and prospective XML specifications.
XML Signatures should themselves be self-describing first class XML objects [XMLDSIG-REQS]. This means that XML Signatures can be referenced via URI and used in other operations. For example, an XML Signature may be signed or encrypted, or referred to in a statement (such as an RDF statement).
This section summarizes a number of scenarios in which the XML Signature and Canonical XML specifications are used, and identifies distinguishing properties of these scenarios.
Usage scenarios may fall into the following categories which may have different requirements:
Document workflow
Long Term Signatures
Minimal signatures on XML or binary content
Token signing and verification
Web services
Long term signatures are signatures whose contents allow an entity to ascertain, long time after the signature was first verified, that the signature was valid when produced.
The “long term” expression typically implies periods of several years (in certain European countries, invoices must be kept for up to five years, and this requirement is extended to electronic invoices electronically signed). These signatures must counter the effects of time passing. One of them, for instance, is the fact that after their first verification and after such a long period of time, certificates within the certificate path may have expired or some of them may even have been revoked.
The ascertaining entity may be, in some cases, different from the relying party that first verified the signature (an arbitrator in charge of solving disputes between signer and verifier, for instance).
There are general requirements associated with long term signatures:
There must be deployed secure mechanisms for proving that the signature was generated before a certain point in time.
There must be deployed secure mechanisms for proving that the signature was first verified by the corresponding relying party before a certain point in time.
There must be deployed mechanisms allowing the ascertaining entity to gain access to all the validation material that the relying party had used for verifying the signature.
There must be deployed mechanisms allowing to counter weaknesses discovered on cryptographic algorithms or keys used in the generation of the signature, or expiration of verification material.
Generally speaking each of the generic requirements in the list above may imply the incorporation of additional information within the XML Signature structure after the ds:SignatureValue has been generated.
A long term signature must securely prove that it was actually generated before a certain point in time.
At present, two mechanisms have been identified for achieving such a requirement:
The inclusion in the signature of a trusted time-stamp, generated by a Trusted Time-Stamping Authority, immediately after the signature has been generated (signature time-stamp).
To deploy a process that generates artifacts that actually may prove in the future that the signature was created at that point of time (secure records of actions, for instance).
For resolving potential disputes between signer and verifier, a long term signature must also be able to securely prove that the relying party first verified it before a certain point in time.
For proving this, it must be securely proved that the verifier had gained access to all the verification material before that point of time. The requirements on the signature are, in consequence, as follows:
Mechanisms must be provided for collecting within the XML Signature, all the validation material used by the relying party in the first verification. This includes:
Certificates within the certificate path of the signing certificate.
Material reporting the status of each certificate within the certificate path of the signing certificate (CRLs or OCSP responses).
Certificates within the certificate path of the certificate used by the Trusted Time-Stamping Authority that generated the signature time-stamp.
Material reporting the status of each certificate within the certificate path aforementioned in c.
A trusted time-stamp generated by a Trusted Time-Stamping Authority, covering both the signature generated and the verification material listed before. This time-stamp will actually prove that the relying party had gained access to the validation material and in consequence, had the capability for verifying the signature, before the time indicated in the time-stamp.
Once the validation material has been collected and time-stamped, the action of time may bring two different types of consequences:
Some of the algorithms (or keys) used for generating the signature or any of the aforementioned time-stamps may be broken.
Some of the certificates in the certification path of the time-stamp covering this validation material may expire.
A long-term signature must counter any of the two consequences in the list.
A countering mechanism consists in regularly generating trusted time-stamps covering the signature, all the previously issued time-stamps and all the validation material (archive time-stamps).
If some algorithm / key has been broken, this time-stamp may use different algorithm / keying material.
If some of the certificates within the certificate path of the latest time-stamp have expired, the new one will have a new certificate within its corresponding certificate path.
A form of long term signatures may be obtained by allowing XML Signatures to incorporate such archive time-stamps.
XAdES, "XML Advanced Electronic Signatures" [XAdES], specifies XML Schema types suitable for containing all the different types of data mentioned in here, namely, time-stamp tokens, validation data, etc.
XAdES also standardizes ways for adding all this material to regular XML Signatures, increasing interoperability among applications.
Message content will be provided and processed by multiple software components acting autonomously. The XML will make use of multiple namespaces, potentially with duplicate element names.
Messages may pass through multiple intermediary nodes which may add, subtract or alter content in either the SOAP header or body.
Generally the ability to provide ephemeral authentication, integrity protection and confidentiality of message content including attachments, using a variety of technologies. In some cases, messages with signatures may be stored for purposes of non-repudiation.
Any or all of messages may be signed and/or encrypted zero or more times in any order. Signatures and encryptions may overlap. A receiver must be able to properly verify signatures and decrypt data in the proper order (assuming access to the necessary secrets or trust points) based on nothing but the message.
It must be possible to determine whether the correct portions of the message have been signed and encrypted with the correct keys according to policy.
To the extent possible allowed by the ordering of data and cryptographic operations it should be possible for a sender or a receiver to perform processing in a single pass over the message.
Several open specifications make use of derived keys, e.g. RSA Laboratories' PKCS #5 v2.0 [PKCS#5] and OASIS' WS-SecureConversation Version 1.3 [WS-SecureConversation13]. These derived keys are used for a variety of purposes including encryption and message authentication, and the purpose of key derivation itself is typically a combination of a desire to expand a given, but limited, set of key material and prudent security practices of limiting use (exposure) of such key material.
Contrary to the situation in the ASN.1-based world (e.g. S/MIME [S/MIME]), there is currently a lack of general support in the core XML Security specifications, XML Signature and XML Encryption, for derived keys. Amendment 1 of the aforementioned PKCS #5 v2.0 Amendment 1 [PKCS#5] adds support for derived keys only in the context of password-based cryptography. Other XML-based open specifications have similar limitations (see below). This means that an originator of an XML document or message cannot generally make use of key derivation in a standardized manner when performing cryptographic operations on that document.
This specification [WSS-Username11] describes a key derivation technique for passwords using salt and iteration count (PKCS #5 PBKDF1). It does not allow use of PBKDF2, which is the recommended method to derive keys from passwords in PKCS #5 v2.0. Initial key material cannot be referenced other than with wsu:Id. The key length will always be 160 bits.
Ws-Trust Version 1.3 [WS-Trust13] describes key derivation through a combination of entropies from both parties. The key is never sent on the wire. The key is never referenced directly (but further key material is derived from it). WS-Trust provides one specific method to derive keys which builds on the P_hash (P_SHA-1) function from TLS.
WS-SecurityPolicy Version 1.2 [WS-SecurityPolicy12] really only specifies whether derived keys shall be used or not but may also specify the algorithm to derive keys. The specification also identifies when derived key tokens shall appear in message headers (header layout). WS-SecurityPolicy relies on WS-SecureConversation for the definition of derived keys, key derivation methods and derived key token format.
This specification [WS-SecureConversation13] defines
the wsc:DerivedKeyTokenType token type. The derived key
token can be used to derive keys from any other token
that contains keys. The key derivation algorithm
specified builds on the P_hash (P_SHA-1) function from
TLS, just as the algorithm in the Web Service Security
UsernameToken Profile document. Citing from the
specification: "The
<wsc:DerivedKeyToken> element is
used to indicate that the key for a specific reference
is generated from the function. This is so that
explicit security tokens, secrets, or key material need
not be exchanged as often." (This latter seems dubious
since the DerivedKeyToken still needs to be exchanged.)
Further: "Basically, a signature or encryption
references a <wsc:DerivedKeyToken>
in the <wsse:Security> header that,
in turn, references the
<wsc:SecurityContextToken>." The
derived key token does not support references using key
identifiers or key names. All references MUST use an ID
(to a wsu:Id attribute) or a URI reference to the
<wsc:Identifier> element in the
Security Context Token.
A derived key type shall be possible to use in those situations where existing specifications make use of ad-hoc derived keys or needs a derived key type
The motivation for this requirement is that any XML Security definition shall be generic enough that there shall be no need to continue with "point" solutions for derived keys; i.e. it shall cover existing and foreseeable uses.
A derived key type shall enable the simple use of derived keys with XML Signature or XML Encryption -using applications, and shall not require import of non-W3C developed specifications with complex security tokens.
The motivation for this is that basic use of XML Signature or XML Encryption should not require use of externally defined security tokens or other security specification elements.
An XML Security derived key type shall allow for existing methods to derive keys; i.e. it shall be possible to use already specified key derivation methods with the new derived key type.
This requirement is based on the assumptions that implementations may want to continue with already chosen key derivation schemes.
A derived key type shall allow for arbitrary derived key lengths.
A derived key type shall allow for referencing using any referencing method in use today for other key types used in XMLDsig or XMLEnc.
A derived key type shall allow for forward referencing with reference lists as recommended by WS-I BSP [WS-I-BSP10].
Evaluating the existing specifications against the requirements gives the following result:
UsernameToken Profile:
R1: Not met (method specified in UsernameToken profile is ad-hoc for UsernameToken specifically)
R2: Not met (method requires use of UsernameToken profile)
R3: Not met (UsernameToken profile mandates use of specified mechanism)
R4: Not met (Only accept length of 160 bits)
R5: Not met (No referencing with KeyName or
KeyIdentifier and no
<referenceList> element)
WS-Trust:
R1: N/A (WS-Trust does not define a derived key type per se; only a method to derive keys)
R2: N/A
R3: Meets (Through use of URI to identify method and extensibility)
R4: Meets
R5: Meets (Choice of STS on how to identify key)
WS-SecurityPolicy:
R1: N/A (WS-SecurityPolicy does not define a derived key type)
R2: N/A
R3: Meets (Through the use of URIs to identify key derivation methods and schema extensibility)
R4: Meets
R5: N/A
WS-SecureConversation:
R1: Meets
R2: Does not meet.
R3: Meets (may use the
<Properties> element to carry
parameters for other key derivation methods.
R4: Meets
R5: Does not meet as referencing can only be done
to a
<wsse:SecurityTokenReference>
In this design option, the new DerivedKeyType is modeled after the xenc:EncryptedKeyType. A *possible* outline of such a type could be:
<element name="DerivedKey" type="xmlsec:DerivedKeyType"/>
<complexType name="DerivedKeyType">
<sequence>
<element name="KeyDerivationMethod" type="xmlsec:KeyDerivationMethodType" minOccurs="0"/>
<element ref="xenc:ReferenceList" minOccurs="0"/>
<element name="CarriedKeyName" type="string" minOccurs="0"/>
</sequence>
<attribute name="Id" type="ID" use="optional"/>
<attribute name="Type" type="anyURI" use="optional"/>
</complexType>
<complexType name="KeyDerivationMethodType">
<sequence>
<any namespace="##other" minOccurs="0" maxOccurs="unbounded"/>
</sequence>
<attribute name="Algorithm" type="anyURI" use="required"/>
</complexType>
The proposal immediately meets requirements R2, R3 (any key derivation method may be used, including the ones specified, e.g., in WS-SecureConversation), R4 and R5. For R1 we have:
Username Token Profile: As the UsernameToken Profile
requires use of an existing procedure to derive keys,
the proposal cannot meet formally meet requirement R1.
However, since the UsernameTokenType is extensible,
syntactically the requirement can be met since a
<ds:DerivedKey> element could be
placed in lieu of the current <salt>
and <iteration> elements.
WS-Trust: Use of derived keys in WS-Trust is
_implicit_, since the derived key is never sent. The
derived keys may be referenced by any available means
in issued tokens and the requestor is only required to
identify particular key derivation methods. Since URIs
are used for this (the
<wst:ComputedKey> element), any
other key derivation method with a well-known URI may
be used. Specifically, one can also envision an STS
returning a proof token containing a
<DerivedKey> element when there
already is a shared key between the STS and a token
requestor. And so, R1 is met.
WS-SecurityPolicy: Not affected by a new key type. R1 is met.
WS-SecureConversation: Use of derived keys in
WS-SecureConversation is typically based on the
establishment of a session context, from which specific
keys are derived. The proposed
<xmlsec:DerivedKeyType> type may be
used in a similar fashion, although the interactive
nature of WS-SecureConversation (exchange of Nonces,
Labels) may still favor use of the existing
DerivedKeyToken in this context. But as a
counterexample, a party that wishes to send data
authenticated with a key derived from a key established
in the session, may do so using the
<xmlsec:DerivedKey> element in the
<ds:KeyInfo> element, and the
element may refer to a SecurityContextToken that
identifies the base key. This would, it seems,
eliminate an absolute need for a
<wsc:DerivedKeyToken> (and should be
similar in nature as the "Implied Derived Key" option
in WS-SecureConversation). Also, the
<wsc:DerivedKeyToken> implies use of
a particular key derivation algorithm (the
<Label> and
<Nonce> elements) although it does
not require them.
In summary, WS-Trust and WS-SecurityPolicy are not directly affected by this proposal. UsernameToken profile could use the proposal if the (artificial) requirement to only use the key derivation method specified in the UsernameToken Profile document was relaxed. WS-SecureConversation comes close in establishing an alternative but the specification defines a token primarily for use in interactive sessions based on a security context and which is designed for a particular key derivation method. It also seems strange to require use of such a token in more basic XMLDsig or XMLEnc situations. Finally, the proposal seems to be able to replace the DerivedKeyToken currently used in WS-SecureConversation.
Usage scenarios, requirements, issues and design related to XML Signature transform processing are discussed in a separate document [TransformSimplification]. Those requirements should be considered in conjunction with those in this document.
XML Signature specifies algorithm identifiers and implementation requirements for algorithms related to various aspects of signature processing, including digest and signature algorithms. The algorithms listed in XML Signature, Second Edition date from the original XML Signature Recommendation, published in 2002. Since that time there have been new algorithms introduced to address security risks associated with earlier algorithms (e.g. SHA-256 versus SHA-1), changes in patent status related to algorithms (e.g. RSA signing no longer has licensing requirements), and additional algorithms introduced to meet additional requirements (Suite B algorithms [SuiteB]).
In order to meet the principle of "Secure" and "Pragmatic", new algorithm requirements should be met.
In order to address concerns related to potential risks associated with SHA-1, the following algorithm requirements that update the SHA algorithm should be met in XML Signature:
Digest:
SHA256 be required.
SHA384 and SHA512 optional.
Mac:
HMAC-SHA256 recommended.
HMAC-SHA384 and HMAC-SHA512 optional.
Signature:
RSAwithSHA256 required.
RSAwithSHA384, RSAwithSHA512 optional.
In order to discourage the use of DSAwithSHA1 but to continue to enable interoperability, the following algorithm changes are requirements;
Signature:
Continue to require DSAwithSHA1 for signature verification, but change DSAwithSHA1 to optional (from required) for signature generation.
In order to enable use of XML Signature technology in interoperable US government applications that require Suite B, and to enable long term security for commercial companies, elliptic curve algorithms are to be added to XML Signature. As new hardware is developed and new algorithms to break cryto systems are found, the stronger algorithms offered by elliptic curve enable longer term security.
The additional algorithm requirements are as follows:
Signature:
Require ECDSAwithSHA256.
ECDSAwithSHA1, ECDSAwithSHA384, ECDSAwithSHA512 optional.
Define ECKeyValue element to enable interoperable exchange of EC public key values in XML Signature context.
Provide profile guidance for use of RFC 4050 [RFC4050] when it continues to be used in XML Signature context but indicate preference for mechanism defined in XML Signature.
The last two requirements are discussed in more detail in the following design section.
RFC 4050 is an informational RFC that defines a method of representing ECDSA public keys and ECC curve parameters for use with XML Signature, but it has some issues related to XML Signature:
The RFC 4050 definition of an ECDSAKeyValue is larger than necessary.
An ECDSAKeyValue is defined by the type ECPointType, which has subelements X and Y. X and Y are defined as FieldParamsType which is an abstract type. Separate derived types are defined for prime fields, trinomial base fields, pentanomial base fields, and odd characteristic extension fields. In order to validate against the 4050 schema, one must include the type attribute from the XML schema instance namespace. This is not a significant problem but it does make the public key larger than necessary.
ECPointType definition is inconsistent with ANSI X9.62 and RFC 3279.
ECPointType is reused in the definition of the ExplicitParamsType to describe the base point of a curve. The field parameters are already included in the FieldParams element. The use of the FieldParamsType in the ECPointType definition appears to be a mistake in 4050. If you look at the ASN.1 definition for ECC public keys in RFC 3279 [RFC3279], ECPoint simply references the Point to Octet String conversion function in ANSI X9.62 (section A.5.6 in the 2005 version, section 4.3.6 in the 1998 version). The conversion functions in X9.62 are not ASN.1 specific and it appears they would be implemented as part of any ECC crypto library. It appears that RFC 4050 tried to avoid using any of the conversion functions in X9.62 but somehow mixed up the definitions between a field type and a field element.
Limitation of the decimal type in XSD
RFC 4050 defines X and Y (at least for prime and odd characteristic extension fields) as xs:nonNegativeInteger which derives from the xs:decimal primitive type. However, XSD requires implementations to support only a maximum of 18 digits (see section 3.2.3 in [XSD]). It is possible to create an example requiring 77 and 78 digits for X and Y respectively. This means that there is no guarantee that an RFC 4050 compliant ECDSAKeyValue element will actually validate against the RFC 4050 schema.
Collision between the RFC 4050 DTD and the XMLDSIG DTD
Merging the RFC 4050 DTD into the XMLDSIG DTD is a problem due to conflicting DTD definitions. In ECDSAKeyValue, Y is defined as follows:
However, DSAKeyValue defines Y as follows:
ECDSAKeyValue also contains identical definition for elements SEED and P as DSAKeyValue.
It does not seem possible to scope the definition of Y under a specific element in DTD.
Because of these issues, the proposed solution is for XML Signature 1.1 to define a new ECPublicKey element in the ds namespace rather than attempt to reuse the RFC 4050 ECDSAPublicKey elements. This new element will be based on the ASN.1 definition ANSI X9.62 and RFC 3279. Changing the name of the element to ECPublicKey means it can be also used in XML Encryption to support ECDH.
To maximize interoperability with existing RFC 4050 implementations, we should also put a note in 1.1 to recommend implementations to support a profile of RFC 4050. The profile will support only named prime curves.
@@ TBD @@