val_nsec3.c revision 287917
1238106Sdes/* 2238106Sdes * validator/val_nsec3.c - validator NSEC3 denial of existance functions. 3238106Sdes * 4238106Sdes * Copyright (c) 2007, NLnet Labs. All rights reserved. 5238106Sdes * 6238106Sdes * This software is open source. 7238106Sdes * 8238106Sdes * Redistribution and use in source and binary forms, with or without 9238106Sdes * modification, are permitted provided that the following conditions 10238106Sdes * are met: 11238106Sdes * 12238106Sdes * Redistributions of source code must retain the above copyright notice, 13238106Sdes * this list of conditions and the following disclaimer. 14238106Sdes * 15238106Sdes * Redistributions in binary form must reproduce the above copyright notice, 16238106Sdes * this list of conditions and the following disclaimer in the documentation 17238106Sdes * and/or other materials provided with the distribution. 18238106Sdes * 19238106Sdes * Neither the name of the NLNET LABS nor the names of its contributors may 20238106Sdes * be used to endorse or promote products derived from this software without 21238106Sdes * specific prior written permission. 22238106Sdes * 23238106Sdes * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 24266114Sdes * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 25266114Sdes * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 26266114Sdes * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 27266114Sdes * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 28266114Sdes * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED 29266114Sdes * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 30266114Sdes * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 31266114Sdes * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 32266114Sdes * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 33266114Sdes * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 34238106Sdes */ 35238106Sdes 36238106Sdes/** 37238106Sdes * \file 38238106Sdes * 39238106Sdes * This file contains helper functions for the validator module. 40238106Sdes * The functions help with NSEC3 checking, the different NSEC3 proofs 41238106Sdes * for denial of existance, and proofs for presence of types. 42238106Sdes */ 43238106Sdes#include "config.h" 44238106Sdes#include <ctype.h> 45238106Sdes#ifdef HAVE_OPENSSL_SSL_H 46238106Sdes#include "openssl/ssl.h" 47238106Sdes#endif 48249141Sdes#ifdef HAVE_NSS 49249141Sdes/* nss3 */ 50249141Sdes#include "sechash.h" 51249141Sdes#endif 52238106Sdes#include "validator/val_nsec3.h" 53238106Sdes#include "validator/validator.h" 54238106Sdes#include "validator/val_kentry.h" 55238106Sdes#include "services/cache/rrset.h" 56238106Sdes#include "util/regional.h" 57238106Sdes#include "util/rbtree.h" 58238106Sdes#include "util/module.h" 59238106Sdes#include "util/net_help.h" 60238106Sdes#include "util/data/packed_rrset.h" 61238106Sdes#include "util/data/dname.h" 62238106Sdes#include "util/data/msgreply.h" 63238106Sdes/* we include nsec.h for the bitmap_has_type function */ 64238106Sdes#include "validator/val_nsec.h" 65287917Sdes#include "sldns/sbuffer.h" 66238106Sdes 67238106Sdes/** 68238106Sdes * This function we get from ldns-compat or from base system 69238106Sdes * it returns the number of data bytes stored at the target, or <0 on error. 70238106Sdes */ 71266114Sdesint sldns_b32_ntop_extended_hex(uint8_t const *src, size_t srclength, 72238106Sdes char *target, size_t targsize); 73238106Sdes/** 74238106Sdes * This function we get from ldns-compat or from base system 75238106Sdes * it returns the number of data bytes stored at the target, or <0 on error. 76238106Sdes */ 77266114Sdesint sldns_b32_pton_extended_hex(char const *src, size_t hashed_owner_str_len, 78238106Sdes uint8_t *target, size_t targsize); 79238106Sdes 80238106Sdes/** 81238106Sdes * Closest encloser (ce) proof results 82238106Sdes * Contains the ce and the next-closer (nc) proof. 83238106Sdes */ 84238106Sdesstruct ce_response { 85238106Sdes /** the closest encloser name */ 86238106Sdes uint8_t* ce; 87238106Sdes /** length of ce */ 88238106Sdes size_t ce_len; 89238106Sdes /** NSEC3 record that proved ce. rrset */ 90238106Sdes struct ub_packed_rrset_key* ce_rrset; 91238106Sdes /** NSEC3 record that proved ce. rr number */ 92238106Sdes int ce_rr; 93238106Sdes /** NSEC3 record that proved nc. rrset */ 94238106Sdes struct ub_packed_rrset_key* nc_rrset; 95238106Sdes /** NSEC3 record that proved nc. rr*/ 96238106Sdes int nc_rr; 97238106Sdes}; 98238106Sdes 99238106Sdes/** 100238106Sdes * Filter conditions for NSEC3 proof 101238106Sdes * Used to iterate over the applicable NSEC3 RRs. 102238106Sdes */ 103238106Sdesstruct nsec3_filter { 104238106Sdes /** Zone name, only NSEC3 records for this zone are considered */ 105238106Sdes uint8_t* zone; 106238106Sdes /** length of the zonename */ 107238106Sdes size_t zone_len; 108238106Sdes /** the list of NSEC3s to filter; array */ 109238106Sdes struct ub_packed_rrset_key** list; 110238106Sdes /** number of rrsets in list */ 111238106Sdes size_t num; 112238106Sdes /** class of records for the NSEC3, only this class applies */ 113238106Sdes uint16_t fclass; 114238106Sdes}; 115238106Sdes 116238106Sdes/** return number of rrs in an rrset */ 117238106Sdesstatic size_t 118238106Sdesrrset_get_count(struct ub_packed_rrset_key* rrset) 119238106Sdes{ 120238106Sdes struct packed_rrset_data* d = (struct packed_rrset_data*) 121238106Sdes rrset->entry.data; 122238106Sdes if(!d) return 0; 123238106Sdes return d->count; 124238106Sdes} 125238106Sdes 126238106Sdes/** return if nsec3 RR has unknown flags */ 127238106Sdesstatic int 128238106Sdesnsec3_unknown_flags(struct ub_packed_rrset_key* rrset, int r) 129238106Sdes{ 130238106Sdes struct packed_rrset_data* d = (struct packed_rrset_data*) 131238106Sdes rrset->entry.data; 132238106Sdes log_assert(d && r < (int)d->count); 133238106Sdes if(d->rr_len[r] < 2+2) 134238106Sdes return 0; /* malformed */ 135238106Sdes return (int)(d->rr_data[r][2+1] & NSEC3_UNKNOWN_FLAGS); 136238106Sdes} 137238106Sdes 138238106Sdesint 139238106Sdesnsec3_has_optout(struct ub_packed_rrset_key* rrset, int r) 140238106Sdes{ 141238106Sdes struct packed_rrset_data* d = (struct packed_rrset_data*) 142238106Sdes rrset->entry.data; 143238106Sdes log_assert(d && r < (int)d->count); 144238106Sdes if(d->rr_len[r] < 2+2) 145238106Sdes return 0; /* malformed */ 146238106Sdes return (int)(d->rr_data[r][2+1] & NSEC3_OPTOUT); 147238106Sdes} 148238106Sdes 149238106Sdes/** return nsec3 RR algorithm */ 150238106Sdesstatic int 151238106Sdesnsec3_get_algo(struct ub_packed_rrset_key* rrset, int r) 152238106Sdes{ 153238106Sdes struct packed_rrset_data* d = (struct packed_rrset_data*) 154238106Sdes rrset->entry.data; 155238106Sdes log_assert(d && r < (int)d->count); 156238106Sdes if(d->rr_len[r] < 2+1) 157238106Sdes return 0; /* malformed */ 158238106Sdes return (int)(d->rr_data[r][2+0]); 159238106Sdes} 160238106Sdes 161238106Sdes/** return if nsec3 RR has known algorithm */ 162238106Sdesstatic int 163238106Sdesnsec3_known_algo(struct ub_packed_rrset_key* rrset, int r) 164238106Sdes{ 165238106Sdes struct packed_rrset_data* d = (struct packed_rrset_data*) 166238106Sdes rrset->entry.data; 167238106Sdes log_assert(d && r < (int)d->count); 168238106Sdes if(d->rr_len[r] < 2+1) 169238106Sdes return 0; /* malformed */ 170238106Sdes switch(d->rr_data[r][2+0]) { 171238106Sdes case NSEC3_HASH_SHA1: 172238106Sdes return 1; 173238106Sdes } 174238106Sdes return 0; 175238106Sdes} 176238106Sdes 177238106Sdes/** return nsec3 RR iteration count */ 178238106Sdesstatic size_t 179238106Sdesnsec3_get_iter(struct ub_packed_rrset_key* rrset, int r) 180238106Sdes{ 181238106Sdes uint16_t i; 182238106Sdes struct packed_rrset_data* d = (struct packed_rrset_data*) 183238106Sdes rrset->entry.data; 184238106Sdes log_assert(d && r < (int)d->count); 185238106Sdes if(d->rr_len[r] < 2+4) 186238106Sdes return 0; /* malformed */ 187238106Sdes memmove(&i, d->rr_data[r]+2+2, sizeof(i)); 188238106Sdes i = ntohs(i); 189238106Sdes return (size_t)i; 190238106Sdes} 191238106Sdes 192238106Sdes/** return nsec3 RR salt */ 193238106Sdesstatic int 194238106Sdesnsec3_get_salt(struct ub_packed_rrset_key* rrset, int r, 195238106Sdes uint8_t** salt, size_t* saltlen) 196238106Sdes{ 197238106Sdes struct packed_rrset_data* d = (struct packed_rrset_data*) 198238106Sdes rrset->entry.data; 199238106Sdes log_assert(d && r < (int)d->count); 200238106Sdes if(d->rr_len[r] < 2+5) { 201238106Sdes *salt = 0; 202238106Sdes *saltlen = 0; 203238106Sdes return 0; /* malformed */ 204238106Sdes } 205238106Sdes *saltlen = (size_t)d->rr_data[r][2+4]; 206238106Sdes if(d->rr_len[r] < 2+5+(size_t)*saltlen) { 207238106Sdes *salt = 0; 208238106Sdes *saltlen = 0; 209238106Sdes return 0; /* malformed */ 210238106Sdes } 211238106Sdes *salt = d->rr_data[r]+2+5; 212238106Sdes return 1; 213238106Sdes} 214238106Sdes 215238106Sdesint nsec3_get_params(struct ub_packed_rrset_key* rrset, int r, 216238106Sdes int* algo, size_t* iter, uint8_t** salt, size_t* saltlen) 217238106Sdes{ 218238106Sdes if(!nsec3_known_algo(rrset, r) || nsec3_unknown_flags(rrset, r)) 219238106Sdes return 0; 220238106Sdes if(!nsec3_get_salt(rrset, r, salt, saltlen)) 221238106Sdes return 0; 222238106Sdes *algo = nsec3_get_algo(rrset, r); 223238106Sdes *iter = nsec3_get_iter(rrset, r); 224238106Sdes return 1; 225238106Sdes} 226238106Sdes 227238106Sdesint 228238106Sdesnsec3_get_nextowner(struct ub_packed_rrset_key* rrset, int r, 229238106Sdes uint8_t** next, size_t* nextlen) 230238106Sdes{ 231238106Sdes size_t saltlen; 232238106Sdes struct packed_rrset_data* d = (struct packed_rrset_data*) 233238106Sdes rrset->entry.data; 234238106Sdes log_assert(d && r < (int)d->count); 235238106Sdes if(d->rr_len[r] < 2+5) { 236238106Sdes *next = 0; 237238106Sdes *nextlen = 0; 238238106Sdes return 0; /* malformed */ 239238106Sdes } 240238106Sdes saltlen = (size_t)d->rr_data[r][2+4]; 241238106Sdes if(d->rr_len[r] < 2+5+saltlen+1) { 242238106Sdes *next = 0; 243238106Sdes *nextlen = 0; 244238106Sdes return 0; /* malformed */ 245238106Sdes } 246238106Sdes *nextlen = (size_t)d->rr_data[r][2+5+saltlen]; 247238106Sdes if(d->rr_len[r] < 2+5+saltlen+1+*nextlen) { 248238106Sdes *next = 0; 249238106Sdes *nextlen = 0; 250238106Sdes return 0; /* malformed */ 251238106Sdes } 252238106Sdes *next = d->rr_data[r]+2+5+saltlen+1; 253238106Sdes return 1; 254238106Sdes} 255238106Sdes 256238106Sdessize_t nsec3_hash_to_b32(uint8_t* hash, size_t hashlen, uint8_t* zone, 257238106Sdes size_t zonelen, uint8_t* buf, size_t max) 258238106Sdes{ 259238106Sdes /* write b32 of name, leave one for length */ 260238106Sdes int ret; 261238106Sdes if(max < hashlen*2+1) /* quick approx of b32, as if hexb16 */ 262238106Sdes return 0; 263266114Sdes ret = sldns_b32_ntop_extended_hex(hash, hashlen, (char*)buf+1, max-1); 264238106Sdes if(ret < 1) 265238106Sdes return 0; 266238106Sdes buf[0] = (uint8_t)ret; /* length of b32 label */ 267238106Sdes ret++; 268238106Sdes if(max - ret < zonelen) 269238106Sdes return 0; 270238106Sdes memmove(buf+ret, zone, zonelen); 271238106Sdes return zonelen+(size_t)ret; 272238106Sdes} 273238106Sdes 274238106Sdessize_t nsec3_get_nextowner_b32(struct ub_packed_rrset_key* rrset, int r, 275238106Sdes uint8_t* buf, size_t max) 276238106Sdes{ 277238106Sdes uint8_t* nm, *zone; 278238106Sdes size_t nmlen, zonelen; 279238106Sdes if(!nsec3_get_nextowner(rrset, r, &nm, &nmlen)) 280238106Sdes return 0; 281238106Sdes /* append zone name; the owner name must be <b32>.zone */ 282238106Sdes zone = rrset->rk.dname; 283238106Sdes zonelen = rrset->rk.dname_len; 284238106Sdes dname_remove_label(&zone, &zonelen); 285238106Sdes return nsec3_hash_to_b32(nm, nmlen, zone, zonelen, buf, max); 286238106Sdes} 287238106Sdes 288238106Sdesint 289238106Sdesnsec3_has_type(struct ub_packed_rrset_key* rrset, int r, uint16_t type) 290238106Sdes{ 291238106Sdes uint8_t* bitmap; 292238106Sdes size_t bitlen, skiplen; 293238106Sdes struct packed_rrset_data* d = (struct packed_rrset_data*) 294238106Sdes rrset->entry.data; 295238106Sdes log_assert(d && r < (int)d->count); 296238106Sdes skiplen = 2+4; 297238106Sdes /* skip salt */ 298238106Sdes if(d->rr_len[r] < skiplen+1) 299238106Sdes return 0; /* malformed, too short */ 300238106Sdes skiplen += 1+(size_t)d->rr_data[r][skiplen]; 301238106Sdes /* skip next hashed owner */ 302238106Sdes if(d->rr_len[r] < skiplen+1) 303238106Sdes return 0; /* malformed, too short */ 304238106Sdes skiplen += 1+(size_t)d->rr_data[r][skiplen]; 305238106Sdes if(d->rr_len[r] < skiplen) 306238106Sdes return 0; /* malformed, too short */ 307238106Sdes bitlen = d->rr_len[r] - skiplen; 308238106Sdes bitmap = d->rr_data[r]+skiplen; 309238106Sdes return nsecbitmap_has_type_rdata(bitmap, bitlen, type); 310238106Sdes} 311238106Sdes 312238106Sdes/** 313238106Sdes * Iterate through NSEC3 list, per RR 314238106Sdes * This routine gives the next RR in the list (or sets rrset null). 315238106Sdes * Usage: 316238106Sdes * 317238106Sdes * size_t rrsetnum; 318238106Sdes * int rrnum; 319238106Sdes * struct ub_packed_rrset_key* rrset; 320238106Sdes * for(rrset=filter_first(filter, &rrsetnum, &rrnum); rrset; 321238106Sdes * rrset=filter_next(filter, &rrsetnum, &rrnum)) 322238106Sdes * do_stuff; 323238106Sdes * 324238106Sdes * Also filters out 325238106Sdes * o unknown flag NSEC3s 326238106Sdes * o unknown algorithm NSEC3s. 327238106Sdes * @param filter: nsec3 filter structure. 328238106Sdes * @param rrsetnum: in/out rrset number to look at. 329238106Sdes * @param rrnum: in/out rr number in rrset to look at. 330238106Sdes * @returns ptr to the next rrset (or NULL at end). 331238106Sdes */ 332238106Sdesstatic struct ub_packed_rrset_key* 333238106Sdesfilter_next(struct nsec3_filter* filter, size_t* rrsetnum, int* rrnum) 334238106Sdes{ 335238106Sdes size_t i; 336238106Sdes int r; 337238106Sdes uint8_t* nm; 338238106Sdes size_t nmlen; 339238106Sdes if(!filter->zone) /* empty list */ 340238106Sdes return NULL; 341238106Sdes for(i=*rrsetnum; i<filter->num; i++) { 342238106Sdes /* see if RRset qualifies */ 343238106Sdes if(ntohs(filter->list[i]->rk.type) != LDNS_RR_TYPE_NSEC3 || 344238106Sdes ntohs(filter->list[i]->rk.rrset_class) != 345238106Sdes filter->fclass) 346238106Sdes continue; 347238106Sdes /* check RRset zone */ 348238106Sdes nm = filter->list[i]->rk.dname; 349238106Sdes nmlen = filter->list[i]->rk.dname_len; 350238106Sdes dname_remove_label(&nm, &nmlen); 351238106Sdes if(query_dname_compare(nm, filter->zone) != 0) 352238106Sdes continue; 353238106Sdes if(i == *rrsetnum) 354238106Sdes r = (*rrnum) + 1; /* continue at next RR */ 355238106Sdes else r = 0; /* new RRset start at first RR */ 356238106Sdes for(; r < (int)rrset_get_count(filter->list[i]); r++) { 357238106Sdes /* skip unknown flags, algo */ 358238106Sdes if(nsec3_unknown_flags(filter->list[i], r) || 359238106Sdes !nsec3_known_algo(filter->list[i], r)) 360238106Sdes continue; 361238106Sdes /* this one is a good target */ 362238106Sdes *rrsetnum = i; 363238106Sdes *rrnum = r; 364238106Sdes return filter->list[i]; 365238106Sdes } 366238106Sdes } 367238106Sdes return NULL; 368238106Sdes} 369238106Sdes 370238106Sdes/** 371238106Sdes * Start iterating over NSEC3 records. 372238106Sdes * @param filter: the filter structure, must have been filter_init-ed. 373238106Sdes * @param rrsetnum: can be undefined on call, inited. 374238106Sdes * @param rrnum: can be undefined on call, inited. 375238106Sdes * @return first rrset of an NSEC3, together with rrnum this points to 376238106Sdes * the first RR to examine. Is NULL on empty list. 377238106Sdes */ 378238106Sdesstatic struct ub_packed_rrset_key* 379238106Sdesfilter_first(struct nsec3_filter* filter, size_t* rrsetnum, int* rrnum) 380238106Sdes{ 381238106Sdes *rrsetnum = 0; 382238106Sdes *rrnum = -1; 383238106Sdes return filter_next(filter, rrsetnum, rrnum); 384238106Sdes} 385238106Sdes 386238106Sdes/** see if at least one RR is known (flags, algo) */ 387238106Sdesstatic int 388238106Sdesnsec3_rrset_has_known(struct ub_packed_rrset_key* s) 389238106Sdes{ 390238106Sdes int r; 391238106Sdes for(r=0; r < (int)rrset_get_count(s); r++) { 392238106Sdes if(!nsec3_unknown_flags(s, r) && nsec3_known_algo(s, r)) 393238106Sdes return 1; 394238106Sdes } 395238106Sdes return 0; 396238106Sdes} 397238106Sdes 398238106Sdes/** 399238106Sdes * Initialize the filter structure. 400238106Sdes * Finds the zone by looking at available NSEC3 records and best match. 401238106Sdes * (skips the unknown flag and unknown algo NSEC3s). 402238106Sdes * 403238106Sdes * @param filter: nsec3 filter structure. 404238106Sdes * @param list: list of rrsets, an array of them. 405238106Sdes * @param num: number of rrsets in list. 406238106Sdes * @param qinfo: 407238106Sdes * query name to match a zone for. 408238106Sdes * query type (if DS a higher zone must be chosen) 409238106Sdes * qclass, to filter NSEC3s with. 410238106Sdes */ 411238106Sdesstatic void 412238106Sdesfilter_init(struct nsec3_filter* filter, struct ub_packed_rrset_key** list, 413238106Sdes size_t num, struct query_info* qinfo) 414238106Sdes{ 415238106Sdes size_t i; 416238106Sdes uint8_t* nm; 417238106Sdes size_t nmlen; 418238106Sdes filter->zone = NULL; 419238106Sdes filter->zone_len = 0; 420238106Sdes filter->list = list; 421238106Sdes filter->num = num; 422238106Sdes filter->fclass = qinfo->qclass; 423238106Sdes for(i=0; i<num; i++) { 424238106Sdes /* ignore other stuff in the list */ 425238106Sdes if(ntohs(list[i]->rk.type) != LDNS_RR_TYPE_NSEC3 || 426238106Sdes ntohs(list[i]->rk.rrset_class) != qinfo->qclass) 427238106Sdes continue; 428238106Sdes /* skip unknown flags, algo */ 429238106Sdes if(!nsec3_rrset_has_known(list[i])) 430238106Sdes continue; 431238106Sdes 432238106Sdes /* since NSEC3s are base32.zonename, we can find the zone 433238106Sdes * name by stripping off the first label of the record */ 434238106Sdes nm = list[i]->rk.dname; 435238106Sdes nmlen = list[i]->rk.dname_len; 436238106Sdes dname_remove_label(&nm, &nmlen); 437238106Sdes /* if we find a domain that can prove about the qname, 438238106Sdes * and if this domain is closer to the qname */ 439238106Sdes if(dname_subdomain_c(qinfo->qname, nm) && (!filter->zone || 440238106Sdes dname_subdomain_c(nm, filter->zone))) { 441238106Sdes /* for a type DS do not accept a zone equal to qname*/ 442238106Sdes if(qinfo->qtype == LDNS_RR_TYPE_DS && 443238106Sdes query_dname_compare(qinfo->qname, nm) == 0 && 444238106Sdes !dname_is_root(qinfo->qname)) 445238106Sdes continue; 446238106Sdes filter->zone = nm; 447238106Sdes filter->zone_len = nmlen; 448238106Sdes } 449238106Sdes } 450238106Sdes} 451238106Sdes 452238106Sdes/** 453238106Sdes * Find max iteration count using config settings and key size 454238106Sdes * @param ve: validator environment with iteration count config settings. 455238106Sdes * @param bits: key size 456238106Sdes * @return max iteration count 457238106Sdes */ 458238106Sdesstatic size_t 459238106Sdesget_max_iter(struct val_env* ve, size_t bits) 460238106Sdes{ 461238106Sdes int i; 462238106Sdes log_assert(ve->nsec3_keyiter_count > 0); 463238106Sdes /* round up to nearest config keysize, linear search, keep it small */ 464238106Sdes for(i=0; i<ve->nsec3_keyiter_count; i++) { 465238106Sdes if(bits <= ve->nsec3_keysize[i]) 466238106Sdes return ve->nsec3_maxiter[i]; 467238106Sdes } 468238106Sdes /* else, use value for biggest key */ 469238106Sdes return ve->nsec3_maxiter[ve->nsec3_keyiter_count-1]; 470238106Sdes} 471238106Sdes 472238106Sdes/** 473238106Sdes * Determine if any of the NSEC3 rrs iteration count is too high, from key. 474238106Sdes * @param ve: validator environment with iteration count config settings. 475238106Sdes * @param filter: what NSEC3s to loop over. 476238106Sdes * @param kkey: key entry used for verification; used for iteration counts. 477238106Sdes * @return 1 if some nsec3s are above the max iteration count. 478238106Sdes */ 479238106Sdesstatic int 480238106Sdesnsec3_iteration_count_high(struct val_env* ve, struct nsec3_filter* filter, 481238106Sdes struct key_entry_key* kkey) 482238106Sdes{ 483238106Sdes size_t rrsetnum; 484238106Sdes int rrnum; 485238106Sdes struct ub_packed_rrset_key* rrset; 486238106Sdes /* first determine the max number of iterations */ 487238106Sdes size_t bits = key_entry_keysize(kkey); 488238106Sdes size_t max_iter = get_max_iter(ve, bits); 489238106Sdes verbose(VERB_ALGO, "nsec3: keysize %d bits, max iterations %d", 490238106Sdes (int)bits, (int)max_iter); 491238106Sdes 492238106Sdes for(rrset=filter_first(filter, &rrsetnum, &rrnum); rrset; 493238106Sdes rrset=filter_next(filter, &rrsetnum, &rrnum)) { 494238106Sdes if(nsec3_get_iter(rrset, rrnum) > max_iter) 495238106Sdes return 1; 496238106Sdes } 497238106Sdes return 0; 498238106Sdes} 499238106Sdes 500238106Sdes/* nsec3_cache_compare for rbtree */ 501238106Sdesint 502238106Sdesnsec3_hash_cmp(const void* c1, const void* c2) 503238106Sdes{ 504238106Sdes struct nsec3_cached_hash* h1 = (struct nsec3_cached_hash*)c1; 505238106Sdes struct nsec3_cached_hash* h2 = (struct nsec3_cached_hash*)c2; 506238106Sdes uint8_t* s1, *s2; 507238106Sdes size_t s1len, s2len; 508238106Sdes int c = query_dname_compare(h1->dname, h2->dname); 509238106Sdes if(c != 0) 510238106Sdes return c; 511238106Sdes /* compare parameters */ 512238106Sdes /* if both malformed, its equal, robustness */ 513238106Sdes if(nsec3_get_algo(h1->nsec3, h1->rr) != 514238106Sdes nsec3_get_algo(h2->nsec3, h2->rr)) { 515238106Sdes if(nsec3_get_algo(h1->nsec3, h1->rr) < 516238106Sdes nsec3_get_algo(h2->nsec3, h2->rr)) 517238106Sdes return -1; 518238106Sdes return 1; 519238106Sdes } 520238106Sdes if(nsec3_get_iter(h1->nsec3, h1->rr) != 521238106Sdes nsec3_get_iter(h2->nsec3, h2->rr)) { 522238106Sdes if(nsec3_get_iter(h1->nsec3, h1->rr) < 523238106Sdes nsec3_get_iter(h2->nsec3, h2->rr)) 524238106Sdes return -1; 525238106Sdes return 1; 526238106Sdes } 527238106Sdes (void)nsec3_get_salt(h1->nsec3, h1->rr, &s1, &s1len); 528238106Sdes (void)nsec3_get_salt(h2->nsec3, h2->rr, &s2, &s2len); 529238106Sdes if(s1len != s2len) { 530238106Sdes if(s1len < s2len) 531238106Sdes return -1; 532238106Sdes return 1; 533238106Sdes } 534238106Sdes return memcmp(s1, s2, s1len); 535238106Sdes} 536238106Sdes 537238106Sdessize_t 538266114Sdesnsec3_get_hashed(sldns_buffer* buf, uint8_t* nm, size_t nmlen, int algo, 539238106Sdes size_t iter, uint8_t* salt, size_t saltlen, uint8_t* res, size_t max) 540238106Sdes{ 541238106Sdes size_t i, hash_len; 542238106Sdes /* prepare buffer for first iteration */ 543266114Sdes sldns_buffer_clear(buf); 544266114Sdes sldns_buffer_write(buf, nm, nmlen); 545266114Sdes query_dname_tolower(sldns_buffer_begin(buf)); 546266114Sdes sldns_buffer_write(buf, salt, saltlen); 547266114Sdes sldns_buffer_flip(buf); 548238106Sdes switch(algo) { 549249141Sdes#if defined(HAVE_EVP_SHA1) || defined(HAVE_NSS) 550238106Sdes case NSEC3_HASH_SHA1: 551249141Sdes#ifdef HAVE_SSL 552238106Sdes hash_len = SHA_DIGEST_LENGTH; 553249141Sdes#else 554249141Sdes hash_len = SHA1_LENGTH; 555249141Sdes#endif 556238106Sdes if(hash_len > max) 557238106Sdes return 0; 558249141Sdes# ifdef HAVE_SSL 559266114Sdes (void)SHA1((unsigned char*)sldns_buffer_begin(buf), 560266114Sdes (unsigned long)sldns_buffer_limit(buf), 561238106Sdes (unsigned char*)res); 562249141Sdes# else 563249141Sdes (void)HASH_HashBuf(HASH_AlgSHA1, (unsigned char*)res, 564266114Sdes (unsigned char*)sldns_buffer_begin(buf), 565266114Sdes (unsigned long)sldns_buffer_limit(buf)); 566249141Sdes# endif 567238106Sdes for(i=0; i<iter; i++) { 568266114Sdes sldns_buffer_clear(buf); 569266114Sdes sldns_buffer_write(buf, res, hash_len); 570266114Sdes sldns_buffer_write(buf, salt, saltlen); 571266114Sdes sldns_buffer_flip(buf); 572249141Sdes# ifdef HAVE_SSL 573238106Sdes (void)SHA1( 574266114Sdes (unsigned char*)sldns_buffer_begin(buf), 575266114Sdes (unsigned long)sldns_buffer_limit(buf), 576238106Sdes (unsigned char*)res); 577249141Sdes# else 578249141Sdes (void)HASH_HashBuf(HASH_AlgSHA1, 579249141Sdes (unsigned char*)res, 580266114Sdes (unsigned char*)sldns_buffer_begin(buf), 581266114Sdes (unsigned long)sldns_buffer_limit(buf)); 582249141Sdes# endif 583238106Sdes } 584238106Sdes break; 585249141Sdes#endif /* HAVE_EVP_SHA1 or NSS */ 586238106Sdes default: 587238106Sdes log_err("nsec3 hash of unknown algo %d", algo); 588238106Sdes return 0; 589238106Sdes } 590238106Sdes return hash_len; 591238106Sdes} 592238106Sdes 593238106Sdes/** perform hash of name */ 594238106Sdesstatic int 595266114Sdesnsec3_calc_hash(struct regional* region, sldns_buffer* buf, 596238106Sdes struct nsec3_cached_hash* c) 597238106Sdes{ 598238106Sdes int algo = nsec3_get_algo(c->nsec3, c->rr); 599238106Sdes size_t iter = nsec3_get_iter(c->nsec3, c->rr); 600238106Sdes uint8_t* salt; 601238106Sdes size_t saltlen, i; 602238106Sdes if(!nsec3_get_salt(c->nsec3, c->rr, &salt, &saltlen)) 603238106Sdes return -1; 604238106Sdes /* prepare buffer for first iteration */ 605266114Sdes sldns_buffer_clear(buf); 606266114Sdes sldns_buffer_write(buf, c->dname, c->dname_len); 607266114Sdes query_dname_tolower(sldns_buffer_begin(buf)); 608266114Sdes sldns_buffer_write(buf, salt, saltlen); 609266114Sdes sldns_buffer_flip(buf); 610238106Sdes switch(algo) { 611249141Sdes#if defined(HAVE_EVP_SHA1) || defined(HAVE_NSS) 612238106Sdes case NSEC3_HASH_SHA1: 613249141Sdes#ifdef HAVE_SSL 614238106Sdes c->hash_len = SHA_DIGEST_LENGTH; 615249141Sdes#else 616249141Sdes c->hash_len = SHA1_LENGTH; 617249141Sdes#endif 618238106Sdes c->hash = (uint8_t*)regional_alloc(region, 619238106Sdes c->hash_len); 620238106Sdes if(!c->hash) 621238106Sdes return 0; 622249141Sdes# ifdef HAVE_SSL 623266114Sdes (void)SHA1((unsigned char*)sldns_buffer_begin(buf), 624266114Sdes (unsigned long)sldns_buffer_limit(buf), 625238106Sdes (unsigned char*)c->hash); 626249141Sdes# else 627249141Sdes (void)HASH_HashBuf(HASH_AlgSHA1, 628249141Sdes (unsigned char*)c->hash, 629266114Sdes (unsigned char*)sldns_buffer_begin(buf), 630266114Sdes (unsigned long)sldns_buffer_limit(buf)); 631249141Sdes# endif 632238106Sdes for(i=0; i<iter; i++) { 633266114Sdes sldns_buffer_clear(buf); 634266114Sdes sldns_buffer_write(buf, c->hash, c->hash_len); 635266114Sdes sldns_buffer_write(buf, salt, saltlen); 636266114Sdes sldns_buffer_flip(buf); 637249141Sdes# ifdef HAVE_SSL 638238106Sdes (void)SHA1( 639266114Sdes (unsigned char*)sldns_buffer_begin(buf), 640266114Sdes (unsigned long)sldns_buffer_limit(buf), 641238106Sdes (unsigned char*)c->hash); 642249141Sdes# else 643249141Sdes (void)HASH_HashBuf(HASH_AlgSHA1, 644249141Sdes (unsigned char*)c->hash, 645266114Sdes (unsigned char*)sldns_buffer_begin(buf), 646266114Sdes (unsigned long)sldns_buffer_limit(buf)); 647249141Sdes# endif 648238106Sdes } 649238106Sdes break; 650249141Sdes#endif /* HAVE_EVP_SHA1 or NSS */ 651238106Sdes default: 652238106Sdes log_err("nsec3 hash of unknown algo %d", algo); 653238106Sdes return -1; 654238106Sdes } 655238106Sdes return 1; 656238106Sdes} 657238106Sdes 658238106Sdes/** perform b32 encoding of hash */ 659238106Sdesstatic int 660266114Sdesnsec3_calc_b32(struct regional* region, sldns_buffer* buf, 661238106Sdes struct nsec3_cached_hash* c) 662238106Sdes{ 663238106Sdes int r; 664266114Sdes sldns_buffer_clear(buf); 665266114Sdes r = sldns_b32_ntop_extended_hex(c->hash, c->hash_len, 666266114Sdes (char*)sldns_buffer_begin(buf), sldns_buffer_limit(buf)); 667238106Sdes if(r < 1) { 668238106Sdes log_err("b32_ntop_extended_hex: error in encoding: %d", r); 669238106Sdes return 0; 670238106Sdes } 671238106Sdes c->b32_len = (size_t)r; 672266114Sdes c->b32 = regional_alloc_init(region, sldns_buffer_begin(buf), 673238106Sdes c->b32_len); 674238106Sdes if(!c->b32) 675238106Sdes return 0; 676238106Sdes return 1; 677238106Sdes} 678238106Sdes 679238106Sdesint 680266114Sdesnsec3_hash_name(rbtree_t* table, struct regional* region, sldns_buffer* buf, 681238106Sdes struct ub_packed_rrset_key* nsec3, int rr, uint8_t* dname, 682238106Sdes size_t dname_len, struct nsec3_cached_hash** hash) 683238106Sdes{ 684238106Sdes struct nsec3_cached_hash* c; 685238106Sdes struct nsec3_cached_hash looki; 686238106Sdes#ifdef UNBOUND_DEBUG 687238106Sdes rbnode_t* n; 688238106Sdes#endif 689238106Sdes int r; 690238106Sdes looki.node.key = &looki; 691238106Sdes looki.nsec3 = nsec3; 692238106Sdes looki.rr = rr; 693238106Sdes looki.dname = dname; 694238106Sdes looki.dname_len = dname_len; 695238106Sdes /* lookup first in cache */ 696238106Sdes c = (struct nsec3_cached_hash*)rbtree_search(table, &looki); 697238106Sdes if(c) { 698238106Sdes *hash = c; 699238106Sdes return 1; 700238106Sdes } 701238106Sdes /* create a new entry */ 702238106Sdes c = (struct nsec3_cached_hash*)regional_alloc(region, sizeof(*c)); 703238106Sdes if(!c) return 0; 704238106Sdes c->node.key = c; 705238106Sdes c->nsec3 = nsec3; 706238106Sdes c->rr = rr; 707238106Sdes c->dname = dname; 708238106Sdes c->dname_len = dname_len; 709238106Sdes r = nsec3_calc_hash(region, buf, c); 710238106Sdes if(r != 1) 711238106Sdes return r; 712238106Sdes r = nsec3_calc_b32(region, buf, c); 713238106Sdes if(r != 1) 714238106Sdes return r; 715238106Sdes#ifdef UNBOUND_DEBUG 716238106Sdes n = 717266114Sdes#else 718266114Sdes (void) 719238106Sdes#endif 720238106Sdes rbtree_insert(table, &c->node); 721238106Sdes log_assert(n); /* cannot be duplicate, just did lookup */ 722238106Sdes *hash = c; 723238106Sdes return 1; 724238106Sdes} 725238106Sdes 726238106Sdes/** 727238106Sdes * compare a label lowercased 728238106Sdes */ 729238106Sdesstatic int 730238106Sdeslabel_compare_lower(uint8_t* lab1, uint8_t* lab2, size_t lablen) 731238106Sdes{ 732238106Sdes size_t i; 733238106Sdes for(i=0; i<lablen; i++) { 734276605Sdes if(tolower((unsigned char)*lab1) != tolower((unsigned char)*lab2)) { 735276605Sdes if(tolower((unsigned char)*lab1) < tolower((unsigned char)*lab2)) 736238106Sdes return -1; 737238106Sdes return 1; 738238106Sdes } 739238106Sdes lab1++; 740238106Sdes lab2++; 741238106Sdes } 742238106Sdes return 0; 743238106Sdes} 744238106Sdes 745238106Sdes/** 746238106Sdes * Compare a hashed name with the owner name of an NSEC3 RRset. 747238106Sdes * @param flt: filter with zone name. 748238106Sdes * @param hash: the hashed name. 749238106Sdes * @param s: rrset with owner name. 750238106Sdes * @return true if matches exactly, false if not. 751238106Sdes */ 752238106Sdesstatic int 753238106Sdesnsec3_hash_matches_owner(struct nsec3_filter* flt, 754238106Sdes struct nsec3_cached_hash* hash, struct ub_packed_rrset_key* s) 755238106Sdes{ 756238106Sdes uint8_t* nm = s->rk.dname; 757238106Sdes /* compare, does hash of name based on params in this NSEC3 758238106Sdes * match the owner name of this NSEC3? 759238106Sdes * name must be: <hashlength>base32 . zone name 760238106Sdes * so; first label must not be root label (not zero length), 761238106Sdes * and match the b32 encoded hash length, 762238106Sdes * and the label content match the b32 encoded hash 763238106Sdes * and the rest must be the zone name. 764238106Sdes */ 765238106Sdes if(hash->b32_len != 0 && (size_t)nm[0] == hash->b32_len && 766238106Sdes label_compare_lower(nm+1, hash->b32, hash->b32_len) == 0 && 767238106Sdes query_dname_compare(nm+(size_t)nm[0]+1, flt->zone) == 0) { 768238106Sdes return 1; 769238106Sdes } 770238106Sdes return 0; 771238106Sdes} 772238106Sdes 773238106Sdes/** 774238106Sdes * Find matching NSEC3 775238106Sdes * Find the NSEC3Record that matches a hash of a name. 776238106Sdes * @param env: module environment with temporary region and buffer. 777238106Sdes * @param flt: the NSEC3 RR filter, contains zone name and RRs. 778238106Sdes * @param ct: cached hashes table. 779238106Sdes * @param nm: name to look for. 780238106Sdes * @param nmlen: length of name. 781238106Sdes * @param rrset: nsec3 that matches is returned here. 782238106Sdes * @param rr: rr number in nsec3 rrset that matches. 783238106Sdes * @return true if a matching NSEC3 is found, false if not. 784238106Sdes */ 785238106Sdesstatic int 786238106Sdesfind_matching_nsec3(struct module_env* env, struct nsec3_filter* flt, 787238106Sdes rbtree_t* ct, uint8_t* nm, size_t nmlen, 788238106Sdes struct ub_packed_rrset_key** rrset, int* rr) 789238106Sdes{ 790238106Sdes size_t i_rs; 791238106Sdes int i_rr; 792238106Sdes struct ub_packed_rrset_key* s; 793238106Sdes struct nsec3_cached_hash* hash; 794238106Sdes int r; 795238106Sdes 796238106Sdes /* this loop skips other-zone and unknown NSEC3s, also non-NSEC3 RRs */ 797238106Sdes for(s=filter_first(flt, &i_rs, &i_rr); s; 798238106Sdes s=filter_next(flt, &i_rs, &i_rr)) { 799238106Sdes /* get name hashed for this NSEC3 RR */ 800238106Sdes r = nsec3_hash_name(ct, env->scratch, env->scratch_buffer, 801238106Sdes s, i_rr, nm, nmlen, &hash); 802238106Sdes if(r == 0) { 803238106Sdes log_err("nsec3: malloc failure"); 804238106Sdes break; /* alloc failure */ 805238106Sdes } else if(r < 0) 806238106Sdes continue; /* malformed NSEC3 */ 807238106Sdes else if(nsec3_hash_matches_owner(flt, hash, s)) { 808238106Sdes *rrset = s; /* rrset with this name */ 809238106Sdes *rr = i_rr; /* matches hash with these parameters */ 810238106Sdes return 1; 811238106Sdes } 812238106Sdes } 813238106Sdes *rrset = NULL; 814238106Sdes *rr = 0; 815238106Sdes return 0; 816238106Sdes} 817238106Sdes 818238106Sdesint 819238106Sdesnsec3_covers(uint8_t* zone, struct nsec3_cached_hash* hash, 820266114Sdes struct ub_packed_rrset_key* rrset, int rr, sldns_buffer* buf) 821238106Sdes{ 822238106Sdes uint8_t* next, *owner; 823238106Sdes size_t nextlen; 824238106Sdes int len; 825238106Sdes if(!nsec3_get_nextowner(rrset, rr, &next, &nextlen)) 826238106Sdes return 0; /* malformed RR proves nothing */ 827238106Sdes 828238106Sdes /* check the owner name is a hashed value . apex 829238106Sdes * base32 encoded values must have equal length. 830238106Sdes * hash_value and next hash value must have equal length. */ 831238106Sdes if(nextlen != hash->hash_len || hash->hash_len==0||hash->b32_len==0|| 832238106Sdes (size_t)*rrset->rk.dname != hash->b32_len || 833238106Sdes query_dname_compare(rrset->rk.dname+1+ 834238106Sdes (size_t)*rrset->rk.dname, zone) != 0) 835238106Sdes return 0; /* bad lengths or owner name */ 836238106Sdes 837238106Sdes /* This is the "normal case: owner < next and owner < hash < next */ 838238106Sdes if(label_compare_lower(rrset->rk.dname+1, hash->b32, 839238106Sdes hash->b32_len) < 0 && 840238106Sdes memcmp(hash->hash, next, nextlen) < 0) 841238106Sdes return 1; 842238106Sdes 843238106Sdes /* convert owner name from text to binary */ 844266114Sdes sldns_buffer_clear(buf); 845266114Sdes owner = sldns_buffer_begin(buf); 846266114Sdes len = sldns_b32_pton_extended_hex((char*)rrset->rk.dname+1, 847266114Sdes hash->b32_len, owner, sldns_buffer_limit(buf)); 848238106Sdes if(len<1) 849238106Sdes return 0; /* bad owner name in some way */ 850238106Sdes if((size_t)len != hash->hash_len || (size_t)len != nextlen) 851238106Sdes return 0; /* wrong length */ 852238106Sdes 853238106Sdes /* this is the end of zone case: next <= owner && 854238106Sdes * (hash > owner || hash < next) 855238106Sdes * this also covers the only-apex case of next==owner. 856238106Sdes */ 857238106Sdes if(memcmp(next, owner, nextlen) <= 0 && 858238106Sdes ( memcmp(hash->hash, owner, nextlen) > 0 || 859238106Sdes memcmp(hash->hash, next, nextlen) < 0)) { 860238106Sdes return 1; 861238106Sdes } 862238106Sdes return 0; 863238106Sdes} 864238106Sdes 865238106Sdes/** 866238106Sdes * findCoveringNSEC3 867238106Sdes * Given a name, find a covering NSEC3 from among a list of NSEC3s. 868238106Sdes * 869238106Sdes * @param env: module environment with temporary region and buffer. 870238106Sdes * @param flt: the NSEC3 RR filter, contains zone name and RRs. 871238106Sdes * @param ct: cached hashes table. 872238106Sdes * @param nm: name to check if covered. 873238106Sdes * @param nmlen: length of name. 874238106Sdes * @param rrset: covering NSEC3 rrset is returned here. 875238106Sdes * @param rr: rr of cover is returned here. 876238106Sdes * @return true if a covering NSEC3 is found, false if not. 877238106Sdes */ 878238106Sdesstatic int 879238106Sdesfind_covering_nsec3(struct module_env* env, struct nsec3_filter* flt, 880238106Sdes rbtree_t* ct, uint8_t* nm, size_t nmlen, 881238106Sdes struct ub_packed_rrset_key** rrset, int* rr) 882238106Sdes{ 883238106Sdes size_t i_rs; 884238106Sdes int i_rr; 885238106Sdes struct ub_packed_rrset_key* s; 886238106Sdes struct nsec3_cached_hash* hash; 887238106Sdes int r; 888238106Sdes 889238106Sdes /* this loop skips other-zone and unknown NSEC3s, also non-NSEC3 RRs */ 890238106Sdes for(s=filter_first(flt, &i_rs, &i_rr); s; 891238106Sdes s=filter_next(flt, &i_rs, &i_rr)) { 892238106Sdes /* get name hashed for this NSEC3 RR */ 893238106Sdes r = nsec3_hash_name(ct, env->scratch, env->scratch_buffer, 894238106Sdes s, i_rr, nm, nmlen, &hash); 895238106Sdes if(r == 0) { 896238106Sdes log_err("nsec3: malloc failure"); 897238106Sdes break; /* alloc failure */ 898238106Sdes } else if(r < 0) 899238106Sdes continue; /* malformed NSEC3 */ 900238106Sdes else if(nsec3_covers(flt->zone, hash, s, i_rr, 901238106Sdes env->scratch_buffer)) { 902238106Sdes *rrset = s; /* rrset with this name */ 903238106Sdes *rr = i_rr; /* covers hash with these parameters */ 904238106Sdes return 1; 905238106Sdes } 906238106Sdes } 907238106Sdes *rrset = NULL; 908238106Sdes *rr = 0; 909238106Sdes return 0; 910238106Sdes} 911238106Sdes 912238106Sdes/** 913238106Sdes * findClosestEncloser 914238106Sdes * Given a name and a list of NSEC3s, find the candidate closest encloser. 915238106Sdes * This will be the first ancestor of 'name' (including itself) to have a 916238106Sdes * matching NSEC3 RR. 917238106Sdes * @param env: module environment with temporary region and buffer. 918238106Sdes * @param flt: the NSEC3 RR filter, contains zone name and RRs. 919238106Sdes * @param ct: cached hashes table. 920238106Sdes * @param qinfo: query that is verified for. 921238106Sdes * @param ce: closest encloser information is returned in here. 922238106Sdes * @return true if a closest encloser candidate is found, false if not. 923238106Sdes */ 924238106Sdesstatic int 925238106Sdesnsec3_find_closest_encloser(struct module_env* env, struct nsec3_filter* flt, 926238106Sdes rbtree_t* ct, struct query_info* qinfo, struct ce_response* ce) 927238106Sdes{ 928238106Sdes uint8_t* nm = qinfo->qname; 929238106Sdes size_t nmlen = qinfo->qname_len; 930238106Sdes 931238106Sdes /* This scans from longest name to shortest, so the first match 932238106Sdes * we find is the only viable candidate. */ 933238106Sdes 934238106Sdes /* (David:) FIXME: modify so that the NSEC3 matching the zone apex need 935238106Sdes * not be present. (Mark Andrews idea). 936238106Sdes * (Wouter:) But make sure you check for DNAME bit in zone apex, 937238106Sdes * if the NSEC3 you find is the only NSEC3 in the zone, then this 938238106Sdes * may be the case. */ 939238106Sdes 940238106Sdes while(dname_subdomain_c(nm, flt->zone)) { 941238106Sdes if(find_matching_nsec3(env, flt, ct, nm, nmlen, 942238106Sdes &ce->ce_rrset, &ce->ce_rr)) { 943238106Sdes ce->ce = nm; 944238106Sdes ce->ce_len = nmlen; 945238106Sdes return 1; 946238106Sdes } 947238106Sdes dname_remove_label(&nm, &nmlen); 948238106Sdes } 949238106Sdes return 0; 950238106Sdes} 951238106Sdes 952238106Sdes/** 953238106Sdes * Given a qname and its proven closest encloser, calculate the "next 954238106Sdes * closest" name. Basically, this is the name that is one label longer than 955238106Sdes * the closest encloser that is still a subdomain of qname. 956238106Sdes * 957238106Sdes * @param qname: query name. 958238106Sdes * @param qnamelen: length of qname. 959238106Sdes * @param ce: closest encloser 960238106Sdes * @param nm: result name. 961238106Sdes * @param nmlen: length of nm. 962238106Sdes */ 963238106Sdesstatic void 964238106Sdesnext_closer(uint8_t* qname, size_t qnamelen, uint8_t* ce, 965238106Sdes uint8_t** nm, size_t* nmlen) 966238106Sdes{ 967238106Sdes int strip = dname_count_labels(qname) - dname_count_labels(ce) -1; 968238106Sdes *nm = qname; 969238106Sdes *nmlen = qnamelen; 970238106Sdes if(strip>0) 971238106Sdes dname_remove_labels(nm, nmlen, strip); 972238106Sdes} 973238106Sdes 974238106Sdes/** 975238106Sdes * proveClosestEncloser 976238106Sdes * Given a List of nsec3 RRs, find and prove the closest encloser to qname. 977238106Sdes * @param env: module environment with temporary region and buffer. 978238106Sdes * @param flt: the NSEC3 RR filter, contains zone name and RRs. 979238106Sdes * @param ct: cached hashes table. 980238106Sdes * @param qinfo: query that is verified for. 981238106Sdes * @param prove_does_not_exist: If true, then if the closest encloser 982238106Sdes * turns out to be qname, then null is returned. 983238106Sdes * If set true, and the return value is true, then you can be 984238106Sdes * certain that the ce.nc_rrset and ce.nc_rr are set properly. 985238106Sdes * @param ce: closest encloser information is returned in here. 986238106Sdes * @return bogus if no closest encloser could be proven. 987238106Sdes * secure if a closest encloser could be proven, ce is set. 988238106Sdes * insecure if the closest-encloser candidate turns out to prove 989238106Sdes * that an insecure delegation exists above the qname. 990238106Sdes */ 991238106Sdesstatic enum sec_status 992238106Sdesnsec3_prove_closest_encloser(struct module_env* env, struct nsec3_filter* flt, 993238106Sdes rbtree_t* ct, struct query_info* qinfo, int prove_does_not_exist, 994238106Sdes struct ce_response* ce) 995238106Sdes{ 996238106Sdes uint8_t* nc; 997238106Sdes size_t nc_len; 998238106Sdes /* robust: clean out ce, in case it gets abused later */ 999238106Sdes memset(ce, 0, sizeof(*ce)); 1000238106Sdes 1001238106Sdes if(!nsec3_find_closest_encloser(env, flt, ct, qinfo, ce)) { 1002238106Sdes verbose(VERB_ALGO, "nsec3 proveClosestEncloser: could " 1003238106Sdes "not find a candidate for the closest encloser."); 1004238106Sdes return sec_status_bogus; 1005238106Sdes } 1006238106Sdes log_nametypeclass(VERB_ALGO, "ce candidate", ce->ce, 0, 0); 1007238106Sdes 1008238106Sdes if(query_dname_compare(ce->ce, qinfo->qname) == 0) { 1009238106Sdes if(prove_does_not_exist) { 1010238106Sdes verbose(VERB_ALGO, "nsec3 proveClosestEncloser: " 1011238106Sdes "proved that qname existed, bad"); 1012238106Sdes return sec_status_bogus; 1013238106Sdes } 1014238106Sdes /* otherwise, we need to nothing else to prove that qname 1015238106Sdes * is its own closest encloser. */ 1016238106Sdes return sec_status_secure; 1017238106Sdes } 1018238106Sdes 1019238106Sdes /* If the closest encloser is actually a delegation, then the 1020238106Sdes * response should have been a referral. If it is a DNAME, then 1021238106Sdes * it should have been a DNAME response. */ 1022238106Sdes if(nsec3_has_type(ce->ce_rrset, ce->ce_rr, LDNS_RR_TYPE_NS) && 1023238106Sdes !nsec3_has_type(ce->ce_rrset, ce->ce_rr, LDNS_RR_TYPE_SOA)) { 1024238106Sdes if(!nsec3_has_type(ce->ce_rrset, ce->ce_rr, LDNS_RR_TYPE_DS)) { 1025238106Sdes verbose(VERB_ALGO, "nsec3 proveClosestEncloser: " 1026238106Sdes "closest encloser is insecure delegation"); 1027238106Sdes return sec_status_insecure; 1028238106Sdes } 1029238106Sdes verbose(VERB_ALGO, "nsec3 proveClosestEncloser: closest " 1030238106Sdes "encloser was a delegation, bad"); 1031238106Sdes return sec_status_bogus; 1032238106Sdes } 1033238106Sdes if(nsec3_has_type(ce->ce_rrset, ce->ce_rr, LDNS_RR_TYPE_DNAME)) { 1034238106Sdes verbose(VERB_ALGO, "nsec3 proveClosestEncloser: closest " 1035238106Sdes "encloser was a DNAME, bad"); 1036238106Sdes return sec_status_bogus; 1037238106Sdes } 1038238106Sdes 1039238106Sdes /* Otherwise, we need to show that the next closer name is covered. */ 1040238106Sdes next_closer(qinfo->qname, qinfo->qname_len, ce->ce, &nc, &nc_len); 1041238106Sdes if(!find_covering_nsec3(env, flt, ct, nc, nc_len, 1042238106Sdes &ce->nc_rrset, &ce->nc_rr)) { 1043238106Sdes verbose(VERB_ALGO, "nsec3: Could not find proof that the " 1044238106Sdes "candidate encloser was the closest encloser"); 1045238106Sdes return sec_status_bogus; 1046238106Sdes } 1047238106Sdes return sec_status_secure; 1048238106Sdes} 1049238106Sdes 1050238106Sdes/** allocate a wildcard for the closest encloser */ 1051238106Sdesstatic uint8_t* 1052238106Sdesnsec3_ce_wildcard(struct regional* region, uint8_t* ce, size_t celen, 1053238106Sdes size_t* len) 1054238106Sdes{ 1055238106Sdes uint8_t* nm; 1056238106Sdes if(celen > LDNS_MAX_DOMAINLEN - 2) 1057238106Sdes return 0; /* too long */ 1058238106Sdes nm = (uint8_t*)regional_alloc(region, celen+2); 1059238106Sdes if(!nm) { 1060238106Sdes log_err("nsec3 wildcard: out of memory"); 1061238106Sdes return 0; /* alloc failure */ 1062238106Sdes } 1063238106Sdes nm[0] = 1; 1064238106Sdes nm[1] = (uint8_t)'*'; /* wildcard label */ 1065238106Sdes memmove(nm+2, ce, celen); 1066238106Sdes *len = celen+2; 1067238106Sdes return nm; 1068238106Sdes} 1069238106Sdes 1070238106Sdes/** Do the name error proof */ 1071238106Sdesstatic enum sec_status 1072238106Sdesnsec3_do_prove_nameerror(struct module_env* env, struct nsec3_filter* flt, 1073238106Sdes rbtree_t* ct, struct query_info* qinfo) 1074238106Sdes{ 1075238106Sdes struct ce_response ce; 1076238106Sdes uint8_t* wc; 1077238106Sdes size_t wclen; 1078238106Sdes struct ub_packed_rrset_key* wc_rrset; 1079238106Sdes int wc_rr; 1080238106Sdes enum sec_status sec; 1081238106Sdes 1082238106Sdes /* First locate and prove the closest encloser to qname. We will 1083238106Sdes * use the variant that fails if the closest encloser turns out 1084238106Sdes * to be qname. */ 1085238106Sdes sec = nsec3_prove_closest_encloser(env, flt, ct, qinfo, 1, &ce); 1086238106Sdes if(sec != sec_status_secure) { 1087238106Sdes if(sec == sec_status_bogus) 1088238106Sdes verbose(VERB_ALGO, "nsec3 nameerror proof: failed " 1089238106Sdes "to prove a closest encloser"); 1090238106Sdes else verbose(VERB_ALGO, "nsec3 nameerror proof: closest " 1091238106Sdes "nsec3 is an insecure delegation"); 1092238106Sdes return sec; 1093238106Sdes } 1094238106Sdes log_nametypeclass(VERB_ALGO, "nsec3 namerror: proven ce=", ce.ce,0,0); 1095238106Sdes 1096238106Sdes /* At this point, we know that qname does not exist. Now we need 1097238106Sdes * to prove that the wildcard does not exist. */ 1098238106Sdes log_assert(ce.ce); 1099238106Sdes wc = nsec3_ce_wildcard(env->scratch, ce.ce, ce.ce_len, &wclen); 1100238106Sdes if(!wc || !find_covering_nsec3(env, flt, ct, wc, wclen, 1101238106Sdes &wc_rrset, &wc_rr)) { 1102238106Sdes verbose(VERB_ALGO, "nsec3 nameerror proof: could not prove " 1103238106Sdes "that the applicable wildcard did not exist."); 1104238106Sdes return sec_status_bogus; 1105238106Sdes } 1106238106Sdes 1107238106Sdes if(ce.nc_rrset && nsec3_has_optout(ce.nc_rrset, ce.nc_rr)) { 1108238106Sdes verbose(VERB_ALGO, "nsec3 nameerror proof: nc has optout"); 1109238106Sdes return sec_status_insecure; 1110238106Sdes } 1111238106Sdes return sec_status_secure; 1112238106Sdes} 1113238106Sdes 1114238106Sdesenum sec_status 1115238106Sdesnsec3_prove_nameerror(struct module_env* env, struct val_env* ve, 1116238106Sdes struct ub_packed_rrset_key** list, size_t num, 1117238106Sdes struct query_info* qinfo, struct key_entry_key* kkey) 1118238106Sdes{ 1119238106Sdes rbtree_t ct; 1120238106Sdes struct nsec3_filter flt; 1121238106Sdes 1122238106Sdes if(!list || num == 0 || !kkey || !key_entry_isgood(kkey)) 1123238106Sdes return sec_status_bogus; /* no valid NSEC3s, bogus */ 1124238106Sdes rbtree_init(&ct, &nsec3_hash_cmp); /* init names-to-hash cache */ 1125238106Sdes filter_init(&flt, list, num, qinfo); /* init RR iterator */ 1126238106Sdes if(!flt.zone) 1127238106Sdes return sec_status_bogus; /* no RRs */ 1128238106Sdes if(nsec3_iteration_count_high(ve, &flt, kkey)) 1129238106Sdes return sec_status_insecure; /* iteration count too high */ 1130238106Sdes log_nametypeclass(VERB_ALGO, "start nsec3 nameerror proof, zone", 1131238106Sdes flt.zone, 0, 0); 1132238106Sdes return nsec3_do_prove_nameerror(env, &flt, &ct, qinfo); 1133238106Sdes} 1134238106Sdes 1135238106Sdes/* 1136238106Sdes * No code to handle qtype=NSEC3 specially. 1137238106Sdes * This existed in early drafts, but was later (-05) removed. 1138238106Sdes */ 1139238106Sdes 1140238106Sdes/** Do the nodata proof */ 1141238106Sdesstatic enum sec_status 1142238106Sdesnsec3_do_prove_nodata(struct module_env* env, struct nsec3_filter* flt, 1143238106Sdes rbtree_t* ct, struct query_info* qinfo) 1144238106Sdes{ 1145238106Sdes struct ce_response ce; 1146238106Sdes uint8_t* wc; 1147238106Sdes size_t wclen; 1148238106Sdes struct ub_packed_rrset_key* rrset; 1149238106Sdes int rr; 1150238106Sdes enum sec_status sec; 1151238106Sdes 1152238106Sdes if(find_matching_nsec3(env, flt, ct, qinfo->qname, qinfo->qname_len, 1153238106Sdes &rrset, &rr)) { 1154238106Sdes /* cases 1 and 2 */ 1155238106Sdes if(nsec3_has_type(rrset, rr, qinfo->qtype)) { 1156238106Sdes verbose(VERB_ALGO, "proveNodata: Matching NSEC3 " 1157238106Sdes "proved that type existed, bogus"); 1158238106Sdes return sec_status_bogus; 1159238106Sdes } else if(nsec3_has_type(rrset, rr, LDNS_RR_TYPE_CNAME)) { 1160238106Sdes verbose(VERB_ALGO, "proveNodata: Matching NSEC3 " 1161238106Sdes "proved that a CNAME existed, bogus"); 1162238106Sdes return sec_status_bogus; 1163238106Sdes } 1164238106Sdes 1165238106Sdes /* 1166238106Sdes * If type DS: filter_init zone find already found a parent 1167238106Sdes * zone, so this nsec3 is from a parent zone. 1168238106Sdes * o can be not a delegation (unusual query for normal name, 1169238106Sdes * no DS anyway, but we can verify that). 1170238106Sdes * o can be a delegation (which is the usual DS check). 1171238106Sdes * o may not have the SOA bit set (only the top of the 1172238106Sdes * zone, which must have been above the name, has that). 1173238106Sdes * Except for the root; which is checked by itself. 1174238106Sdes * 1175238106Sdes * If not type DS: matching nsec3 must not be a delegation. 1176238106Sdes */ 1177238106Sdes if(qinfo->qtype == LDNS_RR_TYPE_DS && qinfo->qname_len != 1 1178249141Sdes && nsec3_has_type(rrset, rr, LDNS_RR_TYPE_SOA) && 1179249141Sdes !dname_is_root(qinfo->qname)) { 1180238106Sdes verbose(VERB_ALGO, "proveNodata: apex NSEC3 " 1181238106Sdes "abused for no DS proof, bogus"); 1182238106Sdes return sec_status_bogus; 1183238106Sdes } else if(qinfo->qtype != LDNS_RR_TYPE_DS && 1184238106Sdes nsec3_has_type(rrset, rr, LDNS_RR_TYPE_NS) && 1185238106Sdes !nsec3_has_type(rrset, rr, LDNS_RR_TYPE_SOA)) { 1186238106Sdes if(!nsec3_has_type(rrset, rr, LDNS_RR_TYPE_DS)) { 1187238106Sdes verbose(VERB_ALGO, "proveNodata: matching " 1188238106Sdes "NSEC3 is insecure delegation"); 1189238106Sdes return sec_status_insecure; 1190238106Sdes } 1191238106Sdes verbose(VERB_ALGO, "proveNodata: matching " 1192238106Sdes "NSEC3 is a delegation, bogus"); 1193238106Sdes return sec_status_bogus; 1194238106Sdes } 1195238106Sdes return sec_status_secure; 1196238106Sdes } 1197238106Sdes 1198238106Sdes /* For cases 3 - 5, we need the proven closest encloser, and it 1199238106Sdes * can't match qname. Although, at this point, we know that it 1200238106Sdes * won't since we just checked that. */ 1201238106Sdes sec = nsec3_prove_closest_encloser(env, flt, ct, qinfo, 1, &ce); 1202238106Sdes if(sec == sec_status_bogus) { 1203238106Sdes verbose(VERB_ALGO, "proveNodata: did not match qname, " 1204238106Sdes "nor found a proven closest encloser."); 1205238106Sdes return sec_status_bogus; 1206238106Sdes } else if(sec==sec_status_insecure && qinfo->qtype!=LDNS_RR_TYPE_DS){ 1207238106Sdes verbose(VERB_ALGO, "proveNodata: closest nsec3 is insecure " 1208238106Sdes "delegation."); 1209238106Sdes return sec_status_insecure; 1210238106Sdes } 1211238106Sdes 1212238106Sdes /* Case 3: removed */ 1213238106Sdes 1214238106Sdes /* Case 4: */ 1215238106Sdes log_assert(ce.ce); 1216238106Sdes wc = nsec3_ce_wildcard(env->scratch, ce.ce, ce.ce_len, &wclen); 1217238106Sdes if(wc && find_matching_nsec3(env, flt, ct, wc, wclen, &rrset, &rr)) { 1218238106Sdes /* found wildcard */ 1219238106Sdes if(nsec3_has_type(rrset, rr, qinfo->qtype)) { 1220238106Sdes verbose(VERB_ALGO, "nsec3 nodata proof: matching " 1221238106Sdes "wildcard had qtype, bogus"); 1222238106Sdes return sec_status_bogus; 1223238106Sdes } else if(nsec3_has_type(rrset, rr, LDNS_RR_TYPE_CNAME)) { 1224238106Sdes verbose(VERB_ALGO, "nsec3 nodata proof: matching " 1225238106Sdes "wildcard had a CNAME, bogus"); 1226238106Sdes return sec_status_bogus; 1227238106Sdes } 1228238106Sdes if(qinfo->qtype == LDNS_RR_TYPE_DS && qinfo->qname_len != 1 1229238106Sdes && nsec3_has_type(rrset, rr, LDNS_RR_TYPE_SOA)) { 1230238106Sdes verbose(VERB_ALGO, "nsec3 nodata proof: matching " 1231238106Sdes "wildcard for no DS proof has a SOA, bogus"); 1232238106Sdes return sec_status_bogus; 1233238106Sdes } else if(qinfo->qtype != LDNS_RR_TYPE_DS && 1234238106Sdes nsec3_has_type(rrset, rr, LDNS_RR_TYPE_NS) && 1235238106Sdes !nsec3_has_type(rrset, rr, LDNS_RR_TYPE_SOA)) { 1236238106Sdes verbose(VERB_ALGO, "nsec3 nodata proof: matching " 1237238106Sdes "wilcard is a delegation, bogus"); 1238238106Sdes return sec_status_bogus; 1239238106Sdes } 1240238106Sdes /* everything is peachy keen, except for optout spans */ 1241238106Sdes if(ce.nc_rrset && nsec3_has_optout(ce.nc_rrset, ce.nc_rr)) { 1242238106Sdes verbose(VERB_ALGO, "nsec3 nodata proof: matching " 1243238106Sdes "wildcard is in optout range, insecure"); 1244238106Sdes return sec_status_insecure; 1245238106Sdes } 1246238106Sdes return sec_status_secure; 1247238106Sdes } 1248238106Sdes 1249238106Sdes /* Case 5: */ 1250238106Sdes /* Due to forwarders, cnames, and other collating effects, we 1251238106Sdes * can see the ordinary unsigned data from a zone beneath an 1252238106Sdes * insecure delegation under an optout here */ 1253238106Sdes if(!ce.nc_rrset) { 1254238106Sdes verbose(VERB_ALGO, "nsec3 nodata proof: no next closer nsec3"); 1255238106Sdes return sec_status_bogus; 1256238106Sdes } 1257238106Sdes 1258238106Sdes /* We need to make sure that the covering NSEC3 is opt-out. */ 1259238106Sdes log_assert(ce.nc_rrset); 1260238106Sdes if(!nsec3_has_optout(ce.nc_rrset, ce.nc_rr)) { 1261238106Sdes if(qinfo->qtype == LDNS_RR_TYPE_DS) 1262238106Sdes verbose(VERB_ALGO, "proveNodata: covering NSEC3 was not " 1263238106Sdes "opt-out in an opt-out DS NOERROR/NODATA case."); 1264238106Sdes else verbose(VERB_ALGO, "proveNodata: could not find matching " 1265238106Sdes "NSEC3, nor matching wildcard, nor optout NSEC3 " 1266238106Sdes "-- no more options, bogus."); 1267238106Sdes return sec_status_bogus; 1268238106Sdes } 1269238106Sdes /* RFC5155 section 9.2: if nc has optout then no AD flag set */ 1270238106Sdes return sec_status_insecure; 1271238106Sdes} 1272238106Sdes 1273238106Sdesenum sec_status 1274238106Sdesnsec3_prove_nodata(struct module_env* env, struct val_env* ve, 1275238106Sdes struct ub_packed_rrset_key** list, size_t num, 1276238106Sdes struct query_info* qinfo, struct key_entry_key* kkey) 1277238106Sdes{ 1278238106Sdes rbtree_t ct; 1279238106Sdes struct nsec3_filter flt; 1280238106Sdes 1281238106Sdes if(!list || num == 0 || !kkey || !key_entry_isgood(kkey)) 1282238106Sdes return sec_status_bogus; /* no valid NSEC3s, bogus */ 1283238106Sdes rbtree_init(&ct, &nsec3_hash_cmp); /* init names-to-hash cache */ 1284238106Sdes filter_init(&flt, list, num, qinfo); /* init RR iterator */ 1285238106Sdes if(!flt.zone) 1286238106Sdes return sec_status_bogus; /* no RRs */ 1287238106Sdes if(nsec3_iteration_count_high(ve, &flt, kkey)) 1288238106Sdes return sec_status_insecure; /* iteration count too high */ 1289238106Sdes return nsec3_do_prove_nodata(env, &flt, &ct, qinfo); 1290238106Sdes} 1291238106Sdes 1292238106Sdesenum sec_status 1293238106Sdesnsec3_prove_wildcard(struct module_env* env, struct val_env* ve, 1294238106Sdes struct ub_packed_rrset_key** list, size_t num, 1295238106Sdes struct query_info* qinfo, struct key_entry_key* kkey, uint8_t* wc) 1296238106Sdes{ 1297238106Sdes rbtree_t ct; 1298238106Sdes struct nsec3_filter flt; 1299238106Sdes struct ce_response ce; 1300238106Sdes uint8_t* nc; 1301238106Sdes size_t nc_len; 1302238106Sdes size_t wclen; 1303238106Sdes (void)dname_count_size_labels(wc, &wclen); 1304238106Sdes 1305238106Sdes if(!list || num == 0 || !kkey || !key_entry_isgood(kkey)) 1306238106Sdes return sec_status_bogus; /* no valid NSEC3s, bogus */ 1307238106Sdes rbtree_init(&ct, &nsec3_hash_cmp); /* init names-to-hash cache */ 1308238106Sdes filter_init(&flt, list, num, qinfo); /* init RR iterator */ 1309238106Sdes if(!flt.zone) 1310238106Sdes return sec_status_bogus; /* no RRs */ 1311238106Sdes if(nsec3_iteration_count_high(ve, &flt, kkey)) 1312238106Sdes return sec_status_insecure; /* iteration count too high */ 1313238106Sdes 1314238106Sdes /* We know what the (purported) closest encloser is by just 1315238106Sdes * looking at the supposed generating wildcard. 1316238106Sdes * The *. has already been removed from the wc name. 1317238106Sdes */ 1318238106Sdes memset(&ce, 0, sizeof(ce)); 1319238106Sdes ce.ce = wc; 1320238106Sdes ce.ce_len = wclen; 1321238106Sdes 1322238106Sdes /* Now we still need to prove that the original data did not exist. 1323238106Sdes * Otherwise, we need to show that the next closer name is covered. */ 1324238106Sdes next_closer(qinfo->qname, qinfo->qname_len, ce.ce, &nc, &nc_len); 1325238106Sdes if(!find_covering_nsec3(env, &flt, &ct, nc, nc_len, 1326238106Sdes &ce.nc_rrset, &ce.nc_rr)) { 1327238106Sdes verbose(VERB_ALGO, "proveWildcard: did not find a covering " 1328238106Sdes "NSEC3 that covered the next closer name."); 1329238106Sdes return sec_status_bogus; 1330238106Sdes } 1331238106Sdes if(ce.nc_rrset && nsec3_has_optout(ce.nc_rrset, ce.nc_rr)) { 1332238106Sdes verbose(VERB_ALGO, "proveWildcard: NSEC3 optout"); 1333238106Sdes return sec_status_insecure; 1334238106Sdes } 1335238106Sdes return sec_status_secure; 1336238106Sdes} 1337238106Sdes 1338238106Sdes/** test if list is all secure */ 1339238106Sdesstatic int 1340238106Sdeslist_is_secure(struct module_env* env, struct val_env* ve, 1341238106Sdes struct ub_packed_rrset_key** list, size_t num, 1342238106Sdes struct key_entry_key* kkey, char** reason) 1343238106Sdes{ 1344238106Sdes struct packed_rrset_data* d; 1345238106Sdes size_t i; 1346238106Sdes for(i=0; i<num; i++) { 1347238106Sdes d = (struct packed_rrset_data*)list[i]->entry.data; 1348238106Sdes if(list[i]->rk.type != htons(LDNS_RR_TYPE_NSEC3)) 1349238106Sdes continue; 1350238106Sdes if(d->security == sec_status_secure) 1351238106Sdes continue; 1352238106Sdes rrset_check_sec_status(env->rrset_cache, list[i], *env->now); 1353238106Sdes if(d->security == sec_status_secure) 1354238106Sdes continue; 1355238106Sdes d->security = val_verify_rrset_entry(env, ve, list[i], kkey, 1356238106Sdes reason); 1357238106Sdes if(d->security != sec_status_secure) { 1358238106Sdes verbose(VERB_ALGO, "NSEC3 did not verify"); 1359238106Sdes return 0; 1360238106Sdes } 1361238106Sdes rrset_update_sec_status(env->rrset_cache, list[i], *env->now); 1362238106Sdes } 1363238106Sdes return 1; 1364238106Sdes} 1365238106Sdes 1366238106Sdesenum sec_status 1367238106Sdesnsec3_prove_nods(struct module_env* env, struct val_env* ve, 1368238106Sdes struct ub_packed_rrset_key** list, size_t num, 1369238106Sdes struct query_info* qinfo, struct key_entry_key* kkey, char** reason) 1370238106Sdes{ 1371238106Sdes rbtree_t ct; 1372238106Sdes struct nsec3_filter flt; 1373238106Sdes struct ce_response ce; 1374238106Sdes struct ub_packed_rrset_key* rrset; 1375238106Sdes int rr; 1376238106Sdes log_assert(qinfo->qtype == LDNS_RR_TYPE_DS); 1377238106Sdes 1378238106Sdes if(!list || num == 0 || !kkey || !key_entry_isgood(kkey)) { 1379238106Sdes *reason = "no valid NSEC3s"; 1380238106Sdes return sec_status_bogus; /* no valid NSEC3s, bogus */ 1381238106Sdes } 1382238106Sdes if(!list_is_secure(env, ve, list, num, kkey, reason)) 1383238106Sdes return sec_status_bogus; /* not all NSEC3 records secure */ 1384238106Sdes rbtree_init(&ct, &nsec3_hash_cmp); /* init names-to-hash cache */ 1385238106Sdes filter_init(&flt, list, num, qinfo); /* init RR iterator */ 1386238106Sdes if(!flt.zone) { 1387238106Sdes *reason = "no NSEC3 records"; 1388238106Sdes return sec_status_bogus; /* no RRs */ 1389238106Sdes } 1390238106Sdes if(nsec3_iteration_count_high(ve, &flt, kkey)) 1391238106Sdes return sec_status_insecure; /* iteration count too high */ 1392238106Sdes 1393238106Sdes /* Look for a matching NSEC3 to qname -- this is the normal 1394238106Sdes * NODATA case. */ 1395238106Sdes if(find_matching_nsec3(env, &flt, &ct, qinfo->qname, qinfo->qname_len, 1396238106Sdes &rrset, &rr)) { 1397238106Sdes /* If the matching NSEC3 has the SOA bit set, it is from 1398238106Sdes * the wrong zone (the child instead of the parent). If 1399238106Sdes * it has the DS bit set, then we were lied to. */ 1400238106Sdes if(nsec3_has_type(rrset, rr, LDNS_RR_TYPE_SOA) && 1401238106Sdes qinfo->qname_len != 1) { 1402238106Sdes verbose(VERB_ALGO, "nsec3 provenods: NSEC3 is from" 1403238106Sdes " child zone, bogus"); 1404238106Sdes *reason = "NSEC3 from child zone"; 1405238106Sdes return sec_status_bogus; 1406238106Sdes } else if(nsec3_has_type(rrset, rr, LDNS_RR_TYPE_DS)) { 1407238106Sdes verbose(VERB_ALGO, "nsec3 provenods: NSEC3 has qtype" 1408238106Sdes " DS, bogus"); 1409238106Sdes *reason = "NSEC3 has DS in bitmap"; 1410238106Sdes return sec_status_bogus; 1411238106Sdes } 1412238106Sdes /* If the NSEC3 RR doesn't have the NS bit set, then 1413238106Sdes * this wasn't a delegation point. */ 1414238106Sdes if(!nsec3_has_type(rrset, rr, LDNS_RR_TYPE_NS)) 1415238106Sdes return sec_status_indeterminate; 1416238106Sdes /* Otherwise, this proves no DS. */ 1417238106Sdes return sec_status_secure; 1418238106Sdes } 1419238106Sdes 1420238106Sdes /* Otherwise, we are probably in the opt-out case. */ 1421238106Sdes if(nsec3_prove_closest_encloser(env, &flt, &ct, qinfo, 1, &ce) 1422238106Sdes != sec_status_secure) { 1423238106Sdes /* an insecure delegation *above* the qname does not prove 1424238106Sdes * anything about this qname exactly, and bogus is bogus */ 1425238106Sdes verbose(VERB_ALGO, "nsec3 provenods: did not match qname, " 1426238106Sdes "nor found a proven closest encloser."); 1427238106Sdes *reason = "no NSEC3 closest encloser"; 1428238106Sdes return sec_status_bogus; 1429238106Sdes } 1430238106Sdes 1431238106Sdes /* robust extra check */ 1432238106Sdes if(!ce.nc_rrset) { 1433238106Sdes verbose(VERB_ALGO, "nsec3 nods proof: no next closer nsec3"); 1434238106Sdes *reason = "no NSEC3 next closer"; 1435238106Sdes return sec_status_bogus; 1436238106Sdes } 1437238106Sdes 1438238106Sdes /* we had the closest encloser proof, then we need to check that the 1439238106Sdes * covering NSEC3 was opt-out -- the proveClosestEncloser step already 1440238106Sdes * checked to see if the closest encloser was a delegation or DNAME. 1441238106Sdes */ 1442238106Sdes log_assert(ce.nc_rrset); 1443238106Sdes if(!nsec3_has_optout(ce.nc_rrset, ce.nc_rr)) { 1444238106Sdes verbose(VERB_ALGO, "nsec3 provenods: covering NSEC3 was not " 1445238106Sdes "opt-out in an opt-out DS NOERROR/NODATA case."); 1446238106Sdes *reason = "covering NSEC3 was not opt-out in an opt-out " 1447238106Sdes "DS NOERROR/NODATA case"; 1448238106Sdes return sec_status_bogus; 1449238106Sdes } 1450238106Sdes /* RFC5155 section 9.2: if nc has optout then no AD flag set */ 1451238106Sdes return sec_status_insecure; 1452238106Sdes} 1453238106Sdes 1454238106Sdesenum sec_status 1455238106Sdesnsec3_prove_nxornodata(struct module_env* env, struct val_env* ve, 1456238106Sdes struct ub_packed_rrset_key** list, size_t num, 1457238106Sdes struct query_info* qinfo, struct key_entry_key* kkey, int* nodata) 1458238106Sdes{ 1459238106Sdes enum sec_status sec, secnx; 1460238106Sdes rbtree_t ct; 1461238106Sdes struct nsec3_filter flt; 1462238106Sdes *nodata = 0; 1463238106Sdes 1464238106Sdes if(!list || num == 0 || !kkey || !key_entry_isgood(kkey)) 1465238106Sdes return sec_status_bogus; /* no valid NSEC3s, bogus */ 1466238106Sdes rbtree_init(&ct, &nsec3_hash_cmp); /* init names-to-hash cache */ 1467238106Sdes filter_init(&flt, list, num, qinfo); /* init RR iterator */ 1468238106Sdes if(!flt.zone) 1469238106Sdes return sec_status_bogus; /* no RRs */ 1470238106Sdes if(nsec3_iteration_count_high(ve, &flt, kkey)) 1471238106Sdes return sec_status_insecure; /* iteration count too high */ 1472238106Sdes 1473238106Sdes /* try nxdomain and nodata after another, while keeping the 1474238106Sdes * hash cache intact */ 1475238106Sdes 1476238106Sdes secnx = nsec3_do_prove_nameerror(env, &flt, &ct, qinfo); 1477238106Sdes if(secnx==sec_status_secure) 1478238106Sdes return sec_status_secure; 1479238106Sdes sec = nsec3_do_prove_nodata(env, &flt, &ct, qinfo); 1480238106Sdes if(sec==sec_status_secure) { 1481238106Sdes *nodata = 1; 1482238106Sdes } else if(sec == sec_status_insecure) { 1483238106Sdes *nodata = 1; 1484238106Sdes } else if(secnx == sec_status_insecure) { 1485238106Sdes sec = sec_status_insecure; 1486238106Sdes } 1487238106Sdes return sec; 1488238106Sdes} 1489