417 lines
11 KiB
C
417 lines
11 KiB
C
/*
|
|
* Copyright (c) 1997 - 2001, 2003 Kungliga Tekniska Högskolan
|
|
* (Royal Institute of Technology, Stockholm, Sweden).
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* 3. Neither the name of the Institute nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#include "kadm5_locl.h"
|
|
|
|
RCSID("$Id$");
|
|
|
|
/*
|
|
* Set the keys of `ent' to the string-to-key of `password'
|
|
*/
|
|
|
|
kadm5_ret_t
|
|
_kadm5_set_keys(kadm5_server_context *context,
|
|
hdb_entry *ent,
|
|
int n_ks_tuple,
|
|
krb5_key_salt_tuple *ks_tuple,
|
|
const char *password)
|
|
{
|
|
Key *keys;
|
|
size_t num_keys;
|
|
kadm5_ret_t ret;
|
|
|
|
ret = hdb_generate_key_set_password_with_ks_tuple(context->context,
|
|
ent->principal,
|
|
password,
|
|
ks_tuple, n_ks_tuple,
|
|
&keys, &num_keys);
|
|
if (ret)
|
|
return ret;
|
|
|
|
_kadm5_free_keys (context->context, ent->keys.len, ent->keys.val);
|
|
ent->keys.val = keys;
|
|
ent->keys.len = num_keys;
|
|
|
|
hdb_entry_set_pw_change_time(context->context, ent, 0);
|
|
|
|
if (krb5_config_get_bool_default(context->context, NULL, FALSE,
|
|
"kadmin", "save-password", NULL))
|
|
{
|
|
ret = hdb_entry_set_password(context->context, context->db,
|
|
ent, password);
|
|
if (ret)
|
|
return ret;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
static void
|
|
setup_Key(Key *k, Salt *s, krb5_key_data *kd, size_t kd_offset)
|
|
{
|
|
memset(k, 0, sizeof (*k)); /* sets mkvno and salt */
|
|
k->key.keytype = kd[kd_offset].key_data_type[0];
|
|
k->key.keyvalue.length = kd[kd_offset].key_data_length[0];
|
|
k->key.keyvalue.data = kd[kd_offset].key_data_contents[0];
|
|
|
|
if(kd[kd_offset].key_data_ver == 2) {
|
|
memset(s, 0, sizeof (*s));
|
|
s->type = kd[kd_offset].key_data_type[1];
|
|
s->salt.length = kd[kd_offset].key_data_length[1];
|
|
s->salt.data = kd[kd_offset].key_data_contents[1];
|
|
k->salt = s;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Set the keys of `ent' to (`n_key_data', `key_data')
|
|
*/
|
|
|
|
kadm5_ret_t
|
|
_kadm5_set_keys2(kadm5_server_context *context,
|
|
hdb_entry *ent,
|
|
int16_t n_key_data,
|
|
krb5_key_data *key_data)
|
|
{
|
|
krb5_error_code ret;
|
|
size_t i, k;
|
|
HDB_extension ext;
|
|
HDB_extension *extp = NULL;
|
|
HDB_Ext_KeySet *hist_keys = &ext.data.u.hist_keys;
|
|
Key key;
|
|
Salt salt;
|
|
Keys keys;
|
|
hdb_keyset hkset;
|
|
krb5_kvno kvno = -1;
|
|
int one_key_set = 1;
|
|
int replace_hist_keys = 0;
|
|
|
|
if (n_key_data == 0) {
|
|
/* Clear all keys! */
|
|
ret = hdb_clear_extension(context->context, ent,
|
|
choice_HDB_extension_data_hist_keys);
|
|
if (ret)
|
|
return ret;
|
|
free_Keys(&ent->keys);
|
|
return 0;
|
|
}
|
|
|
|
memset(&keys, 0, sizeof (keys));
|
|
memset(&hkset, 0, sizeof (hkset)); /* set set_time */
|
|
memset(&ext, 0, sizeof (ext));
|
|
ext.mandatory = FALSE;
|
|
ext.data.element = choice_HDB_extension_data_hist_keys;
|
|
memset(hist_keys, 0, sizeof (*hist_keys));
|
|
|
|
for (i = 0; i < n_key_data; i++) {
|
|
if (kvno != -1 && kvno != key_data[i].key_data_kvno) {
|
|
one_key_set = 0;
|
|
break;
|
|
}
|
|
kvno = key_data[i].key_data_kvno;
|
|
}
|
|
if (one_key_set) {
|
|
/*
|
|
* If we're updating KADM5_KEY_DATA with a single keyset then we
|
|
* assume we must be setting the principal's kvno as well!
|
|
*
|
|
* Just have to be careful about old clients that might have
|
|
* sent 0 as the kvno... This may seem ugly, but it's the price
|
|
* of backwards compatibility with pre-multi-kvno kadmin clients
|
|
* (besides, who's to say that updating KADM5_KEY_DATA requires
|
|
* updating the entry's kvno?)
|
|
*
|
|
* Note that we do nothing special for the case where multiple
|
|
* keysets are given but the entry's kvno is not set and not in
|
|
* the given set of keysets. If this happens we'll just update
|
|
* the key history only and leave the current keyset alone.
|
|
*/
|
|
if (kvno == 0) {
|
|
/* Force kvno to 1 if it was 0; (ank would do this anyways) */
|
|
if (ent->kvno == 0)
|
|
ent->kvno = 1;
|
|
/* Below we need key_data[*].kvno to be reasonable */
|
|
for (i = 0; i < n_key_data; i++)
|
|
key_data[i].key_data_kvno = ent->kvno;
|
|
} else {
|
|
/*
|
|
* Or force the entry's kvno to match the one from the new,
|
|
* singular keyset
|
|
*/
|
|
ent->kvno = kvno;
|
|
}
|
|
}
|
|
|
|
for (i = 0; i < n_key_data; i++) {
|
|
if (key_data[i].key_data_kvno == ent->kvno) {
|
|
/* A current key; add to current key set */
|
|
setup_Key(&key, &salt, key_data, i);
|
|
ret = add_Keys(&keys, &key);
|
|
continue;
|
|
}
|
|
|
|
/*
|
|
* This kvno is historical. Build an hdb_keyset for keys of
|
|
* this enctype and add them to the new key history.
|
|
*/
|
|
for (k = 0; k < hist_keys->len; k++) {
|
|
if (hist_keys->val[k].kvno == key_data[i].key_data_kvno)
|
|
break;
|
|
}
|
|
if (hist_keys->len > k &&
|
|
hist_keys->val[k].kvno == key_data[i].key_data_kvno)
|
|
/* We've added all keys of this kvno already (see below) */
|
|
continue;
|
|
|
|
memset(&hkset, 0, sizeof (hkset)); /* set set_time */
|
|
hkset.kvno = key_data[i].key_data_kvno;
|
|
for (k = 0; k < n_key_data; k++) {
|
|
/* Find all keys of this kvno and add them to the new keyset */
|
|
if (key_data[k].key_data_kvno != hkset.kvno)
|
|
continue;
|
|
|
|
setup_Key(&key, &salt, key_data, k);
|
|
ret = add_Keys(&hkset.keys, &key);
|
|
if (ret) {
|
|
free_hdb_keyset(&hkset);
|
|
goto out;
|
|
}
|
|
}
|
|
ret = add_HDB_Ext_KeySet(hist_keys, &hkset);
|
|
free_hdb_keyset(&hkset);
|
|
if (ret)
|
|
goto out;
|
|
replace_hist_keys = 1;
|
|
}
|
|
|
|
if (replace_hist_keys)
|
|
/* No key history given -> leave it alone */
|
|
extp = hdb_find_extension(ent, choice_HDB_extension_data_hist_keys);
|
|
if (extp != NULL) {
|
|
HDB_Ext_KeySet *old_hist_keys;
|
|
|
|
/*
|
|
* Try to keep the very useful set_time values from the old hist
|
|
* keys. kadm5 loses this info, so this heuristic is the best we
|
|
* can do.
|
|
*/
|
|
old_hist_keys = &extp->data.u.hist_keys;
|
|
for (i = 0; i < old_hist_keys->len; i++) {
|
|
if (old_hist_keys->val[i].set_time == NULL)
|
|
continue;
|
|
for (k = 0; k < hist_keys->len; k++) {
|
|
if (hist_keys->val[k].kvno != old_hist_keys->val[k].kvno)
|
|
continue;
|
|
hist_keys->val[k].set_time = old_hist_keys->val[k].set_time;
|
|
old_hist_keys->val[k].set_time = NULL;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (replace_hist_keys) {
|
|
/* If hist keys not given in key_data then don't blow away hist_keys */
|
|
ret = hdb_replace_extension(context->context, ent, &ext);
|
|
if (ret)
|
|
goto out;
|
|
}
|
|
|
|
/*
|
|
* A structure copy is more efficient here than this would be:
|
|
*
|
|
* copy_Keys(&keys, &ent->keys);
|
|
* free_Keys(&keys);
|
|
*
|
|
* Of course, the above hdb_replace_extension() is not at all efficient...
|
|
*/
|
|
free_HDB_extension(&ext);
|
|
free_Keys(&ent->keys);
|
|
free_hdb_keyset(&hkset);
|
|
ent->keys = keys;
|
|
hdb_entry_set_pw_change_time(context->context, ent, 0);
|
|
hdb_entry_clear_password(context->context, ent);
|
|
|
|
return 0;
|
|
|
|
out:
|
|
free_Keys(&keys);
|
|
free_HDB_extension(&ext);
|
|
return ret;
|
|
}
|
|
|
|
/*
|
|
* Set the keys of `ent' to `n_keys, keys'
|
|
*/
|
|
|
|
kadm5_ret_t
|
|
_kadm5_set_keys3(kadm5_server_context *context,
|
|
hdb_entry *ent,
|
|
int n_keys,
|
|
krb5_keyblock *keyblocks)
|
|
{
|
|
krb5_error_code ret;
|
|
int i;
|
|
unsigned len;
|
|
Key *keys;
|
|
|
|
len = n_keys;
|
|
keys = malloc (len * sizeof(*keys));
|
|
if (keys == NULL && len != 0)
|
|
return krb5_enomem(context->context);
|
|
|
|
_kadm5_init_keys (keys, len);
|
|
|
|
for(i = 0; i < n_keys; i++) {
|
|
keys[i].mkvno = NULL;
|
|
ret = krb5_copy_keyblock_contents (context->context,
|
|
&keyblocks[i],
|
|
&keys[i].key);
|
|
if(ret)
|
|
goto out;
|
|
keys[i].salt = NULL;
|
|
}
|
|
_kadm5_free_keys (context->context, ent->keys.len, ent->keys.val);
|
|
ent->keys.len = len;
|
|
ent->keys.val = keys;
|
|
|
|
hdb_entry_set_pw_change_time(context->context, ent, 0);
|
|
hdb_entry_clear_password(context->context, ent);
|
|
|
|
return 0;
|
|
out:
|
|
_kadm5_free_keys (context->context, len, keys);
|
|
return ret;
|
|
}
|
|
|
|
/*
|
|
*
|
|
*/
|
|
|
|
static int
|
|
is_des_key_p(int keytype)
|
|
{
|
|
return keytype == ETYPE_DES_CBC_CRC ||
|
|
keytype == ETYPE_DES_CBC_MD4 ||
|
|
keytype == ETYPE_DES_CBC_MD5;
|
|
}
|
|
|
|
|
|
/*
|
|
* Set the keys of `ent' to random keys and return them in `n_keys'
|
|
* and `new_keys'.
|
|
*/
|
|
|
|
kadm5_ret_t
|
|
_kadm5_set_keys_randomly (kadm5_server_context *context,
|
|
hdb_entry *ent,
|
|
int n_ks_tuple,
|
|
krb5_key_salt_tuple *ks_tuple,
|
|
krb5_keyblock **new_keys,
|
|
int *n_keys)
|
|
{
|
|
krb5_keyblock *kblock = NULL;
|
|
kadm5_ret_t ret = 0;
|
|
int des_keyblock;
|
|
size_t i, num_keys;
|
|
Key *keys;
|
|
|
|
ret = hdb_generate_key_set(context->context, ent->principal,
|
|
ks_tuple, n_ks_tuple, &keys, &num_keys, 1);
|
|
if (ret)
|
|
return ret;
|
|
|
|
kblock = malloc(num_keys * sizeof(kblock[0]));
|
|
if (kblock == NULL) {
|
|
ret = krb5_enomem(context->context);
|
|
_kadm5_free_keys (context->context, num_keys, keys);
|
|
return ret;
|
|
}
|
|
memset(kblock, 0, num_keys * sizeof(kblock[0]));
|
|
|
|
des_keyblock = -1;
|
|
for (i = 0; i < num_keys; i++) {
|
|
|
|
/*
|
|
* To make sure all des keys are the the same we generate only
|
|
* the first one and then copy key to all other des keys.
|
|
*/
|
|
|
|
if (des_keyblock != -1 && is_des_key_p(keys[i].key.keytype)) {
|
|
ret = krb5_copy_keyblock_contents (context->context,
|
|
&kblock[des_keyblock],
|
|
&kblock[i]);
|
|
if (ret)
|
|
goto out;
|
|
kblock[i].keytype = keys[i].key.keytype;
|
|
} else {
|
|
ret = krb5_generate_random_keyblock (context->context,
|
|
keys[i].key.keytype,
|
|
&kblock[i]);
|
|
if (ret)
|
|
goto out;
|
|
|
|
if (is_des_key_p(keys[i].key.keytype))
|
|
des_keyblock = i;
|
|
}
|
|
|
|
ret = krb5_copy_keyblock_contents (context->context,
|
|
&kblock[i],
|
|
&keys[i].key);
|
|
if (ret)
|
|
goto out;
|
|
}
|
|
|
|
out:
|
|
if(ret) {
|
|
for (i = 0; i < num_keys; ++i)
|
|
krb5_free_keyblock_contents (context->context, &kblock[i]);
|
|
free(kblock);
|
|
_kadm5_free_keys (context->context, num_keys, keys);
|
|
return ret;
|
|
}
|
|
|
|
_kadm5_free_keys (context->context, ent->keys.len, ent->keys.val);
|
|
ent->keys.val = keys;
|
|
ent->keys.len = num_keys;
|
|
if (n_keys && new_keys) {
|
|
*new_keys = kblock;
|
|
*n_keys = num_keys;
|
|
} else {
|
|
free(kblock);
|
|
}
|
|
|
|
hdb_entry_set_pw_change_time(context->context, ent, 0);
|
|
hdb_entry_clear_password(context->context, ent);
|
|
|
|
return 0;
|
|
}
|