TOC |
|
This Internet-Draft is submitted to IETF in full conformance with the provisions of BCP 78 and BCP 79.
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.
This Internet-Draft will expire on February 8, 2010.
Copyright (c) 2009 IETF Trust and the persons identified as the document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents in effect on the date of publication of this document (http://trustee.ietf.org/license-info). Please review these documents carefully, as they describe your rights and restrictions with respect to this document.
The use of right-to-left scripts in internationalized domain names has presented several challenges. This memo discusses some problems with these scripts, and some shortcomings in the 2003 IDNA BIDI criterion. Based on this discussion, it proposes a new BIDI rule for IDNA labels.
1.
Introduction
1.1.
Purpose and applicability
1.2.
Background and history
1.3.
Layout of the rest of this document
1.4.
Terminology
2.
A replacement for the RFC 3454 BIDI rule
3.
A requirement set for the BIDI rule
4.
Examples of issues found
4.1.
Dhivehi
4.2.
Yiddish
4.3.
Strings with numbers
5.
Troublesome situations and guidelines
6.
Other issues in need of resolution
7.
Compatibility considerations
7.1.
Backwards compatibility considerations
7.2.
Forward compatibility considerations
8.
IANA Considerations
9.
Security Considerations
10.
Acknowledgements
11.
References
11.1.
Normative references
11.2.
Informative references
Appendix A.
Change log
A.1.
Changes from draft-alvestrand-00 to -01
A.2.
Changes from alvestrand-01 to -02
A.3.
Changes from alvestrand-02 to -03
A.4.
Changes from alvestrand-03 to -04
A.5.
Changes from draft-alvestrand-04 to draft-ietf -00
A.6.
Changes from idnabis -00 to -01
A.7.
Changes from idnabis -01 to -02
A.8.
Changes from idnabis -02 to -03
A.9.
Changes from idnabis -03 to -04
§
Authors' Addresses
TOC |
TOC |
The purpose of this document is to establish a rule that can be applied to Internationalized Domain Name (IDN) labels in Unicode form (U-labels) containing characters from scripts that are written from right to left.
When labels satisfy the rule, and when certain other conditions are satisfied, they can be used with a minimal chance of these labels being displayed in a confusing way by a bidirectional display algorithm.
This specification is not intended to place any requirements on domain names that do not contain right-to-left characters.
TOC |
The IDNA specification "Stringprep" [RFC3454] (Hoffman, P. and M. Blanchet, “Preparation of Internationalized Strings ("stringprep"),” December 2002.) makes the following statement in its section 6 on the BIDI algorithm:
3) If a string contains any RandALCat character, a RandALCat character MUST be the first character of the string, and a RandALCat character MUST be the last character of the string.
(A RandALCat character is a character with unambiguously right-to-left directionality.)
The reasoning behind this prohibition was to ensure that every component of a displayed domain name has an unambiguously preferred direction. However, this makes certain words in languages written with right-to-left scripts invalid as IDN labels, and in at least one case means that all the words of an entire language are forbidden as IDN labels.
This is illustrated below with examples taken from the Dhivehi and Yiddish languages, as written with the Thaana and Hebrew scripts, respectively.
In investigating this problem, it was realized that the RFC 3454 specification did not explicitly state the requirement to be fulfilled, and therefore, it was impossible to tell whether a simple relaxation of the rule would continue to fulfil the requirement. A further investigation led to the conclusion that there was one reasonable set of requirements that IDNA2003's BIDI restriction did not fulfil. This document therefore proposes replacing the RFC 3454 BIDI requirement in its entirety.
While the document proposes completely new text, most reasonable labels that were allowed under the old criterion will also be allowed under the new criterion, so the operational impact of the rule change is limited.
TOC |
Section 2 (A replacement for the RFC 3454 BIDI rule) defines a test, the "BIDI test", that can be used on a domain name label (no matter what the direction of the label is) to check how safe it is to use in a domain name of possibly mixed directionality. One user of that test is the IDNA2008 protocol[I‑D.ietf‑idnabis‑protocol] (Klensin, J., “Internationalized Domain Names in Applications (IDNA): Protocol,” November 2008.).
Section 3 (A requirement set for the BIDI rule) sets out the requirements for defining a BIDI rule.
Section 4 (Examples of issues found) gives detailed examples that serve as justification for the change proposed here.
Section 5 (Troublesome situations and guidelines) to Section 9 (Security Considerations) describe various situations that can occur when dealing with domain names with characters of different directionality.
Only Section 1.4 (Terminology) and Section 2 (A replacement for the RFC 3454 BIDI rule) are normative.
TOC |
In this memo, we use "network order" to describe the sequence of characters as transmitted on the wire or stored in a file; the terms "first", "next", "previous", "before" and "after" are used to refer to the relationship of characters and labels in network order.
We use "display order" to talk about the sequence of characters as imaged on a display medium; the terms "left" and "right" are used to refer to the relationship of characters and labels in display order.
Most of the time, the examples use the abbreviations for the Unicode BIDI classes to denote the directionality of the characters; the example string CS L consists of one character of class CS and one character of class L. In some examples, the convention that uppercase characters are of class R or AL, and lowercase characters are of class L is used - thus, the example string ABC.abc would consist of 3 right-to-left characters and 3 left-to-right characters,
The directionality of such examples is determined by context - for instance, in the sentence "ABC.abc is displayed as CBA.abc", the first example string is in network order, the second example string is in display order.
The term "paragraph" is used in the sense of the Unicode BIDI specification [UAX9] (Davis, M., “Unicode Standard Annex #9: The Bidirectional Algorithm, revision 15,” 03 2005.) - it means "a block of text that has an overall direction, either left-to-right or right-to-left", approximately; see UAX 9 for the details.
"LTR" and "RTL" are abbreviations for "right to left" and "left to right", respectively.
An RTL label is a label that contains at least one character of type R or AL.
An LTR label is any label that is not an RTL label.
A "Bidi domain name" is a domain name that contains at least one RTL label.
The terminology used for the BIDI properties of Unicode characters is taken from the Unicode Standard[Unicode] (Unicode, “The Unicode Standard - version 5.1,” 2008.)
For reference, here are the values that the Unicode BIDI property can have:
The other terminology used to describe IDNA concepts is defined in [I‑D.ietf‑idnabis‑defs] (Klensin, J., “Internationalized Domain Names for Applications (IDNA): Definitions and Document Framework,” November 2008.)
TOC |
The following test has been developed for labels in BIDI domain names. The requirements that this test satisifies are described in Section 3 (A requirement set for the BIDI rule).
The following guarantees can be made based on the above:
No guarantee is given for other combinations.
TOC |
One issue with RFC 3454 was that it did not give an explicit justification for the BIDI rule, thus it was hard to tell if a modified rule would continue to fulfil the purpose for which the RFC 3454 rule was written.
This document proposes an explicit justification, by stating a set of requirements for which it is possible to test whether or not the modified rule fulfils the requirement.
All the text in this document assumes that text containing the labels under consideration will be displayed using the Unicode bidirectional algorithm [UAX9] (Davis, M., “Unicode Standard Annex #9: The Bidirectional Algorithm, revision 15,” 03 2005.).
The requirements proposed are these:
Several stronger statements were considered and rejected, because they seem to be impossible to fulfil within the constraints of the Unicode bidirectional algorithm. These include:
One specific requirement was thought to be problematic, but turned out to be satisfied by a string that obeys the proposed rules:
In the following descriptions, first-level bullets are used to indicate rules or normative statements; second-level bullets are commentary.
The Character Grouping requirement can be more formally stated as:
A label X satisfies the Character Grouping requirement when, for any Delimiter Character D1 and D2, and for any label S1 and S2 that is an unproblematic label or an empty string, the following holds true:
If the string formed by concatenating S1, D1, X, D2 and S2 is reordered according to the BIDI algorithm, then all the characters of X in the reordered string are between D1 and D2, and no other characters are between D1 and D2, both if the overall paragraph direction is LTR and if the overall paragraph direction is RTL.
Note that the definition is self-referential, since S1 and S2 are constrained to be "legal" by this definition; this makes testing changes to proposed rules a little complex, but does not create problems for testing whether or not a given proposed rule satisfies the criterion.
The "zero-length" case represents the case where a domain name is next to something that isn't a domain name, separated by a delimiter character.
The Label Uniqueness requirement can be formally stated as:
If two non-identical labels X and Y, embedded as for the test above, displayed in paragraphs with the same directionality, are reordered by the BIDI algorithm into the same sequence of codepoints, at most one of the labels X and Y is a legal label.
TOC |
TOC |
Dhivehi, the official language of the Maldives, is written with the Thaana script. This displays some of the characteristics of Arabic script, including its directional properties, and the indication of vowels by the diacritical marking of consonantal base characters. This marking is obligatory, and both double vowels and syllable-final consonants are indicated by the marking of special unvoiced characters. Every Dhivehi word therefore ends with a combining mark.
The word for "computer", which is romanized as "konpeetaru", is written with the following sequence of Unicode code points:
U+0786 THAANA LETTER KAAFU (AL)
U+07AE THAANA OBOFILI (NSM)
U+0782 THAANA LETTER NOONU (AL)
U+07B0 THAANA SUKUN (NSM)
U+0795 THAANA LETTER PAVIYANI (AL)
U+07A9 THAANA LETTER EEBEEFILI (AL)
U+0793 THAANA LETTER TAVIYANI (AL)
U+07A6 THAANA ABAFILI (NSM)
U+0783 THAANA LETTER RAA (AL)
U+07AA THAANA UBIUFILI (NSM)
The directionality class of U+07AA in the Unicode database [Unicode] (Unicode, “The Unicode Standard - version 5.1,” 2008.) is NSM (non-spacing mark), which is not R or AL; a conformant implementation of the IDNA2003 algorithm will say that "this is not in RandALCat", and refuse to encode the string.
TOC |
Yiddish is one of several languages written with the Hebrew script (others include Hebrew and Ladino). This is basically a consonantal alphabet (also termed an "abjad") but Yiddish is written using an extended form that is fully vocalic. The vowels are indicated in several ways, of which one is by repurposing letters that are consonants in Hebrew. Other letters are used both as vowels and consonants, with combining marks, called "points", used to differentiate between them. Finally, some base characters can indicate several different vowels, which are also disambiguated by combining marks. Pointed characters can appear in word-final position and may therefore also be needed at the end of labels. This is not an invariable attribute of a Yiddish string and there is thus greater latitude here than there is with Dhivehi.
The organization now known as the "YIVO Institute for Jewish Research" developed orthographic rules for modern Standard Yiddish during the 1930s on the basis of work conducted in several venues since earlier in that century. These are given in, "The Standardized Yiddish Orthography: Rules of Yiddish Spelling" [SYO] (, “The Standardized Yiddish Orthography: Rules of Yiddish Spelling, 6th ed., , New York, ISBN 0-914512-25-0",,” 1999.), and are taken as normatively descriptive of modern Standard Yiddish in any context where that notion is deemed relevant. They have been applied exclusively in all formal Yiddish dictionaries published since their establishment, and are similarly dominant in academic and bibliographic regards.
It therefore appears appropriate for this repertoire also to be supported fully by IDNA. This presents no difficulty with characters in initial and medial positions, but pointed characters are regularly used in final position as well. All of the characters in the SYO repertoire appear in both marked and unmarked form with one exception: the HEBREW LETTER PE (U+05E4). The SYO only permits this with a HEBREW POINT DAGESH (U+05BC), providing the Yiddish equivalent to the Latin letter "p", or a HEBREW POINT RAFE (U+05BF), equivalent to the Latin letter "f". There is, however, a separate unpointed allograph, the HEBREW LETTER FINAL PE (U+05E3), for the latter character when it appears in final position. The constraint on the use of the SYO repertoire resulting from the proscription of combining marks at the end of RTL strings thus reduces to nothing more, or less, than the equivalent of saying that a string of Latin characters cannot end with the letter "p". It must also be noted that the HEBREW LETTER PE with HEBREW POINT DAGESH is characteristic of almost all traditional Yiddish orthographies that predate (or remain in use in parallel to) the SYO, being the first pointed character to appear in any of them.
A more general instantiation of the basic problem can be seen in the representation of the YIVO acronym. This is written with the Hebrew letters YOD YOD HIRIQ VAV VAV ALEF QAMATS, where HIRIQ and QAMATS are combining points:
U+05D9 HEBREW LETTER YOD (R)
U+05B4 HEBREW POINT HIRIQ (NSM)
U+05D5 HEBREW LETTER VAV (R)
U+05D0 HEBREW LETTER ALEF (R)
U+05B8 HEBREW POINT QAMATS (NSM)
The directionality class of U+05B8 HEBREW POINT QAMATS in the Unicode database is NSM, which again causes the IDNA2003 algorithm to reject the string.
It may also be noted that all of the combined characters mentioned above exist in precomposed form at separate positions in the Unicode chart. However, by invoking Stringprep, the IDNA2003 algorithm also rejects those codepoints, for reasons not discussed here.
TOC |
By requiring that the first or last character of a string be category R or AL, RFC 3454 prohibited a string containing right-to-left characters from ending with a number.
Consider the strings ALEF 5 (HEBREW LETTER ALEF + DIGIT FIVE) and 5 ALEF. Displayed in an LTR context, the first one will be displayed from left to right as 5 ALEF (with the 5 being considered right-to-left because of the leading ALEF), while 5 ALEF will be displayed in exactly the same order (5 taking the direction from context). Clearly, only one of those should be permitted as a registered label, but barring them both seems to require justification.
TOC |
There are situations in which labels that satisfy the rule above will be displayed in a surprising fashion. The most important of these is the case where a label ending in a character with BIDI property AL, AN or R occurs before a label beginning with a character of BIDI property EN. In that case, the number will appear to move into the label containing the right-to-left character, violating the Character Grouping requirement.
If the label that occurs after the right-to-left label itself satisfies the BIDI criterion, the requirements will be satisfied in all cases (this is the reason why the criterion talks about strings containing L in some cases). However, the WG concluded that this could not be required for several reasons:
So rather than trying to suggest rules that disallow all such undesirable situations, this document merely warns about the possibility.
TOC |
This document concerns itself only with the rules that are needed when dealing with domain names with characters that have differing BIDI properties, and considers characters only in terms of their BIDI properties. All other issues with these scripts have to be considered in other contexts.
One such issue is the need to keep numbers separate; several scripts, are used with multiple sets of numbers - most commonly they use Latin numbers and a script-specific set of numbers, but in the case of Arabic, there are 2 sets of "Arabic-Indic" digits involved.
The algorithm in this document disallows occurrences of AN-class characters ("Arabic-Indic digits", U+0660 to U+0669) together with EN-class characters (which includes "European" digits, U+0030 to U+0039 and "extended Arabic-Indic digits", U+06F0 to U+06F9), but does not help in preventing the mixing of, for instance, Bengali digits (U+09E6 to U+09EF) and Gujarati digits (U+0AE6 to U+0AEF), both of which have BIDI class L. A registry or script community that wishes to create rules for the mixing of digits in a label will be able to specify these restrictions at the registry level. Rules can also be specified at the protocol level, but while the example above involves right-to-left characters, this is not inherently a BIDI problem.
Another set of issues concerns the proper display of IDNs with a mixture of LTR and RTL labels, or only RTL labels.
It is unrealistic to expect that applications will display domain names using embedded formatting codes between their labels (for one thing, no reliable algorithms for identifying domain names in running text exist); thus, the display order will be determined by the bidirectional algorithm. Thus, a sequence (in network order) of R1.R2.ltr will be displayed in the order 2R.1R.ltr in an LTR context, which might surprise someone expecting to see labels displayed in hierarchical order. Again, this memo does not attempt to suggest a solution to this problem.
TOC |
TOC |
As with any change to an existing standard, it is important to consider what happens with existing implementations when the change is introduced. The following troublesome cases have been noted:
One particular example of the last case is if a program chooses to examine the last character (in network order) of a string in order to determine its directionality, rather than its first. If it finds an NSM character and tries to display the string as if it was a left-to-right string, the resulting display may be interesting, but not useful.
The editors believe that these cases will have less harmful impact in practice than continuing to deny the use of words from the languages for which these strings are necessary as IDN labels.
This specification does not forbid using leading European numbers in ASCII-only labels, since this would in conflict with a large installed base of such labels, and would increase the scope of the specification from RTL labels to all labels. The harm resulting from this limitation of scope is described in Section 5 (Troublesome situations and guidelines). Registries and private zone managers can check for this particular condition before they allow registration of any string with right-to-left characters in it. Generally it is best to not allow registration of any right-to-left strings in a zone where the label at the level above begins with a digit.
TOC |
This text is, intentionally, specified strictly in terms of the Unicode BIDI properties. The determination that the condition is sufficient to fulfil the criteria depends on the Unicode BIDI algorithm; it is unlikely that drastic changes will be made to this algorithm.
However, the determination of validity for any string depends on the Unicode BIDI property values, which are not declared immutable by the Unicode Consortium. Furthermore, the behaviour of the algorithm for any given character is likely to be linguistically and culturally sensitive, so that it is not unlikely that later versions of the Unicode standard may change the BIDI properties assigned to certain Unicode characters.
This memo does not propose a solution for this problem.
TOC |
This document makes no request of IANA.
Note to RFC Editor: this section may be removed on publication as an RFC.
TOC |
This modification will allow some strings to be used in IDNA contexts that are not allowed today. It is possible that differences in the interpretation of the specification between old and new implementations could pose a security risk, but it is difficult to envision any specific instantiation of this.
Any rational attempt to compute, for instance, a hash over an identifier processed by IDNA would use network order for its computation, and thus be unaffected by the changes proposed here.
While it is not believed to pose a problem, if display routines had been written with specific knowledge of the RFC 3454 IDNA prohibitions, it is possible that the potential problems noted under "backwards compatibility" could cause new kinds of confusion.
TOC |
While the listed editors held the pen, this document represents the joint work and conclusions of an ad hoc design team. In addition to the editors this consisted of, in alphabetic order, Tina Dam, Patrik Faltstrom, and John Klensin. Many further specific contributions and helpful comments were received from the people listed below, and others who have contributed to the development and use of the IDNA protocols.
The particular formulation of the Bidi rule in section 2 was suggested by Matitahu Allouche.
The team wishes in particular to thank Roozbeh Pournader for calling its attention to the issue with the Thaana script, Paul Hoffmann for pointing out the need to be explicit about backwards compatibility considerations, Ken Whistler for suggesting the basis of the formalized "character grouping" requirement, Mark Davis for commentary, Erik van der Poel for careful review, comments and verification of the rulesets, and Marcos Sanz, Andrew Sullivan and Pete Resnick for reviews.
TOC |
TOC |
[I-D.ietf-idnabis-defs] | Klensin, J., “Internationalized Domain Names for Applications (IDNA): Definitions and Document Framework,” draft-ietf-idnabis-defs-01 (work in progress), November 2008 (TXT). |
[UAX9] | Davis, M., “Unicode Standard Annex #9: The Bidirectional Algorithm, revision 15,” 03 2005. |
[Unicode] | Unicode, “The Unicode Standard - version 5.1,” 2008. |
TOC |
[I-D.ietf-idnabis-protocol] | Klensin, J., “Internationalized Domain Names in Applications (IDNA): Protocol,” draft-ietf-idnabis-protocol-06 (work in progress), November 2008 (TXT). |
[RFC2672] | Crawford, M., “Non-Terminal DNS Name Redirection,” RFC 2672, August 1999 (TXT). |
[RFC3454] | Hoffman, P. and M. Blanchet, “Preparation of Internationalized Strings ("stringprep"),” RFC 3454, December 2002 (TXT). |
[SYO] | “The Standardized Yiddish Orthography: Rules of Yiddish Spelling, 6th ed., , New York, ISBN 0-914512-25-0",,” 1999. |
TOC |
This appendix is intended to be removed by the RFC Editor when this document is published as an RFC.
TOC |
Suggested a possible new algorithm.
Multiple smaller changes.
TOC |
Date of publication updated.
Change log added.
TOC |
Intro changed to reflect addressing the deeper issues with the BIDI algorithm.
Gave formalized criteria for "valid strings", and documented the new set of requirements for strings that satisfy the criteria.
Removed most of section 5, "Other problems", and noted that this memo focuses ONLY on issues that can be evaluated by looking at the BIDI properties of characters.
TOC |
Added back AN to the list of allowed characters; it had been left out by accident in -03.
Removed some rules that were redundant.
Added some considerations for backwards compatibility and interaction with ASCII labels that start with a number.
Mentioned the issue with DNAME pointing to a zone containing RTL labels in the security considerations section.
Wording updates in multiple places, including some spelling errors.
Rewrote the introduction section.
Split references into "normative" and "informative".
TOC |
Changed name of draft.
Added a couple of "note in draft" statements to remind the WG of open issues.
Noted that BIDI controls in the paragraph are unproblematic with the given ruleset.
TOC |
Added text to section 5 describing issues with mixture of numbers in labels
Addressed some of the issues raised by Mark Davis in March 2008 in regard to document clarity.
Changed the formulation of the label uniqueness requirement to be consistent with the text under "Labels with numbers".
Spell-checked document.
TOC |
Changed the domain of applicability to be only labels containing RTL characters, described the conditions under which harm may result from putting RTL labels next to other labels, and how to detect them.
A number of clarification and formatting changes in response to reviews.
TOC |
Rearranged section list so that the normative material is collected at the front.
Moved list of BIDI properties into "terminology"
Clarified that only terminology and the BIDI test is normative
Changed reference to point to -defs for definitions instead of -rationale
Minor fixes in response to comments, wording cleanups, removed all tentative language.
TOC |
Updated to new IPR rules.
Minor textual clarifications.
Replaced the bidi test with a version suggested by Matitahu Allouche - this description is simpler to understand than the one in -03, and generates a larger set of allowable strings, while all tests indicate that they still pass all the criteria.
TOC |
Harald Tveit Alvestrand (editor) | |
Beddingen 10 | |
Trondheim, 7014 | |
Norway | |
Email: | harald@alvestrand.no |
Cary Karp | |
Swedish Museum of Natural History | |
Frescativ. 40 | |
Stockholm, 10405 | |
Sweden | |
Phone: | +46 8 5195 4055 |
Fax: | |
Email: | ck@nrm.museum |
URI: |