2 /* Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL
5 /* ====================================================================
6 * Copyright (c) 2003 The OpenSSL Project. All rights reserved.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in
17 * the documentation and/or other materials provided with the
20 * 3. All advertising materials mentioning features or use of this
21 * software must display the following acknowledgment:
22 * "This product includes software developed by the OpenSSL Project
23 * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
25 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
26 * endorse or promote products derived from this software without
27 * prior written permission. For written permission, please contact
28 * licensing@OpenSSL.org.
30 * 5. Products derived from this software may not be called "OpenSSL"
31 * nor may "OpenSSL" appear in their names without prior written
32 * permission of the OpenSSL Project.
34 * 6. Redistributions of any form whatsoever must retain the following
36 * "This product includes software developed by the OpenSSL Project
37 * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
39 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
40 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
41 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
42 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
43 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
44 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
45 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
46 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
48 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
49 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
50 * OF THE POSSIBILITY OF SUCH DAMAGE.
51 * ====================================================================
53 * This product includes cryptographic software written by Eric Young
54 * (eay@cryptsoft.com). This product includes software written by Tim
55 * Hudson (tjh@cryptsoft.com).
62 #include <openssl/asn1t.h>
63 #include <openssl/conf.h>
64 #include <openssl/x509v3.h>
66 static void *v2i_NAME_CONSTRAINTS(const X509V3_EXT_METHOD *method,
67 X509V3_CTX *ctx, STACK_OF(CONF_VALUE) *nval);
68 static int i2r_NAME_CONSTRAINTS(const X509V3_EXT_METHOD *method,
69 void *a, BIO *bp, int ind);
70 static int do_i2r_name_constraints(const X509V3_EXT_METHOD *method,
71 STACK_OF(GENERAL_SUBTREE) *trees,
72 BIO *bp, int ind, char *name);
73 static int print_nc_ipadd(BIO *bp, ASN1_OCTET_STRING *ip);
75 static int nc_match(GENERAL_NAME *gen, NAME_CONSTRAINTS *nc);
76 static int nc_match_single(GENERAL_NAME *sub, GENERAL_NAME *gen);
77 static int nc_dn(X509_NAME *sub, X509_NAME *nm);
78 static int nc_dns(ASN1_IA5STRING *sub, ASN1_IA5STRING *dns);
79 static int nc_email(ASN1_IA5STRING *sub, ASN1_IA5STRING *eml);
80 static int nc_uri(ASN1_IA5STRING *uri, ASN1_IA5STRING *base);
82 const X509V3_EXT_METHOD v3_name_constraints = {
83 NID_name_constraints, 0,
84 ASN1_ITEM_ref(NAME_CONSTRAINTS),
87 0, v2i_NAME_CONSTRAINTS,
88 i2r_NAME_CONSTRAINTS,0,
92 ASN1_SEQUENCE(GENERAL_SUBTREE) = {
93 ASN1_SIMPLE(GENERAL_SUBTREE, base, GENERAL_NAME),
94 ASN1_IMP_OPT(GENERAL_SUBTREE, minimum, ASN1_INTEGER, 0),
95 ASN1_IMP_OPT(GENERAL_SUBTREE, maximum, ASN1_INTEGER, 1)
96 } ASN1_SEQUENCE_END(GENERAL_SUBTREE)
98 ASN1_SEQUENCE(NAME_CONSTRAINTS) = {
99 ASN1_IMP_SEQUENCE_OF_OPT(NAME_CONSTRAINTS, permittedSubtrees,
101 ASN1_IMP_SEQUENCE_OF_OPT(NAME_CONSTRAINTS, excludedSubtrees,
103 } ASN1_SEQUENCE_END(NAME_CONSTRAINTS)
106 IMPLEMENT_ASN1_ALLOC_FUNCTIONS(GENERAL_SUBTREE)
107 IMPLEMENT_ASN1_ALLOC_FUNCTIONS(NAME_CONSTRAINTS)
109 static void *v2i_NAME_CONSTRAINTS(const X509V3_EXT_METHOD *method,
110 X509V3_CTX *ctx, STACK_OF(CONF_VALUE) *nval)
113 CONF_VALUE tval, *val;
114 STACK_OF(GENERAL_SUBTREE) **ptree = NULL;
115 NAME_CONSTRAINTS *ncons = NULL;
116 GENERAL_SUBTREE *sub = NULL;
117 ncons = NAME_CONSTRAINTS_new();
120 for(i = 0; i < sk_CONF_VALUE_num(nval); i++)
122 val = sk_CONF_VALUE_value(nval, i);
123 if (!strncmp(val->name, "permitted", 9) && val->name[9])
125 ptree = &ncons->permittedSubtrees;
126 tval.name = val->name + 10;
128 else if (!strncmp(val->name, "excluded", 8) && val->name[8])
130 ptree = &ncons->excludedSubtrees;
131 tval.name = val->name + 9;
135 X509V3err(X509V3_F_V2I_NAME_CONSTRAINTS, X509V3_R_INVALID_SYNTAX);
138 tval.value = val->value;
139 sub = GENERAL_SUBTREE_new();
140 if (!v2i_GENERAL_NAME_ex(sub->base, method, ctx, &tval, 1))
143 *ptree = sk_GENERAL_SUBTREE_new_null();
144 if (!*ptree || !sk_GENERAL_SUBTREE_push(*ptree, sub))
152 X509V3err(X509V3_F_V2I_NAME_CONSTRAINTS, ERR_R_MALLOC_FAILURE);
155 NAME_CONSTRAINTS_free(ncons);
157 GENERAL_SUBTREE_free(sub);
165 static int i2r_NAME_CONSTRAINTS(const X509V3_EXT_METHOD *method, void *a,
168 NAME_CONSTRAINTS *ncons = a;
169 do_i2r_name_constraints(method, ncons->permittedSubtrees,
170 bp, ind, "Permitted");
171 do_i2r_name_constraints(method, ncons->excludedSubtrees,
172 bp, ind, "Excluded");
176 static int do_i2r_name_constraints(const X509V3_EXT_METHOD *method,
177 STACK_OF(GENERAL_SUBTREE) *trees,
178 BIO *bp, int ind, char *name)
180 GENERAL_SUBTREE *tree;
182 if (sk_GENERAL_SUBTREE_num(trees) > 0)
183 BIO_printf(bp, "%*s%s:\n", ind, "", name);
184 for(i = 0; i < sk_GENERAL_SUBTREE_num(trees); i++)
186 tree = sk_GENERAL_SUBTREE_value(trees, i);
187 BIO_printf(bp, "%*s", ind + 2, "");
188 if (tree->base->type == GEN_IPADD)
189 print_nc_ipadd(bp, tree->base->d.ip);
191 GENERAL_NAME_print(bp, tree->base);
192 tree = sk_GENERAL_SUBTREE_value(trees, i);
198 static int print_nc_ipadd(BIO *bp, ASN1_OCTET_STRING *ip)
207 BIO_printf(bp, "%d.%d.%d.%d/%d.%d.%d.%d",
208 p[0], p[1], p[2], p[3],
209 p[4], p[5], p[6], p[7]);
213 for (i = 0; i < 16; i++)
215 BIO_printf(bp, "%X", p[0] << 8 | p[1]);
224 BIO_printf(bp, "IP Address:<invalid>");
228 /* Check a certificate conforms to a specified set of constraints.
230 * X509_V_OK: All constraints obeyed.
231 * X509_V_ERR_PERMITTED_VIOLATION: Permitted subtree violation.
232 * X509_V_ERR_EXCLUDED_VIOLATION: Excluded subtree violation.
233 * X509_V_ERR_SUBTREE_MINMAX: Min or max values present and matching type.
234 * X509_V_ERR_UNSUPPORTED_CONSTRAINT_TYPE: Unsupported constraint type.
235 * X509_V_ERR_UNSUPPORTED_CONSTRAINT_SYNTAX: bad unsupported constraint syntax.
236 * X509_V_ERR_UNSUPPORTED_NAME_SYNTAX: bad or unsupported syntax of name
240 int NAME_CONSTRAINTS_check(X509 *x, NAME_CONSTRAINTS *nc)
245 nm = X509_get_subject_name(x);
247 if (X509_NAME_entry_count(nm) > 0)
250 gntmp.type = GEN_DIRNAME;
251 gntmp.d.directoryName = nm;
253 r = nc_match(&gntmp, nc);
258 gntmp.type = GEN_EMAIL;
261 /* Process any email address attributes in subject name */
266 i = X509_NAME_get_index_by_NID(nm,
267 NID_pkcs9_emailAddress,
271 ne = X509_NAME_get_entry(nm, i);
272 gntmp.d.rfc822Name = X509_NAME_ENTRY_get_data(ne);
273 if (gntmp.d.rfc822Name->type != V_ASN1_IA5STRING)
274 return X509_V_ERR_UNSUPPORTED_NAME_SYNTAX;
276 r = nc_match(&gntmp, nc);
284 for (i = 0; i < sk_GENERAL_NAME_num(x->altname); i++)
286 GENERAL_NAME *gen = sk_GENERAL_NAME_value(x->altname, i);
287 r = nc_match(gen, nc);
296 static int nc_match(GENERAL_NAME *gen, NAME_CONSTRAINTS *nc)
298 GENERAL_SUBTREE *sub;
301 /* Permitted subtrees: if any subtrees exist of matching the type
302 * at least one subtree must match.
305 for (i = 0; i < sk_GENERAL_SUBTREE_num(nc->permittedSubtrees); i++)
307 sub = sk_GENERAL_SUBTREE_value(nc->permittedSubtrees, i);
308 if (gen->type != sub->base->type)
310 if (sub->minimum || sub->maximum)
311 return X509_V_ERR_SUBTREE_MINMAX;
312 /* If we already have a match don't bother trying any more */
317 r = nc_match_single(gen, sub->base);
320 else if (r != X509_V_ERR_PERMITTED_VIOLATION)
325 return X509_V_ERR_PERMITTED_VIOLATION;
327 /* Excluded subtrees: must not match any of these */
329 for (i = 0; i < sk_GENERAL_SUBTREE_num(nc->excludedSubtrees); i++)
331 sub = sk_GENERAL_SUBTREE_value(nc->excludedSubtrees, i);
332 if (gen->type != sub->base->type)
334 if (sub->minimum || sub->maximum)
335 return X509_V_ERR_SUBTREE_MINMAX;
337 r = nc_match_single(gen, sub->base);
339 return X509_V_ERR_EXCLUDED_VIOLATION;
340 else if (r != X509_V_ERR_PERMITTED_VIOLATION)
349 static int nc_match_single(GENERAL_NAME *gen, GENERAL_NAME *base)
354 return nc_dn(gen->d.directoryName, base->d.directoryName);
357 return nc_dns(gen->d.dNSName, base->d.dNSName);
360 return nc_email(gen->d.rfc822Name, base->d.rfc822Name);
363 return nc_uri(gen->d.uniformResourceIdentifier,
364 base->d.uniformResourceIdentifier);
367 return X509_V_ERR_UNSUPPORTED_CONSTRAINT_TYPE;
372 /* directoryName name constraint matching.
373 * The canonical encoding of X509_NAME makes this comparison easy. It is
374 * matched if the subtree is a subset of the name.
377 static int nc_dn(X509_NAME *nm, X509_NAME *base)
379 if (base->canon_enclen > nm->canon_enclen)
380 return X509_V_ERR_PERMITTED_VIOLATION;
381 if (memcmp(base->canon_enc, nm->canon_enc, base->canon_enclen))
382 return X509_V_ERR_PERMITTED_VIOLATION;
386 static int nc_dns(ASN1_IA5STRING *dns, ASN1_IA5STRING *base)
388 char *baseptr = (char *)base->data;
389 char *dnsptr = (char *)dns->data;
390 /* Empty matches everything */
393 /* Otherwise can add zero or more components on the left so
394 * compare RHS and if dns is longer and expect '.' as preceding
397 if (dns->length > base->length)
399 dnsptr += dns->length - base->length;
400 if (dnsptr[-1] != '.')
401 return X509_V_ERR_PERMITTED_VIOLATION;
404 if (strcasecmp(baseptr, dnsptr))
405 return X509_V_ERR_PERMITTED_VIOLATION;
411 static int nc_email(ASN1_IA5STRING *eml, ASN1_IA5STRING *base)
413 const char *baseptr = (char *)base->data;
414 const char *emlptr = (char *)eml->data;
416 const char *baseat = strchr(baseptr, '@');
417 const char *emlat = strchr(emlptr, '@');
419 return X509_V_ERR_UNSUPPORTED_NAME_SYNTAX;
420 /* Special case: inital '.' is RHS match */
421 if (!baseat && (*baseptr == '.'))
423 if (eml->length > base->length)
425 emlptr += eml->length - base->length;
426 if (!strcasecmp(baseptr, emlptr))
429 return X509_V_ERR_PERMITTED_VIOLATION;
432 /* If we have anything before '@' match local part */
436 if (baseat != baseptr)
438 if ((baseat - baseptr) != (emlat - emlptr))
439 return X509_V_ERR_PERMITTED_VIOLATION;
440 /* Case sensitive match of local part */
441 if (strncmp(baseptr, emlptr, emlat - emlptr))
442 return X509_V_ERR_PERMITTED_VIOLATION;
444 /* Position base after '@' */
445 baseptr = baseat + 1;
448 /* Just have hostname left to match: case insensitive */
449 if (strcasecmp(baseptr, emlptr))
450 return X509_V_ERR_PERMITTED_VIOLATION;
456 static int nc_uri(ASN1_IA5STRING *uri, ASN1_IA5STRING *base)
458 const char *baseptr = (char *)base->data;
459 const char *hostptr = (char *)uri->data;
460 const char *p = strchr(hostptr, ':');
462 /* Check for foo:// and skip past it */
463 if (!p || (p[1] != '/') || (p[2] != '/'))
464 return X509_V_ERR_UNSUPPORTED_NAME_SYNTAX;
467 /* Determine length of hostname part of URI */
469 /* Look for a port indicator as end of hostname first */
471 p = strchr(hostptr, ':');
472 /* Otherwise look for trailing slash */
474 p = strchr(hostptr, '/');
477 hostlen = strlen(hostptr);
479 hostlen = p - hostptr;
482 return X509_V_ERR_UNSUPPORTED_NAME_SYNTAX;
484 /* Special case: inital '.' is RHS match */
487 if (hostlen > base->length)
489 p = hostptr + hostlen - base->length;
490 if (!strncasecmp(p, baseptr, base->length))
493 return X509_V_ERR_PERMITTED_VIOLATION;
496 if ((base->length != (int)hostlen) || strncasecmp(hostptr, baseptr, hostlen))
497 return X509_V_ERR_PERMITTED_VIOLATION;