2019-05-27 14:55:01 +08:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-or-later
|
2007-10-17 14:29:46 +08:00
|
|
|
/* Basic authentication token and access key management
|
2005-04-17 06:20:36 +08:00
|
|
|
*
|
2008-04-29 16:01:31 +08:00
|
|
|
* Copyright (C) 2004-2008 Red Hat, Inc. All Rights Reserved.
|
2005-04-17 06:20:36 +08:00
|
|
|
* Written by David Howells (dhowells@redhat.com)
|
|
|
|
*/
|
|
|
|
|
2018-12-10 04:36:29 +08:00
|
|
|
#include <linux/export.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <linux/init.h>
|
2006-06-27 17:53:54 +08:00
|
|
|
#include <linux/poison.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <linux/sched.h>
|
|
|
|
#include <linux/slab.h>
|
2005-10-31 07:02:44 +08:00
|
|
|
#include <linux/security.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <linux/workqueue.h>
|
2006-06-26 15:24:54 +08:00
|
|
|
#include <linux/random.h>
|
2019-12-12 00:47:05 +08:00
|
|
|
#include <linux/ima.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <linux/err.h>
|
|
|
|
#include "internal.h"
|
|
|
|
|
2011-08-22 21:09:11 +08:00
|
|
|
struct kmem_cache *key_jar;
|
2005-04-17 06:20:36 +08:00
|
|
|
struct rb_root key_serial_tree; /* tree of keys indexed by serial */
|
|
|
|
DEFINE_SPINLOCK(key_serial_lock);
|
|
|
|
|
|
|
|
struct rb_root key_user_tree; /* tree of quota records indexed by UID */
|
|
|
|
DEFINE_SPINLOCK(key_user_lock);
|
|
|
|
|
2014-09-02 20:52:05 +08:00
|
|
|
unsigned int key_quota_root_maxkeys = 1000000; /* root's key count quota */
|
|
|
|
unsigned int key_quota_root_maxbytes = 25000000; /* root's key space quota */
|
2008-04-29 16:01:32 +08:00
|
|
|
unsigned int key_quota_maxkeys = 200; /* general key count quota */
|
|
|
|
unsigned int key_quota_maxbytes = 20000; /* general key space quota */
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
static LIST_HEAD(key_types_list);
|
|
|
|
static DECLARE_RWSEM(key_types_sem);
|
|
|
|
|
2011-01-21 00:38:33 +08:00
|
|
|
/* We serialise key instantiation and link */
|
2007-10-17 14:29:46 +08:00
|
|
|
DEFINE_MUTEX(key_construction_mutex);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
#ifdef KEY_DEBUGGING
|
|
|
|
void __key_check(const struct key *key)
|
|
|
|
{
|
|
|
|
printk("__key_check: key %p {%08x} should be {%08x}\n",
|
|
|
|
key, key->magic, KEY_DEBUG_MAGIC);
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
2011-01-21 00:38:33 +08:00
|
|
|
* Get the key quota record for a user, allocating a new record if one doesn't
|
|
|
|
* already exist.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
2012-02-08 23:53:04 +08:00
|
|
|
struct key_user *key_user_lookup(kuid_t uid)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
struct key_user *candidate = NULL, *user;
|
2017-09-19 02:37:39 +08:00
|
|
|
struct rb_node *parent, **p;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2011-01-21 00:38:33 +08:00
|
|
|
try_again:
|
2017-09-19 02:37:39 +08:00
|
|
|
parent = NULL;
|
2005-04-17 06:20:36 +08:00
|
|
|
p = &key_user_tree.rb_node;
|
|
|
|
spin_lock(&key_user_lock);
|
|
|
|
|
|
|
|
/* search the tree for a user record with a matching UID */
|
|
|
|
while (*p) {
|
|
|
|
parent = *p;
|
|
|
|
user = rb_entry(parent, struct key_user, node);
|
|
|
|
|
2012-02-08 23:53:04 +08:00
|
|
|
if (uid_lt(uid, user->uid))
|
2005-04-17 06:20:36 +08:00
|
|
|
p = &(*p)->rb_left;
|
2012-02-08 23:53:04 +08:00
|
|
|
else if (uid_gt(uid, user->uid))
|
2009-02-27 08:27:38 +08:00
|
|
|
p = &(*p)->rb_right;
|
2005-04-17 06:20:36 +08:00
|
|
|
else
|
|
|
|
goto found;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* if we get here, we failed to find a match in the tree */
|
|
|
|
if (!candidate) {
|
|
|
|
/* allocate a candidate user record if we don't already have
|
|
|
|
* one */
|
|
|
|
spin_unlock(&key_user_lock);
|
|
|
|
|
|
|
|
user = NULL;
|
|
|
|
candidate = kmalloc(sizeof(struct key_user), GFP_KERNEL);
|
|
|
|
if (unlikely(!candidate))
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
/* the allocation may have scheduled, so we need to repeat the
|
|
|
|
* search lest someone else added the record whilst we were
|
|
|
|
* asleep */
|
|
|
|
goto try_again;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* if we get here, then the user record still hadn't appeared on the
|
|
|
|
* second pass - so we use the candidate record */
|
2017-03-31 20:20:49 +08:00
|
|
|
refcount_set(&candidate->usage, 1);
|
2005-04-17 06:20:36 +08:00
|
|
|
atomic_set(&candidate->nkeys, 0);
|
|
|
|
atomic_set(&candidate->nikeys, 0);
|
|
|
|
candidate->uid = uid;
|
|
|
|
candidate->qnkeys = 0;
|
|
|
|
candidate->qnbytes = 0;
|
|
|
|
spin_lock_init(&candidate->lock);
|
2007-10-17 14:29:46 +08:00
|
|
|
mutex_init(&candidate->cons_lock);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
rb_link_node(&candidate->node, parent, p);
|
|
|
|
rb_insert_color(&candidate->node, &key_user_tree);
|
|
|
|
spin_unlock(&key_user_lock);
|
|
|
|
user = candidate;
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
/* okay - we found a user record for this UID */
|
2011-01-21 00:38:33 +08:00
|
|
|
found:
|
2017-03-31 20:20:49 +08:00
|
|
|
refcount_inc(&user->usage);
|
2005-04-17 06:20:36 +08:00
|
|
|
spin_unlock(&key_user_lock);
|
2005-11-07 17:01:35 +08:00
|
|
|
kfree(candidate);
|
2011-01-21 00:38:33 +08:00
|
|
|
out:
|
2005-04-17 06:20:36 +08:00
|
|
|
return user;
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/*
|
2011-01-21 00:38:33 +08:00
|
|
|
* Dispose of a user structure
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
void key_user_put(struct key_user *user)
|
|
|
|
{
|
2017-03-31 20:20:49 +08:00
|
|
|
if (refcount_dec_and_lock(&user->usage, &key_user_lock)) {
|
2005-04-17 06:20:36 +08:00
|
|
|
rb_erase(&user->node, &key_user_tree);
|
|
|
|
spin_unlock(&key_user_lock);
|
|
|
|
|
|
|
|
kfree(user);
|
|
|
|
}
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/*
|
2011-01-21 00:38:33 +08:00
|
|
|
* Allocate a serial number for a key. These are assigned randomly to avoid
|
|
|
|
* security issues through covert channel problems.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
static inline void key_alloc_serial(struct key *key)
|
|
|
|
{
|
|
|
|
struct rb_node *parent, **p;
|
|
|
|
struct key *xkey;
|
|
|
|
|
2006-06-26 15:24:54 +08:00
|
|
|
/* propose a random serial number and look for a hole for it in the
|
2005-04-17 06:20:36 +08:00
|
|
|
* serial number tree */
|
2006-06-26 15:24:54 +08:00
|
|
|
do {
|
|
|
|
get_random_bytes(&key->serial, sizeof(key->serial));
|
|
|
|
|
|
|
|
key->serial >>= 1; /* negative numbers are not permitted */
|
|
|
|
} while (key->serial < 3);
|
|
|
|
|
|
|
|
spin_lock(&key_serial_lock);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2007-02-06 21:45:51 +08:00
|
|
|
attempt_insertion:
|
2005-04-17 06:20:36 +08:00
|
|
|
parent = NULL;
|
|
|
|
p = &key_serial_tree.rb_node;
|
|
|
|
|
|
|
|
while (*p) {
|
|
|
|
parent = *p;
|
|
|
|
xkey = rb_entry(parent, struct key, serial_node);
|
|
|
|
|
|
|
|
if (key->serial < xkey->serial)
|
|
|
|
p = &(*p)->rb_left;
|
|
|
|
else if (key->serial > xkey->serial)
|
|
|
|
p = &(*p)->rb_right;
|
|
|
|
else
|
|
|
|
goto serial_exists;
|
|
|
|
}
|
2007-02-06 21:45:51 +08:00
|
|
|
|
|
|
|
/* we've found a suitable hole - arrange for this key to occupy it */
|
|
|
|
rb_link_node(&key->serial_node, parent, p);
|
|
|
|
rb_insert_color(&key->serial_node, &key_serial_tree);
|
|
|
|
|
|
|
|
spin_unlock(&key_serial_lock);
|
|
|
|
return;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/* we found a key with the proposed serial number - walk the tree from
|
|
|
|
* that point looking for the next unused serial number */
|
2006-06-26 15:24:54 +08:00
|
|
|
serial_exists:
|
2005-04-17 06:20:36 +08:00
|
|
|
for (;;) {
|
2006-06-26 15:24:54 +08:00
|
|
|
key->serial++;
|
2007-02-06 21:45:51 +08:00
|
|
|
if (key->serial < 3) {
|
|
|
|
key->serial = 3;
|
|
|
|
goto attempt_insertion;
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
parent = rb_next(parent);
|
|
|
|
if (!parent)
|
2007-02-06 21:45:51 +08:00
|
|
|
goto attempt_insertion;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
xkey = rb_entry(parent, struct key, serial_node);
|
|
|
|
if (key->serial < xkey->serial)
|
2007-02-06 21:45:51 +08:00
|
|
|
goto attempt_insertion;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2011-01-21 00:38:33 +08:00
|
|
|
/**
|
|
|
|
* key_alloc - Allocate a key of the specified type.
|
|
|
|
* @type: The type of key to allocate.
|
|
|
|
* @desc: The key description to allow the key to be searched out.
|
|
|
|
* @uid: The owner of the new key.
|
|
|
|
* @gid: The group ID for the new key's group permissions.
|
|
|
|
* @cred: The credentials specifying UID namespace.
|
2019-07-11 09:43:43 +08:00
|
|
|
* @perm: The permissions mask of the new key.
|
2011-01-21 00:38:33 +08:00
|
|
|
* @flags: Flags specifying quota properties.
|
2016-09-01 07:05:43 +08:00
|
|
|
* @restrict_link: Optional link restriction for new keyrings.
|
2011-01-21 00:38:33 +08:00
|
|
|
*
|
|
|
|
* Allocate a key of the specified type with the attributes given. The key is
|
|
|
|
* returned in an uninstantiated state and the caller needs to instantiate the
|
|
|
|
* key before returning.
|
|
|
|
*
|
2016-09-01 07:05:43 +08:00
|
|
|
* The restrict_link structure (if not NULL) will be freed when the
|
|
|
|
* keyring is destroyed, so it must be dynamically allocated.
|
|
|
|
*
|
2011-01-21 00:38:33 +08:00
|
|
|
* The user's key count quota is updated to reflect the creation of the key and
|
|
|
|
* the user's key data quota has the default for the key type reserved. The
|
|
|
|
* instantiation function should amend this as necessary. If insufficient
|
|
|
|
* quota is available, -EDQUOT will be returned.
|
|
|
|
*
|
|
|
|
* The LSM security modules can prevent a key being created, in which case
|
|
|
|
* -EACCES will be returned.
|
|
|
|
*
|
|
|
|
* Returns a pointer to the new key if successful and an error code otherwise.
|
|
|
|
*
|
|
|
|
* Note that the caller needs to ensure the key type isn't uninstantiated.
|
|
|
|
* Internally this can be done by locking key_types_sem. Externally, this can
|
|
|
|
* be done by either never unregistering the key type, or making sure
|
|
|
|
* key_alloc() calls don't race with module unloading.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
struct key *key_alloc(struct key_type *type, const char *desc,
|
2012-02-08 23:53:04 +08:00
|
|
|
kuid_t uid, kgid_t gid, const struct cred *cred,
|
2019-07-11 09:43:43 +08:00
|
|
|
key_perm_t perm, unsigned long flags,
|
2016-09-01 07:05:43 +08:00
|
|
|
struct key_restriction *restrict_link)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
struct key_user *user = NULL;
|
|
|
|
struct key *key;
|
|
|
|
size_t desclen, quotalen;
|
2005-10-31 07:02:44 +08:00
|
|
|
int ret;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
key = ERR_PTR(-EINVAL);
|
|
|
|
if (!desc || !*desc)
|
|
|
|
goto error;
|
|
|
|
|
2011-03-07 23:05:59 +08:00
|
|
|
if (type->vet_description) {
|
|
|
|
ret = type->vet_description(desc);
|
|
|
|
if (ret < 0) {
|
|
|
|
key = ERR_PTR(ret);
|
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-09-24 17:35:15 +08:00
|
|
|
desclen = strlen(desc);
|
|
|
|
quotalen = desclen + 1 + type->def_datalen;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/* get hold of the key tracking for this user */
|
2012-02-08 23:53:04 +08:00
|
|
|
user = key_user_lookup(uid);
|
2005-04-17 06:20:36 +08:00
|
|
|
if (!user)
|
|
|
|
goto no_memory_1;
|
|
|
|
|
|
|
|
/* check that the user's quota permits allocation of another key and
|
|
|
|
* its description */
|
2006-06-26 15:24:50 +08:00
|
|
|
if (!(flags & KEY_ALLOC_NOT_IN_QUOTA)) {
|
2012-02-08 23:53:04 +08:00
|
|
|
unsigned maxkeys = uid_eq(uid, GLOBAL_ROOT_UID) ?
|
2008-04-29 16:01:32 +08:00
|
|
|
key_quota_root_maxkeys : key_quota_maxkeys;
|
2012-02-08 23:53:04 +08:00
|
|
|
unsigned maxbytes = uid_eq(uid, GLOBAL_ROOT_UID) ?
|
2008-04-29 16:01:32 +08:00
|
|
|
key_quota_root_maxbytes : key_quota_maxbytes;
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
spin_lock(&user->lock);
|
2006-06-26 15:24:50 +08:00
|
|
|
if (!(flags & KEY_ALLOC_QUOTA_OVERRUN)) {
|
2019-02-15 00:20:01 +08:00
|
|
|
if (user->qnkeys + 1 > maxkeys ||
|
|
|
|
user->qnbytes + quotalen > maxbytes ||
|
2008-04-29 16:01:32 +08:00
|
|
|
user->qnbytes + quotalen < user->qnbytes)
|
2006-06-26 15:24:50 +08:00
|
|
|
goto no_quota;
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
user->qnkeys++;
|
|
|
|
user->qnbytes += quotalen;
|
|
|
|
spin_unlock(&user->lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* allocate and initialise the key and its description */
|
2013-12-02 19:24:18 +08:00
|
|
|
key = kmem_cache_zalloc(key_jar, GFP_KERNEL);
|
2005-04-17 06:20:36 +08:00
|
|
|
if (!key)
|
|
|
|
goto no_memory_2;
|
|
|
|
|
2014-12-12 03:59:38 +08:00
|
|
|
key->index_key.desc_len = desclen;
|
|
|
|
key->index_key.description = kmemdup(desc, desclen + 1, GFP_KERNEL);
|
2015-10-21 21:04:47 +08:00
|
|
|
if (!key->index_key.description)
|
2014-12-12 03:59:38 +08:00
|
|
|
goto no_memory_3;
|
2019-06-27 04:02:32 +08:00
|
|
|
key->index_key.type = type;
|
2019-06-27 04:02:31 +08:00
|
|
|
key_set_index_key(&key->index_key);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2017-03-31 20:20:48 +08:00
|
|
|
refcount_set(&key->usage, 1);
|
2005-04-17 06:20:36 +08:00
|
|
|
init_rwsem(&key->sem);
|
2011-11-16 19:15:54 +08:00
|
|
|
lockdep_set_class(&key->sem, &type->lock_class);
|
2005-04-17 06:20:36 +08:00
|
|
|
key->user = user;
|
|
|
|
key->quotalen = quotalen;
|
|
|
|
key->datalen = type->def_datalen;
|
|
|
|
key->uid = uid;
|
|
|
|
key->gid = gid;
|
2019-07-11 09:43:43 +08:00
|
|
|
key->perm = perm;
|
KEYS: Add a facility to restrict new links into a keyring
Add a facility whereby proposed new links to be added to a keyring can be
vetted, permitting them to be rejected if necessary. This can be used to
block public keys from which the signature cannot be verified or for which
the signature verification fails. It could also be used to provide
blacklisting.
This affects operations like add_key(), KEYCTL_LINK and KEYCTL_INSTANTIATE.
To this end:
(1) A function pointer is added to the key struct that, if set, points to
the vetting function. This is called as:
int (*restrict_link)(struct key *keyring,
const struct key_type *key_type,
unsigned long key_flags,
const union key_payload *key_payload),
where 'keyring' will be the keyring being added to, key_type and
key_payload will describe the key being added and key_flags[*] can be
AND'ed with KEY_FLAG_TRUSTED.
[*] This parameter will be removed in a later patch when
KEY_FLAG_TRUSTED is removed.
The function should return 0 to allow the link to take place or an
error (typically -ENOKEY, -ENOPKG or -EKEYREJECTED) to reject the
link.
The pointer should not be set directly, but rather should be set
through keyring_alloc().
Note that if called during add_key(), preparse is called before this
method, but a key isn't actually allocated until after this function
is called.
(2) KEY_ALLOC_BYPASS_RESTRICTION is added. This can be passed to
key_create_or_update() or key_instantiate_and_link() to bypass the
restriction check.
(3) KEY_FLAG_TRUSTED_ONLY is removed. The entire contents of a keyring
with this restriction emplaced can be considered 'trustworthy' by
virtue of being in the keyring when that keyring is consulted.
(4) key_alloc() and keyring_alloc() take an extra argument that will be
used to set restrict_link in the new key. This ensures that the
pointer is set before the key is published, thus preventing a window
of unrestrictedness. Normally this argument will be NULL.
(5) As a temporary affair, keyring_restrict_trusted_only() is added. It
should be passed to keyring_alloc() as the extra argument instead of
setting KEY_FLAG_TRUSTED_ONLY on a keyring. This will be replaced in
a later patch with functions that look in the appropriate places for
authoritative keys.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: Mimi Zohar <zohar@linux.vnet.ibm.com>
2016-04-06 23:14:24 +08:00
|
|
|
key->restrict_link = restrict_link;
|
2019-02-15 00:20:37 +08:00
|
|
|
key->last_used_at = ktime_get_real_seconds();
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2006-06-26 15:24:50 +08:00
|
|
|
if (!(flags & KEY_ALLOC_NOT_IN_QUOTA))
|
2005-06-24 13:00:49 +08:00
|
|
|
key->flags |= 1 << KEY_FLAG_IN_QUOTA;
|
2016-02-10 00:40:46 +08:00
|
|
|
if (flags & KEY_ALLOC_BUILT_IN)
|
|
|
|
key->flags |= 1 << KEY_FLAG_BUILTIN;
|
2017-09-19 02:37:03 +08:00
|
|
|
if (flags & KEY_ALLOC_UID_KEYRING)
|
|
|
|
key->flags |= 1 << KEY_FLAG_UID_KEYRING;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
#ifdef KEY_DEBUGGING
|
|
|
|
key->magic = KEY_DEBUG_MAGIC;
|
|
|
|
#endif
|
|
|
|
|
2005-10-31 07:02:44 +08:00
|
|
|
/* let the security module know about the key */
|
CRED: Inaugurate COW credentials
Inaugurate copy-on-write credentials management. This uses RCU to manage the
credentials pointer in the task_struct with respect to accesses by other tasks.
A process may only modify its own credentials, and so does not need locking to
access or modify its own credentials.
A mutex (cred_replace_mutex) is added to the task_struct to control the effect
of PTRACE_ATTACHED on credential calculations, particularly with respect to
execve().
With this patch, the contents of an active credentials struct may not be
changed directly; rather a new set of credentials must be prepared, modified
and committed using something like the following sequence of events:
struct cred *new = prepare_creds();
int ret = blah(new);
if (ret < 0) {
abort_creds(new);
return ret;
}
return commit_creds(new);
There are some exceptions to this rule: the keyrings pointed to by the active
credentials may be instantiated - keyrings violate the COW rule as managing
COW keyrings is tricky, given that it is possible for a task to directly alter
the keys in a keyring in use by another task.
To help enforce this, various pointers to sets of credentials, such as those in
the task_struct, are declared const. The purpose of this is compile-time
discouragement of altering credentials through those pointers. Once a set of
credentials has been made public through one of these pointers, it may not be
modified, except under special circumstances:
(1) Its reference count may incremented and decremented.
(2) The keyrings to which it points may be modified, but not replaced.
The only safe way to modify anything else is to create a replacement and commit
using the functions described in Documentation/credentials.txt (which will be
added by a later patch).
This patch and the preceding patches have been tested with the LTP SELinux
testsuite.
This patch makes several logical sets of alteration:
(1) execve().
This now prepares and commits credentials in various places in the
security code rather than altering the current creds directly.
(2) Temporary credential overrides.
do_coredump() and sys_faccessat() now prepare their own credentials and
temporarily override the ones currently on the acting thread, whilst
preventing interference from other threads by holding cred_replace_mutex
on the thread being dumped.
This will be replaced in a future patch by something that hands down the
credentials directly to the functions being called, rather than altering
the task's objective credentials.
(3) LSM interface.
A number of functions have been changed, added or removed:
(*) security_capset_check(), ->capset_check()
(*) security_capset_set(), ->capset_set()
Removed in favour of security_capset().
(*) security_capset(), ->capset()
New. This is passed a pointer to the new creds, a pointer to the old
creds and the proposed capability sets. It should fill in the new
creds or return an error. All pointers, barring the pointer to the
new creds, are now const.
(*) security_bprm_apply_creds(), ->bprm_apply_creds()
Changed; now returns a value, which will cause the process to be
killed if it's an error.
(*) security_task_alloc(), ->task_alloc_security()
Removed in favour of security_prepare_creds().
(*) security_cred_free(), ->cred_free()
New. Free security data attached to cred->security.
(*) security_prepare_creds(), ->cred_prepare()
New. Duplicate any security data attached to cred->security.
(*) security_commit_creds(), ->cred_commit()
New. Apply any security effects for the upcoming installation of new
security by commit_creds().
(*) security_task_post_setuid(), ->task_post_setuid()
Removed in favour of security_task_fix_setuid().
(*) security_task_fix_setuid(), ->task_fix_setuid()
Fix up the proposed new credentials for setuid(). This is used by
cap_set_fix_setuid() to implicitly adjust capabilities in line with
setuid() changes. Changes are made to the new credentials, rather
than the task itself as in security_task_post_setuid().
(*) security_task_reparent_to_init(), ->task_reparent_to_init()
Removed. Instead the task being reparented to init is referred
directly to init's credentials.
NOTE! This results in the loss of some state: SELinux's osid no
longer records the sid of the thread that forked it.
(*) security_key_alloc(), ->key_alloc()
(*) security_key_permission(), ->key_permission()
Changed. These now take cred pointers rather than task pointers to
refer to the security context.
(4) sys_capset().
This has been simplified and uses less locking. The LSM functions it
calls have been merged.
(5) reparent_to_kthreadd().
This gives the current thread the same credentials as init by simply using
commit_thread() to point that way.
(6) __sigqueue_alloc() and switch_uid()
__sigqueue_alloc() can't stop the target task from changing its creds
beneath it, so this function gets a reference to the currently applicable
user_struct which it then passes into the sigqueue struct it returns if
successful.
switch_uid() is now called from commit_creds(), and possibly should be
folded into that. commit_creds() should take care of protecting
__sigqueue_alloc().
(7) [sg]et[ug]id() and co and [sg]et_current_groups.
The set functions now all use prepare_creds(), commit_creds() and
abort_creds() to build and check a new set of credentials before applying
it.
security_task_set[ug]id() is called inside the prepared section. This
guarantees that nothing else will affect the creds until we've finished.
The calling of set_dumpable() has been moved into commit_creds().
Much of the functionality of set_user() has been moved into
commit_creds().
The get functions all simply access the data directly.
(8) security_task_prctl() and cap_task_prctl().
security_task_prctl() has been modified to return -ENOSYS if it doesn't
want to handle a function, or otherwise return the return value directly
rather than through an argument.
Additionally, cap_task_prctl() now prepares a new set of credentials, even
if it doesn't end up using it.
(9) Keyrings.
A number of changes have been made to the keyrings code:
(a) switch_uid_keyring(), copy_keys(), exit_keys() and suid_keys() have
all been dropped and built in to the credentials functions directly.
They may want separating out again later.
(b) key_alloc() and search_process_keyrings() now take a cred pointer
rather than a task pointer to specify the security context.
(c) copy_creds() gives a new thread within the same thread group a new
thread keyring if its parent had one, otherwise it discards the thread
keyring.
(d) The authorisation key now points directly to the credentials to extend
the search into rather pointing to the task that carries them.
(e) Installing thread, process or session keyrings causes a new set of
credentials to be created, even though it's not strictly necessary for
process or session keyrings (they're shared).
(10) Usermode helper.
The usermode helper code now carries a cred struct pointer in its
subprocess_info struct instead of a new session keyring pointer. This set
of credentials is derived from init_cred and installed on the new process
after it has been cloned.
call_usermodehelper_setup() allocates the new credentials and
call_usermodehelper_freeinfo() discards them if they haven't been used. A
special cred function (prepare_usermodeinfo_creds()) is provided
specifically for call_usermodehelper_setup() to call.
call_usermodehelper_setkeys() adjusts the credentials to sport the
supplied keyring as the new session keyring.
(11) SELinux.
SELinux has a number of changes, in addition to those to support the LSM
interface changes mentioned above:
(a) selinux_setprocattr() no longer does its check for whether the
current ptracer can access processes with the new SID inside the lock
that covers getting the ptracer's SID. Whilst this lock ensures that
the check is done with the ptracer pinned, the result is only valid
until the lock is released, so there's no point doing it inside the
lock.
(12) is_single_threaded().
This function has been extracted from selinux_setprocattr() and put into
a file of its own in the lib/ directory as join_session_keyring() now
wants to use it too.
The code in SELinux just checked to see whether a task shared mm_structs
with other tasks (CLONE_VM), but that isn't good enough. We really want
to know if they're part of the same thread group (CLONE_THREAD).
(13) nfsd.
The NFS server daemon now has to use the COW credentials to set the
credentials it is going to use. It really needs to pass the credentials
down to the functions it calls, but it can't do that until other patches
in this series have been applied.
Signed-off-by: David Howells <dhowells@redhat.com>
Acked-by: James Morris <jmorris@namei.org>
Signed-off-by: James Morris <jmorris@namei.org>
2008-11-14 07:39:23 +08:00
|
|
|
ret = security_key_alloc(key, cred, flags);
|
2005-10-31 07:02:44 +08:00
|
|
|
if (ret < 0)
|
|
|
|
goto security_error;
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/* publish the key by giving it a serial number */
|
2019-06-27 04:02:32 +08:00
|
|
|
refcount_inc(&key->domain_tag->usage);
|
2005-04-17 06:20:36 +08:00
|
|
|
atomic_inc(&user->nkeys);
|
|
|
|
key_alloc_serial(key);
|
|
|
|
|
2005-10-31 07:02:44 +08:00
|
|
|
error:
|
2005-04-17 06:20:36 +08:00
|
|
|
return key;
|
|
|
|
|
2005-10-31 07:02:44 +08:00
|
|
|
security_error:
|
|
|
|
kfree(key->description);
|
2005-04-17 06:20:36 +08:00
|
|
|
kmem_cache_free(key_jar, key);
|
2006-06-26 15:24:50 +08:00
|
|
|
if (!(flags & KEY_ALLOC_NOT_IN_QUOTA)) {
|
2005-04-17 06:20:36 +08:00
|
|
|
spin_lock(&user->lock);
|
|
|
|
user->qnkeys--;
|
|
|
|
user->qnbytes -= quotalen;
|
|
|
|
spin_unlock(&user->lock);
|
|
|
|
}
|
|
|
|
key_user_put(user);
|
2005-10-31 07:02:44 +08:00
|
|
|
key = ERR_PTR(ret);
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
no_memory_3:
|
|
|
|
kmem_cache_free(key_jar, key);
|
|
|
|
no_memory_2:
|
2006-06-26 15:24:50 +08:00
|
|
|
if (!(flags & KEY_ALLOC_NOT_IN_QUOTA)) {
|
2005-10-31 07:02:44 +08:00
|
|
|
spin_lock(&user->lock);
|
|
|
|
user->qnkeys--;
|
|
|
|
user->qnbytes -= quotalen;
|
|
|
|
spin_unlock(&user->lock);
|
|
|
|
}
|
|
|
|
key_user_put(user);
|
|
|
|
no_memory_1:
|
2005-04-17 06:20:36 +08:00
|
|
|
key = ERR_PTR(-ENOMEM);
|
|
|
|
goto error;
|
|
|
|
|
2005-10-31 07:02:44 +08:00
|
|
|
no_quota:
|
2005-04-17 06:20:36 +08:00
|
|
|
spin_unlock(&user->lock);
|
|
|
|
key_user_put(user);
|
|
|
|
key = ERR_PTR(-EDQUOT);
|
|
|
|
goto error;
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
EXPORT_SYMBOL(key_alloc);
|
|
|
|
|
2011-01-21 00:38:33 +08:00
|
|
|
/**
|
|
|
|
* key_payload_reserve - Adjust data quota reservation for the key's payload
|
|
|
|
* @key: The key to make the reservation for.
|
|
|
|
* @datalen: The amount of data payload the caller now wants.
|
|
|
|
*
|
|
|
|
* Adjust the amount of the owning user's key data quota that a key reserves.
|
|
|
|
* If the amount is increased, then -EDQUOT may be returned if there isn't
|
|
|
|
* enough free quota available.
|
|
|
|
*
|
|
|
|
* If successful, 0 is returned.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
int key_payload_reserve(struct key *key, size_t datalen)
|
|
|
|
{
|
2010-04-21 15:02:11 +08:00
|
|
|
int delta = (int)datalen - key->datalen;
|
2005-04-17 06:20:36 +08:00
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
key_check(key);
|
|
|
|
|
|
|
|
/* contemplate the quota adjustment */
|
2005-06-24 13:00:49 +08:00
|
|
|
if (delta != 0 && test_bit(KEY_FLAG_IN_QUOTA, &key->flags)) {
|
2012-02-08 23:53:04 +08:00
|
|
|
unsigned maxbytes = uid_eq(key->user->uid, GLOBAL_ROOT_UID) ?
|
2008-04-29 16:01:32 +08:00
|
|
|
key_quota_root_maxbytes : key_quota_maxbytes;
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
spin_lock(&key->user->lock);
|
|
|
|
|
|
|
|
if (delta > 0 &&
|
2020-02-28 12:41:51 +08:00
|
|
|
(key->user->qnbytes + delta > maxbytes ||
|
2008-04-29 16:01:32 +08:00
|
|
|
key->user->qnbytes + delta < key->user->qnbytes)) {
|
2005-04-17 06:20:36 +08:00
|
|
|
ret = -EDQUOT;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
key->user->qnbytes += delta;
|
|
|
|
key->quotalen += delta;
|
|
|
|
}
|
|
|
|
spin_unlock(&key->user->lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* change the recorded data length if that didn't generate an error */
|
|
|
|
if (ret == 0)
|
|
|
|
key->datalen = datalen;
|
|
|
|
|
|
|
|
return ret;
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
EXPORT_SYMBOL(key_payload_reserve);
|
|
|
|
|
2017-10-04 23:43:25 +08:00
|
|
|
/*
|
|
|
|
* Change the key state to being instantiated.
|
|
|
|
*/
|
|
|
|
static void mark_key_instantiated(struct key *key, int reject_error)
|
|
|
|
{
|
|
|
|
/* Commit the payload before setting the state; barrier versus
|
|
|
|
* key_read_state().
|
|
|
|
*/
|
|
|
|
smp_store_release(&key->state,
|
|
|
|
(reject_error < 0) ? reject_error : KEY_IS_POSITIVE);
|
|
|
|
}
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
2011-01-21 00:38:33 +08:00
|
|
|
* Instantiate a key and link it into the target keyring atomically. Must be
|
|
|
|
* called with the target keyring's semaphore writelocked. The target key's
|
|
|
|
* semaphore need not be locked as instantiation is serialised by
|
|
|
|
* key_construction_mutex.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
static int __key_instantiate_and_link(struct key *key,
|
2012-09-13 20:06:29 +08:00
|
|
|
struct key_preparsed_payload *prep,
|
[PATCH] Keys: Make request-key create an authorisation key
The attached patch makes the following changes:
(1) There's a new special key type called ".request_key_auth".
This is an authorisation key for when one process requests a key and
another process is started to construct it. This type of key cannot be
created by the user; nor can it be requested by kernel services.
Authorisation keys hold two references:
(a) Each refers to a key being constructed. When the key being
constructed is instantiated the authorisation key is revoked,
rendering it of no further use.
(b) The "authorising process". This is either:
(i) the process that called request_key(), or:
(ii) if the process that called request_key() itself had an
authorisation key in its session keyring, then the authorising
process referred to by that authorisation key will also be
referred to by the new authorisation key.
This means that the process that initiated a chain of key requests
will authorise the lot of them, and will, by default, wind up with
the keys obtained from them in its keyrings.
(2) request_key() creates an authorisation key which is then passed to
/sbin/request-key in as part of a new session keyring.
(3) When request_key() is searching for a key to hand back to the caller, if
it comes across an authorisation key in the session keyring of the
calling process, it will also search the keyrings of the process
specified therein and it will use the specified process's credentials
(fsuid, fsgid, groups) to do that rather than the calling process's
credentials.
This allows a process started by /sbin/request-key to find keys belonging
to the authorising process.
(4) A key can be read, even if the process executing KEYCTL_READ doesn't have
direct read or search permission if that key is contained within the
keyrings of a process specified by an authorisation key found within the
calling process's session keyring, and is searchable using the
credentials of the authorising process.
This allows a process started by /sbin/request-key to read keys belonging
to the authorising process.
(5) The magic KEY_SPEC_*_KEYRING key IDs when passed to KEYCTL_INSTANTIATE or
KEYCTL_NEGATE will specify a keyring of the authorising process, rather
than the process doing the instantiation.
(6) One of the process keyrings can be nominated as the default to which
request_key() should attach new keys if not otherwise specified. This is
done with KEYCTL_SET_REQKEY_KEYRING and one of the KEY_REQKEY_DEFL_*
constants. The current setting can also be read using this call.
(7) request_key() is partially interruptible. If it is waiting for another
process to finish constructing a key, it can be interrupted. This permits
a request-key cycle to be broken without recourse to rebooting.
Signed-Off-By: David Howells <dhowells@redhat.com>
Signed-Off-By: Benoit Boissinot <benoit.boissinot@ens-lyon.org>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-24 13:00:56 +08:00
|
|
|
struct key *keyring,
|
2010-04-30 21:32:39 +08:00
|
|
|
struct key *authkey,
|
2013-09-24 17:35:18 +08:00
|
|
|
struct assoc_array_edit **_edit)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
int ret, awaken;
|
|
|
|
|
|
|
|
key_check(key);
|
|
|
|
key_check(keyring);
|
|
|
|
|
|
|
|
awaken = 0;
|
|
|
|
ret = -EBUSY;
|
|
|
|
|
2007-10-17 14:29:46 +08:00
|
|
|
mutex_lock(&key_construction_mutex);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/* can't instantiate twice */
|
2017-10-04 23:43:25 +08:00
|
|
|
if (key->state == KEY_IS_UNINSTANTIATED) {
|
2005-04-17 06:20:36 +08:00
|
|
|
/* instantiate the key */
|
2012-09-13 20:06:29 +08:00
|
|
|
ret = key->type->instantiate(key, prep);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
if (ret == 0) {
|
|
|
|
/* mark the key as being instantiated */
|
|
|
|
atomic_inc(&key->user->nikeys);
|
2017-10-04 23:43:25 +08:00
|
|
|
mark_key_instantiated(key, 0);
|
watch_queue: Add a key/keyring notification facility
Add a key/keyring change notification facility whereby notifications about
changes in key and keyring content and attributes can be received.
Firstly, an event queue needs to be created:
pipe2(fds, O_NOTIFICATION_PIPE);
ioctl(fds[1], IOC_WATCH_QUEUE_SET_SIZE, 256);
then a notification can be set up to report notifications via that queue:
struct watch_notification_filter filter = {
.nr_filters = 1,
.filters = {
[0] = {
.type = WATCH_TYPE_KEY_NOTIFY,
.subtype_filter[0] = UINT_MAX,
},
},
};
ioctl(fds[1], IOC_WATCH_QUEUE_SET_FILTER, &filter);
keyctl_watch_key(KEY_SPEC_SESSION_KEYRING, fds[1], 0x01);
After that, records will be placed into the queue when events occur in
which keys are changed in some way. Records are of the following format:
struct key_notification {
struct watch_notification watch;
__u32 key_id;
__u32 aux;
} *n;
Where:
n->watch.type will be WATCH_TYPE_KEY_NOTIFY.
n->watch.subtype will indicate the type of event, such as
NOTIFY_KEY_REVOKED.
n->watch.info & WATCH_INFO_LENGTH will indicate the length of the
record.
n->watch.info & WATCH_INFO_ID will be the second argument to
keyctl_watch_key(), shifted.
n->key will be the ID of the affected key.
n->aux will hold subtype-dependent information, such as the key
being linked into the keyring specified by n->key in the case of
NOTIFY_KEY_LINKED.
Note that it is permissible for event records to be of variable length -
or, at least, the length may be dependent on the subtype. Note also that
the queue can be shared between multiple notifications of various types.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: James Morris <jamorris@linux.microsoft.com>
2020-01-15 01:07:11 +08:00
|
|
|
notify_key(key, NOTIFY_KEY_INSTANTIATED, 0);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2005-06-24 13:00:49 +08:00
|
|
|
if (test_and_clear_bit(KEY_FLAG_USER_CONSTRUCT, &key->flags))
|
2005-04-17 06:20:36 +08:00
|
|
|
awaken = 1;
|
|
|
|
|
|
|
|
/* and link it into the destination keyring */
|
2015-11-10 21:34:46 +08:00
|
|
|
if (keyring) {
|
2016-01-27 09:02:03 +08:00
|
|
|
if (test_bit(KEY_FLAG_KEEP, &keyring->flags))
|
|
|
|
set_bit(KEY_FLAG_KEEP, &key->flags);
|
2015-11-10 21:34:46 +08:00
|
|
|
|
watch_queue: Add a key/keyring notification facility
Add a key/keyring change notification facility whereby notifications about
changes in key and keyring content and attributes can be received.
Firstly, an event queue needs to be created:
pipe2(fds, O_NOTIFICATION_PIPE);
ioctl(fds[1], IOC_WATCH_QUEUE_SET_SIZE, 256);
then a notification can be set up to report notifications via that queue:
struct watch_notification_filter filter = {
.nr_filters = 1,
.filters = {
[0] = {
.type = WATCH_TYPE_KEY_NOTIFY,
.subtype_filter[0] = UINT_MAX,
},
},
};
ioctl(fds[1], IOC_WATCH_QUEUE_SET_FILTER, &filter);
keyctl_watch_key(KEY_SPEC_SESSION_KEYRING, fds[1], 0x01);
After that, records will be placed into the queue when events occur in
which keys are changed in some way. Records are of the following format:
struct key_notification {
struct watch_notification watch;
__u32 key_id;
__u32 aux;
} *n;
Where:
n->watch.type will be WATCH_TYPE_KEY_NOTIFY.
n->watch.subtype will indicate the type of event, such as
NOTIFY_KEY_REVOKED.
n->watch.info & WATCH_INFO_LENGTH will indicate the length of the
record.
n->watch.info & WATCH_INFO_ID will be the second argument to
keyctl_watch_key(), shifted.
n->key will be the ID of the affected key.
n->aux will hold subtype-dependent information, such as the key
being linked into the keyring specified by n->key in the case of
NOTIFY_KEY_LINKED.
Note that it is permissible for event records to be of variable length -
or, at least, the length may be dependent on the subtype. Note also that
the queue can be shared between multiple notifications of various types.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: James Morris <jamorris@linux.microsoft.com>
2020-01-15 01:07:11 +08:00
|
|
|
__key_link(keyring, key, _edit);
|
2015-11-10 21:34:46 +08:00
|
|
|
}
|
[PATCH] Keys: Make request-key create an authorisation key
The attached patch makes the following changes:
(1) There's a new special key type called ".request_key_auth".
This is an authorisation key for when one process requests a key and
another process is started to construct it. This type of key cannot be
created by the user; nor can it be requested by kernel services.
Authorisation keys hold two references:
(a) Each refers to a key being constructed. When the key being
constructed is instantiated the authorisation key is revoked,
rendering it of no further use.
(b) The "authorising process". This is either:
(i) the process that called request_key(), or:
(ii) if the process that called request_key() itself had an
authorisation key in its session keyring, then the authorising
process referred to by that authorisation key will also be
referred to by the new authorisation key.
This means that the process that initiated a chain of key requests
will authorise the lot of them, and will, by default, wind up with
the keys obtained from them in its keyrings.
(2) request_key() creates an authorisation key which is then passed to
/sbin/request-key in as part of a new session keyring.
(3) When request_key() is searching for a key to hand back to the caller, if
it comes across an authorisation key in the session keyring of the
calling process, it will also search the keyrings of the process
specified therein and it will use the specified process's credentials
(fsuid, fsgid, groups) to do that rather than the calling process's
credentials.
This allows a process started by /sbin/request-key to find keys belonging
to the authorising process.
(4) A key can be read, even if the process executing KEYCTL_READ doesn't have
direct read or search permission if that key is contained within the
keyrings of a process specified by an authorisation key found within the
calling process's session keyring, and is searchable using the
credentials of the authorising process.
This allows a process started by /sbin/request-key to read keys belonging
to the authorising process.
(5) The magic KEY_SPEC_*_KEYRING key IDs when passed to KEYCTL_INSTANTIATE or
KEYCTL_NEGATE will specify a keyring of the authorising process, rather
than the process doing the instantiation.
(6) One of the process keyrings can be nominated as the default to which
request_key() should attach new keys if not otherwise specified. This is
done with KEYCTL_SET_REQKEY_KEYRING and one of the KEY_REQKEY_DEFL_*
constants. The current setting can also be read using this call.
(7) request_key() is partially interruptible. If it is waiting for another
process to finish constructing a key, it can be interrupted. This permits
a request-key cycle to be broken without recourse to rebooting.
Signed-Off-By: David Howells <dhowells@redhat.com>
Signed-Off-By: Benoit Boissinot <benoit.boissinot@ens-lyon.org>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-24 13:00:56 +08:00
|
|
|
|
|
|
|
/* disable the authorisation key */
|
CRED: Inaugurate COW credentials
Inaugurate copy-on-write credentials management. This uses RCU to manage the
credentials pointer in the task_struct with respect to accesses by other tasks.
A process may only modify its own credentials, and so does not need locking to
access or modify its own credentials.
A mutex (cred_replace_mutex) is added to the task_struct to control the effect
of PTRACE_ATTACHED on credential calculations, particularly with respect to
execve().
With this patch, the contents of an active credentials struct may not be
changed directly; rather a new set of credentials must be prepared, modified
and committed using something like the following sequence of events:
struct cred *new = prepare_creds();
int ret = blah(new);
if (ret < 0) {
abort_creds(new);
return ret;
}
return commit_creds(new);
There are some exceptions to this rule: the keyrings pointed to by the active
credentials may be instantiated - keyrings violate the COW rule as managing
COW keyrings is tricky, given that it is possible for a task to directly alter
the keys in a keyring in use by another task.
To help enforce this, various pointers to sets of credentials, such as those in
the task_struct, are declared const. The purpose of this is compile-time
discouragement of altering credentials through those pointers. Once a set of
credentials has been made public through one of these pointers, it may not be
modified, except under special circumstances:
(1) Its reference count may incremented and decremented.
(2) The keyrings to which it points may be modified, but not replaced.
The only safe way to modify anything else is to create a replacement and commit
using the functions described in Documentation/credentials.txt (which will be
added by a later patch).
This patch and the preceding patches have been tested with the LTP SELinux
testsuite.
This patch makes several logical sets of alteration:
(1) execve().
This now prepares and commits credentials in various places in the
security code rather than altering the current creds directly.
(2) Temporary credential overrides.
do_coredump() and sys_faccessat() now prepare their own credentials and
temporarily override the ones currently on the acting thread, whilst
preventing interference from other threads by holding cred_replace_mutex
on the thread being dumped.
This will be replaced in a future patch by something that hands down the
credentials directly to the functions being called, rather than altering
the task's objective credentials.
(3) LSM interface.
A number of functions have been changed, added or removed:
(*) security_capset_check(), ->capset_check()
(*) security_capset_set(), ->capset_set()
Removed in favour of security_capset().
(*) security_capset(), ->capset()
New. This is passed a pointer to the new creds, a pointer to the old
creds and the proposed capability sets. It should fill in the new
creds or return an error. All pointers, barring the pointer to the
new creds, are now const.
(*) security_bprm_apply_creds(), ->bprm_apply_creds()
Changed; now returns a value, which will cause the process to be
killed if it's an error.
(*) security_task_alloc(), ->task_alloc_security()
Removed in favour of security_prepare_creds().
(*) security_cred_free(), ->cred_free()
New. Free security data attached to cred->security.
(*) security_prepare_creds(), ->cred_prepare()
New. Duplicate any security data attached to cred->security.
(*) security_commit_creds(), ->cred_commit()
New. Apply any security effects for the upcoming installation of new
security by commit_creds().
(*) security_task_post_setuid(), ->task_post_setuid()
Removed in favour of security_task_fix_setuid().
(*) security_task_fix_setuid(), ->task_fix_setuid()
Fix up the proposed new credentials for setuid(). This is used by
cap_set_fix_setuid() to implicitly adjust capabilities in line with
setuid() changes. Changes are made to the new credentials, rather
than the task itself as in security_task_post_setuid().
(*) security_task_reparent_to_init(), ->task_reparent_to_init()
Removed. Instead the task being reparented to init is referred
directly to init's credentials.
NOTE! This results in the loss of some state: SELinux's osid no
longer records the sid of the thread that forked it.
(*) security_key_alloc(), ->key_alloc()
(*) security_key_permission(), ->key_permission()
Changed. These now take cred pointers rather than task pointers to
refer to the security context.
(4) sys_capset().
This has been simplified and uses less locking. The LSM functions it
calls have been merged.
(5) reparent_to_kthreadd().
This gives the current thread the same credentials as init by simply using
commit_thread() to point that way.
(6) __sigqueue_alloc() and switch_uid()
__sigqueue_alloc() can't stop the target task from changing its creds
beneath it, so this function gets a reference to the currently applicable
user_struct which it then passes into the sigqueue struct it returns if
successful.
switch_uid() is now called from commit_creds(), and possibly should be
folded into that. commit_creds() should take care of protecting
__sigqueue_alloc().
(7) [sg]et[ug]id() and co and [sg]et_current_groups.
The set functions now all use prepare_creds(), commit_creds() and
abort_creds() to build and check a new set of credentials before applying
it.
security_task_set[ug]id() is called inside the prepared section. This
guarantees that nothing else will affect the creds until we've finished.
The calling of set_dumpable() has been moved into commit_creds().
Much of the functionality of set_user() has been moved into
commit_creds().
The get functions all simply access the data directly.
(8) security_task_prctl() and cap_task_prctl().
security_task_prctl() has been modified to return -ENOSYS if it doesn't
want to handle a function, or otherwise return the return value directly
rather than through an argument.
Additionally, cap_task_prctl() now prepares a new set of credentials, even
if it doesn't end up using it.
(9) Keyrings.
A number of changes have been made to the keyrings code:
(a) switch_uid_keyring(), copy_keys(), exit_keys() and suid_keys() have
all been dropped and built in to the credentials functions directly.
They may want separating out again later.
(b) key_alloc() and search_process_keyrings() now take a cred pointer
rather than a task pointer to specify the security context.
(c) copy_creds() gives a new thread within the same thread group a new
thread keyring if its parent had one, otherwise it discards the thread
keyring.
(d) The authorisation key now points directly to the credentials to extend
the search into rather pointing to the task that carries them.
(e) Installing thread, process or session keyrings causes a new set of
credentials to be created, even though it's not strictly necessary for
process or session keyrings (they're shared).
(10) Usermode helper.
The usermode helper code now carries a cred struct pointer in its
subprocess_info struct instead of a new session keyring pointer. This set
of credentials is derived from init_cred and installed on the new process
after it has been cloned.
call_usermodehelper_setup() allocates the new credentials and
call_usermodehelper_freeinfo() discards them if they haven't been used. A
special cred function (prepare_usermodeinfo_creds()) is provided
specifically for call_usermodehelper_setup() to call.
call_usermodehelper_setkeys() adjusts the credentials to sport the
supplied keyring as the new session keyring.
(11) SELinux.
SELinux has a number of changes, in addition to those to support the LSM
interface changes mentioned above:
(a) selinux_setprocattr() no longer does its check for whether the
current ptracer can access processes with the new SID inside the lock
that covers getting the ptracer's SID. Whilst this lock ensures that
the check is done with the ptracer pinned, the result is only valid
until the lock is released, so there's no point doing it inside the
lock.
(12) is_single_threaded().
This function has been extracted from selinux_setprocattr() and put into
a file of its own in the lib/ directory as join_session_keyring() now
wants to use it too.
The code in SELinux just checked to see whether a task shared mm_structs
with other tasks (CLONE_VM), but that isn't good enough. We really want
to know if they're part of the same thread group (CLONE_THREAD).
(13) nfsd.
The NFS server daemon now has to use the COW credentials to set the
credentials it is going to use. It really needs to pass the credentials
down to the functions it calls, but it can't do that until other patches
in this series have been applied.
Signed-off-by: David Howells <dhowells@redhat.com>
Acked-by: James Morris <jmorris@namei.org>
Signed-off-by: James Morris <jmorris@namei.org>
2008-11-14 07:39:23 +08:00
|
|
|
if (authkey)
|
2019-06-19 23:10:15 +08:00
|
|
|
key_invalidate(authkey);
|
2014-07-19 01:56:34 +08:00
|
|
|
|
2017-11-16 00:38:45 +08:00
|
|
|
if (prep->expiry != TIME64_MAX) {
|
2014-07-19 01:56:34 +08:00
|
|
|
key->expiry = prep->expiry;
|
|
|
|
key_schedule_gc(prep->expiry + key_gc_delay);
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-10-17 14:29:46 +08:00
|
|
|
mutex_unlock(&key_construction_mutex);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/* wake up anyone waiting for a key to be constructed */
|
|
|
|
if (awaken)
|
2007-10-17 14:29:46 +08:00
|
|
|
wake_up_bit(&key->flags, KEY_FLAG_USER_CONSTRUCT);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
return ret;
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2011-01-21 00:38:33 +08:00
|
|
|
/**
|
|
|
|
* key_instantiate_and_link - Instantiate a key and link it into the keyring.
|
|
|
|
* @key: The key to instantiate.
|
|
|
|
* @data: The data to use to instantiate the keyring.
|
|
|
|
* @datalen: The length of @data.
|
|
|
|
* @keyring: Keyring to create a link in on success (or NULL).
|
|
|
|
* @authkey: The authorisation token permitting instantiation.
|
|
|
|
*
|
|
|
|
* Instantiate a key that's in the uninstantiated state using the provided data
|
|
|
|
* and, if successful, link it in to the destination keyring if one is
|
|
|
|
* supplied.
|
|
|
|
*
|
|
|
|
* If successful, 0 is returned, the authorisation token is revoked and anyone
|
|
|
|
* waiting for the key is woken up. If the key was already instantiated,
|
|
|
|
* -EBUSY will be returned.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
int key_instantiate_and_link(struct key *key,
|
|
|
|
const void *data,
|
|
|
|
size_t datalen,
|
[PATCH] Keys: Make request-key create an authorisation key
The attached patch makes the following changes:
(1) There's a new special key type called ".request_key_auth".
This is an authorisation key for when one process requests a key and
another process is started to construct it. This type of key cannot be
created by the user; nor can it be requested by kernel services.
Authorisation keys hold two references:
(a) Each refers to a key being constructed. When the key being
constructed is instantiated the authorisation key is revoked,
rendering it of no further use.
(b) The "authorising process". This is either:
(i) the process that called request_key(), or:
(ii) if the process that called request_key() itself had an
authorisation key in its session keyring, then the authorising
process referred to by that authorisation key will also be
referred to by the new authorisation key.
This means that the process that initiated a chain of key requests
will authorise the lot of them, and will, by default, wind up with
the keys obtained from them in its keyrings.
(2) request_key() creates an authorisation key which is then passed to
/sbin/request-key in as part of a new session keyring.
(3) When request_key() is searching for a key to hand back to the caller, if
it comes across an authorisation key in the session keyring of the
calling process, it will also search the keyrings of the process
specified therein and it will use the specified process's credentials
(fsuid, fsgid, groups) to do that rather than the calling process's
credentials.
This allows a process started by /sbin/request-key to find keys belonging
to the authorising process.
(4) A key can be read, even if the process executing KEYCTL_READ doesn't have
direct read or search permission if that key is contained within the
keyrings of a process specified by an authorisation key found within the
calling process's session keyring, and is searchable using the
credentials of the authorising process.
This allows a process started by /sbin/request-key to read keys belonging
to the authorising process.
(5) The magic KEY_SPEC_*_KEYRING key IDs when passed to KEYCTL_INSTANTIATE or
KEYCTL_NEGATE will specify a keyring of the authorising process, rather
than the process doing the instantiation.
(6) One of the process keyrings can be nominated as the default to which
request_key() should attach new keys if not otherwise specified. This is
done with KEYCTL_SET_REQKEY_KEYRING and one of the KEY_REQKEY_DEFL_*
constants. The current setting can also be read using this call.
(7) request_key() is partially interruptible. If it is waiting for another
process to finish constructing a key, it can be interrupted. This permits
a request-key cycle to be broken without recourse to rebooting.
Signed-Off-By: David Howells <dhowells@redhat.com>
Signed-Off-By: Benoit Boissinot <benoit.boissinot@ens-lyon.org>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-24 13:00:56 +08:00
|
|
|
struct key *keyring,
|
CRED: Inaugurate COW credentials
Inaugurate copy-on-write credentials management. This uses RCU to manage the
credentials pointer in the task_struct with respect to accesses by other tasks.
A process may only modify its own credentials, and so does not need locking to
access or modify its own credentials.
A mutex (cred_replace_mutex) is added to the task_struct to control the effect
of PTRACE_ATTACHED on credential calculations, particularly with respect to
execve().
With this patch, the contents of an active credentials struct may not be
changed directly; rather a new set of credentials must be prepared, modified
and committed using something like the following sequence of events:
struct cred *new = prepare_creds();
int ret = blah(new);
if (ret < 0) {
abort_creds(new);
return ret;
}
return commit_creds(new);
There are some exceptions to this rule: the keyrings pointed to by the active
credentials may be instantiated - keyrings violate the COW rule as managing
COW keyrings is tricky, given that it is possible for a task to directly alter
the keys in a keyring in use by another task.
To help enforce this, various pointers to sets of credentials, such as those in
the task_struct, are declared const. The purpose of this is compile-time
discouragement of altering credentials through those pointers. Once a set of
credentials has been made public through one of these pointers, it may not be
modified, except under special circumstances:
(1) Its reference count may incremented and decremented.
(2) The keyrings to which it points may be modified, but not replaced.
The only safe way to modify anything else is to create a replacement and commit
using the functions described in Documentation/credentials.txt (which will be
added by a later patch).
This patch and the preceding patches have been tested with the LTP SELinux
testsuite.
This patch makes several logical sets of alteration:
(1) execve().
This now prepares and commits credentials in various places in the
security code rather than altering the current creds directly.
(2) Temporary credential overrides.
do_coredump() and sys_faccessat() now prepare their own credentials and
temporarily override the ones currently on the acting thread, whilst
preventing interference from other threads by holding cred_replace_mutex
on the thread being dumped.
This will be replaced in a future patch by something that hands down the
credentials directly to the functions being called, rather than altering
the task's objective credentials.
(3) LSM interface.
A number of functions have been changed, added or removed:
(*) security_capset_check(), ->capset_check()
(*) security_capset_set(), ->capset_set()
Removed in favour of security_capset().
(*) security_capset(), ->capset()
New. This is passed a pointer to the new creds, a pointer to the old
creds and the proposed capability sets. It should fill in the new
creds or return an error. All pointers, barring the pointer to the
new creds, are now const.
(*) security_bprm_apply_creds(), ->bprm_apply_creds()
Changed; now returns a value, which will cause the process to be
killed if it's an error.
(*) security_task_alloc(), ->task_alloc_security()
Removed in favour of security_prepare_creds().
(*) security_cred_free(), ->cred_free()
New. Free security data attached to cred->security.
(*) security_prepare_creds(), ->cred_prepare()
New. Duplicate any security data attached to cred->security.
(*) security_commit_creds(), ->cred_commit()
New. Apply any security effects for the upcoming installation of new
security by commit_creds().
(*) security_task_post_setuid(), ->task_post_setuid()
Removed in favour of security_task_fix_setuid().
(*) security_task_fix_setuid(), ->task_fix_setuid()
Fix up the proposed new credentials for setuid(). This is used by
cap_set_fix_setuid() to implicitly adjust capabilities in line with
setuid() changes. Changes are made to the new credentials, rather
than the task itself as in security_task_post_setuid().
(*) security_task_reparent_to_init(), ->task_reparent_to_init()
Removed. Instead the task being reparented to init is referred
directly to init's credentials.
NOTE! This results in the loss of some state: SELinux's osid no
longer records the sid of the thread that forked it.
(*) security_key_alloc(), ->key_alloc()
(*) security_key_permission(), ->key_permission()
Changed. These now take cred pointers rather than task pointers to
refer to the security context.
(4) sys_capset().
This has been simplified and uses less locking. The LSM functions it
calls have been merged.
(5) reparent_to_kthreadd().
This gives the current thread the same credentials as init by simply using
commit_thread() to point that way.
(6) __sigqueue_alloc() and switch_uid()
__sigqueue_alloc() can't stop the target task from changing its creds
beneath it, so this function gets a reference to the currently applicable
user_struct which it then passes into the sigqueue struct it returns if
successful.
switch_uid() is now called from commit_creds(), and possibly should be
folded into that. commit_creds() should take care of protecting
__sigqueue_alloc().
(7) [sg]et[ug]id() and co and [sg]et_current_groups.
The set functions now all use prepare_creds(), commit_creds() and
abort_creds() to build and check a new set of credentials before applying
it.
security_task_set[ug]id() is called inside the prepared section. This
guarantees that nothing else will affect the creds until we've finished.
The calling of set_dumpable() has been moved into commit_creds().
Much of the functionality of set_user() has been moved into
commit_creds().
The get functions all simply access the data directly.
(8) security_task_prctl() and cap_task_prctl().
security_task_prctl() has been modified to return -ENOSYS if it doesn't
want to handle a function, or otherwise return the return value directly
rather than through an argument.
Additionally, cap_task_prctl() now prepares a new set of credentials, even
if it doesn't end up using it.
(9) Keyrings.
A number of changes have been made to the keyrings code:
(a) switch_uid_keyring(), copy_keys(), exit_keys() and suid_keys() have
all been dropped and built in to the credentials functions directly.
They may want separating out again later.
(b) key_alloc() and search_process_keyrings() now take a cred pointer
rather than a task pointer to specify the security context.
(c) copy_creds() gives a new thread within the same thread group a new
thread keyring if its parent had one, otherwise it discards the thread
keyring.
(d) The authorisation key now points directly to the credentials to extend
the search into rather pointing to the task that carries them.
(e) Installing thread, process or session keyrings causes a new set of
credentials to be created, even though it's not strictly necessary for
process or session keyrings (they're shared).
(10) Usermode helper.
The usermode helper code now carries a cred struct pointer in its
subprocess_info struct instead of a new session keyring pointer. This set
of credentials is derived from init_cred and installed on the new process
after it has been cloned.
call_usermodehelper_setup() allocates the new credentials and
call_usermodehelper_freeinfo() discards them if they haven't been used. A
special cred function (prepare_usermodeinfo_creds()) is provided
specifically for call_usermodehelper_setup() to call.
call_usermodehelper_setkeys() adjusts the credentials to sport the
supplied keyring as the new session keyring.
(11) SELinux.
SELinux has a number of changes, in addition to those to support the LSM
interface changes mentioned above:
(a) selinux_setprocattr() no longer does its check for whether the
current ptracer can access processes with the new SID inside the lock
that covers getting the ptracer's SID. Whilst this lock ensures that
the check is done with the ptracer pinned, the result is only valid
until the lock is released, so there's no point doing it inside the
lock.
(12) is_single_threaded().
This function has been extracted from selinux_setprocattr() and put into
a file of its own in the lib/ directory as join_session_keyring() now
wants to use it too.
The code in SELinux just checked to see whether a task shared mm_structs
with other tasks (CLONE_VM), but that isn't good enough. We really want
to know if they're part of the same thread group (CLONE_THREAD).
(13) nfsd.
The NFS server daemon now has to use the COW credentials to set the
credentials it is going to use. It really needs to pass the credentials
down to the functions it calls, but it can't do that until other patches
in this series have been applied.
Signed-off-by: David Howells <dhowells@redhat.com>
Acked-by: James Morris <jmorris@namei.org>
Signed-off-by: James Morris <jmorris@namei.org>
2008-11-14 07:39:23 +08:00
|
|
|
struct key *authkey)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2012-09-13 20:06:29 +08:00
|
|
|
struct key_preparsed_payload prep;
|
2019-05-30 18:37:39 +08:00
|
|
|
struct assoc_array_edit *edit = NULL;
|
2005-04-17 06:20:36 +08:00
|
|
|
int ret;
|
|
|
|
|
2012-09-13 20:06:29 +08:00
|
|
|
memset(&prep, 0, sizeof(prep));
|
|
|
|
prep.data = data;
|
|
|
|
prep.datalen = datalen;
|
|
|
|
prep.quotalen = key->type->def_datalen;
|
2017-11-16 00:38:45 +08:00
|
|
|
prep.expiry = TIME64_MAX;
|
2012-09-13 20:06:29 +08:00
|
|
|
if (key->type->preparse) {
|
|
|
|
ret = key->type->preparse(&prep);
|
|
|
|
if (ret < 0)
|
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
|
2010-04-30 21:32:39 +08:00
|
|
|
if (keyring) {
|
2019-05-30 18:37:39 +08:00
|
|
|
ret = __key_link_lock(keyring, &key->index_key);
|
2016-10-05 07:27:32 +08:00
|
|
|
if (ret < 0)
|
|
|
|
goto error;
|
|
|
|
|
2019-05-30 18:37:39 +08:00
|
|
|
ret = __key_link_begin(keyring, &key->index_key, &edit);
|
|
|
|
if (ret < 0)
|
|
|
|
goto error_link_end;
|
|
|
|
|
2016-09-01 07:05:43 +08:00
|
|
|
if (keyring->restrict_link && keyring->restrict_link->check) {
|
|
|
|
struct key_restriction *keyres = keyring->restrict_link;
|
|
|
|
|
|
|
|
ret = keyres->check(keyring, key->type, &prep.payload,
|
|
|
|
keyres->key);
|
KEYS: Add a facility to restrict new links into a keyring
Add a facility whereby proposed new links to be added to a keyring can be
vetted, permitting them to be rejected if necessary. This can be used to
block public keys from which the signature cannot be verified or for which
the signature verification fails. It could also be used to provide
blacklisting.
This affects operations like add_key(), KEYCTL_LINK and KEYCTL_INSTANTIATE.
To this end:
(1) A function pointer is added to the key struct that, if set, points to
the vetting function. This is called as:
int (*restrict_link)(struct key *keyring,
const struct key_type *key_type,
unsigned long key_flags,
const union key_payload *key_payload),
where 'keyring' will be the keyring being added to, key_type and
key_payload will describe the key being added and key_flags[*] can be
AND'ed with KEY_FLAG_TRUSTED.
[*] This parameter will be removed in a later patch when
KEY_FLAG_TRUSTED is removed.
The function should return 0 to allow the link to take place or an
error (typically -ENOKEY, -ENOPKG or -EKEYREJECTED) to reject the
link.
The pointer should not be set directly, but rather should be set
through keyring_alloc().
Note that if called during add_key(), preparse is called before this
method, but a key isn't actually allocated until after this function
is called.
(2) KEY_ALLOC_BYPASS_RESTRICTION is added. This can be passed to
key_create_or_update() or key_instantiate_and_link() to bypass the
restriction check.
(3) KEY_FLAG_TRUSTED_ONLY is removed. The entire contents of a keyring
with this restriction emplaced can be considered 'trustworthy' by
virtue of being in the keyring when that keyring is consulted.
(4) key_alloc() and keyring_alloc() take an extra argument that will be
used to set restrict_link in the new key. This ensures that the
pointer is set before the key is published, thus preventing a window
of unrestrictedness. Normally this argument will be NULL.
(5) As a temporary affair, keyring_restrict_trusted_only() is added. It
should be passed to keyring_alloc() as the extra argument instead of
setting KEY_FLAG_TRUSTED_ONLY on a keyring. This will be replaced in
a later patch with functions that look in the appropriate places for
authoritative keys.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: Mimi Zohar <zohar@linux.vnet.ibm.com>
2016-04-06 23:14:24 +08:00
|
|
|
if (ret < 0)
|
2016-10-05 07:27:32 +08:00
|
|
|
goto error_link_end;
|
KEYS: Add a facility to restrict new links into a keyring
Add a facility whereby proposed new links to be added to a keyring can be
vetted, permitting them to be rejected if necessary. This can be used to
block public keys from which the signature cannot be verified or for which
the signature verification fails. It could also be used to provide
blacklisting.
This affects operations like add_key(), KEYCTL_LINK and KEYCTL_INSTANTIATE.
To this end:
(1) A function pointer is added to the key struct that, if set, points to
the vetting function. This is called as:
int (*restrict_link)(struct key *keyring,
const struct key_type *key_type,
unsigned long key_flags,
const union key_payload *key_payload),
where 'keyring' will be the keyring being added to, key_type and
key_payload will describe the key being added and key_flags[*] can be
AND'ed with KEY_FLAG_TRUSTED.
[*] This parameter will be removed in a later patch when
KEY_FLAG_TRUSTED is removed.
The function should return 0 to allow the link to take place or an
error (typically -ENOKEY, -ENOPKG or -EKEYREJECTED) to reject the
link.
The pointer should not be set directly, but rather should be set
through keyring_alloc().
Note that if called during add_key(), preparse is called before this
method, but a key isn't actually allocated until after this function
is called.
(2) KEY_ALLOC_BYPASS_RESTRICTION is added. This can be passed to
key_create_or_update() or key_instantiate_and_link() to bypass the
restriction check.
(3) KEY_FLAG_TRUSTED_ONLY is removed. The entire contents of a keyring
with this restriction emplaced can be considered 'trustworthy' by
virtue of being in the keyring when that keyring is consulted.
(4) key_alloc() and keyring_alloc() take an extra argument that will be
used to set restrict_link in the new key. This ensures that the
pointer is set before the key is published, thus preventing a window
of unrestrictedness. Normally this argument will be NULL.
(5) As a temporary affair, keyring_restrict_trusted_only() is added. It
should be passed to keyring_alloc() as the extra argument instead of
setting KEY_FLAG_TRUSTED_ONLY on a keyring. This will be replaced in
a later patch with functions that look in the appropriate places for
authoritative keys.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: Mimi Zohar <zohar@linux.vnet.ibm.com>
2016-04-06 23:14:24 +08:00
|
|
|
}
|
2010-04-30 21:32:39 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2013-09-24 17:35:18 +08:00
|
|
|
ret = __key_instantiate_and_link(key, &prep, keyring, authkey, &edit);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2016-10-05 07:27:32 +08:00
|
|
|
error_link_end:
|
2005-04-17 06:20:36 +08:00
|
|
|
if (keyring)
|
2013-09-24 17:35:18 +08:00
|
|
|
__key_link_end(keyring, &key->index_key, edit);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2014-07-19 01:56:34 +08:00
|
|
|
error:
|
2012-09-13 20:06:29 +08:00
|
|
|
if (key->type->preparse)
|
|
|
|
key->type->free_preparse(&prep);
|
2005-04-17 06:20:36 +08:00
|
|
|
return ret;
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
EXPORT_SYMBOL(key_instantiate_and_link);
|
|
|
|
|
2011-01-21 00:38:33 +08:00
|
|
|
/**
|
2011-03-07 23:06:09 +08:00
|
|
|
* key_reject_and_link - Negatively instantiate a key and link it into the keyring.
|
2011-01-21 00:38:33 +08:00
|
|
|
* @key: The key to instantiate.
|
|
|
|
* @timeout: The timeout on the negative key.
|
2011-03-07 23:06:09 +08:00
|
|
|
* @error: The error to return when the key is hit.
|
2011-01-21 00:38:33 +08:00
|
|
|
* @keyring: Keyring to create a link in on success (or NULL).
|
|
|
|
* @authkey: The authorisation token permitting instantiation.
|
|
|
|
*
|
|
|
|
* Negatively instantiate a key that's in the uninstantiated state and, if
|
2011-03-07 23:06:09 +08:00
|
|
|
* successful, set its timeout and stored error and link it in to the
|
|
|
|
* destination keyring if one is supplied. The key and any links to the key
|
|
|
|
* will be automatically garbage collected after the timeout expires.
|
2011-01-21 00:38:33 +08:00
|
|
|
*
|
|
|
|
* Negative keys are used to rate limit repeated request_key() calls by causing
|
2011-03-07 23:06:09 +08:00
|
|
|
* them to return the stored error code (typically ENOKEY) until the negative
|
|
|
|
* key expires.
|
2011-01-21 00:38:33 +08:00
|
|
|
*
|
|
|
|
* If successful, 0 is returned, the authorisation token is revoked and anyone
|
|
|
|
* waiting for the key is woken up. If the key was already instantiated,
|
|
|
|
* -EBUSY will be returned.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
2011-03-07 23:06:09 +08:00
|
|
|
int key_reject_and_link(struct key *key,
|
2005-04-17 06:20:36 +08:00
|
|
|
unsigned timeout,
|
2011-03-07 23:06:09 +08:00
|
|
|
unsigned error,
|
[PATCH] Keys: Make request-key create an authorisation key
The attached patch makes the following changes:
(1) There's a new special key type called ".request_key_auth".
This is an authorisation key for when one process requests a key and
another process is started to construct it. This type of key cannot be
created by the user; nor can it be requested by kernel services.
Authorisation keys hold two references:
(a) Each refers to a key being constructed. When the key being
constructed is instantiated the authorisation key is revoked,
rendering it of no further use.
(b) The "authorising process". This is either:
(i) the process that called request_key(), or:
(ii) if the process that called request_key() itself had an
authorisation key in its session keyring, then the authorising
process referred to by that authorisation key will also be
referred to by the new authorisation key.
This means that the process that initiated a chain of key requests
will authorise the lot of them, and will, by default, wind up with
the keys obtained from them in its keyrings.
(2) request_key() creates an authorisation key which is then passed to
/sbin/request-key in as part of a new session keyring.
(3) When request_key() is searching for a key to hand back to the caller, if
it comes across an authorisation key in the session keyring of the
calling process, it will also search the keyrings of the process
specified therein and it will use the specified process's credentials
(fsuid, fsgid, groups) to do that rather than the calling process's
credentials.
This allows a process started by /sbin/request-key to find keys belonging
to the authorising process.
(4) A key can be read, even if the process executing KEYCTL_READ doesn't have
direct read or search permission if that key is contained within the
keyrings of a process specified by an authorisation key found within the
calling process's session keyring, and is searchable using the
credentials of the authorising process.
This allows a process started by /sbin/request-key to read keys belonging
to the authorising process.
(5) The magic KEY_SPEC_*_KEYRING key IDs when passed to KEYCTL_INSTANTIATE or
KEYCTL_NEGATE will specify a keyring of the authorising process, rather
than the process doing the instantiation.
(6) One of the process keyrings can be nominated as the default to which
request_key() should attach new keys if not otherwise specified. This is
done with KEYCTL_SET_REQKEY_KEYRING and one of the KEY_REQKEY_DEFL_*
constants. The current setting can also be read using this call.
(7) request_key() is partially interruptible. If it is waiting for another
process to finish constructing a key, it can be interrupted. This permits
a request-key cycle to be broken without recourse to rebooting.
Signed-Off-By: David Howells <dhowells@redhat.com>
Signed-Off-By: Benoit Boissinot <benoit.boissinot@ens-lyon.org>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-24 13:00:56 +08:00
|
|
|
struct key *keyring,
|
CRED: Inaugurate COW credentials
Inaugurate copy-on-write credentials management. This uses RCU to manage the
credentials pointer in the task_struct with respect to accesses by other tasks.
A process may only modify its own credentials, and so does not need locking to
access or modify its own credentials.
A mutex (cred_replace_mutex) is added to the task_struct to control the effect
of PTRACE_ATTACHED on credential calculations, particularly with respect to
execve().
With this patch, the contents of an active credentials struct may not be
changed directly; rather a new set of credentials must be prepared, modified
and committed using something like the following sequence of events:
struct cred *new = prepare_creds();
int ret = blah(new);
if (ret < 0) {
abort_creds(new);
return ret;
}
return commit_creds(new);
There are some exceptions to this rule: the keyrings pointed to by the active
credentials may be instantiated - keyrings violate the COW rule as managing
COW keyrings is tricky, given that it is possible for a task to directly alter
the keys in a keyring in use by another task.
To help enforce this, various pointers to sets of credentials, such as those in
the task_struct, are declared const. The purpose of this is compile-time
discouragement of altering credentials through those pointers. Once a set of
credentials has been made public through one of these pointers, it may not be
modified, except under special circumstances:
(1) Its reference count may incremented and decremented.
(2) The keyrings to which it points may be modified, but not replaced.
The only safe way to modify anything else is to create a replacement and commit
using the functions described in Documentation/credentials.txt (which will be
added by a later patch).
This patch and the preceding patches have been tested with the LTP SELinux
testsuite.
This patch makes several logical sets of alteration:
(1) execve().
This now prepares and commits credentials in various places in the
security code rather than altering the current creds directly.
(2) Temporary credential overrides.
do_coredump() and sys_faccessat() now prepare their own credentials and
temporarily override the ones currently on the acting thread, whilst
preventing interference from other threads by holding cred_replace_mutex
on the thread being dumped.
This will be replaced in a future patch by something that hands down the
credentials directly to the functions being called, rather than altering
the task's objective credentials.
(3) LSM interface.
A number of functions have been changed, added or removed:
(*) security_capset_check(), ->capset_check()
(*) security_capset_set(), ->capset_set()
Removed in favour of security_capset().
(*) security_capset(), ->capset()
New. This is passed a pointer to the new creds, a pointer to the old
creds and the proposed capability sets. It should fill in the new
creds or return an error. All pointers, barring the pointer to the
new creds, are now const.
(*) security_bprm_apply_creds(), ->bprm_apply_creds()
Changed; now returns a value, which will cause the process to be
killed if it's an error.
(*) security_task_alloc(), ->task_alloc_security()
Removed in favour of security_prepare_creds().
(*) security_cred_free(), ->cred_free()
New. Free security data attached to cred->security.
(*) security_prepare_creds(), ->cred_prepare()
New. Duplicate any security data attached to cred->security.
(*) security_commit_creds(), ->cred_commit()
New. Apply any security effects for the upcoming installation of new
security by commit_creds().
(*) security_task_post_setuid(), ->task_post_setuid()
Removed in favour of security_task_fix_setuid().
(*) security_task_fix_setuid(), ->task_fix_setuid()
Fix up the proposed new credentials for setuid(). This is used by
cap_set_fix_setuid() to implicitly adjust capabilities in line with
setuid() changes. Changes are made to the new credentials, rather
than the task itself as in security_task_post_setuid().
(*) security_task_reparent_to_init(), ->task_reparent_to_init()
Removed. Instead the task being reparented to init is referred
directly to init's credentials.
NOTE! This results in the loss of some state: SELinux's osid no
longer records the sid of the thread that forked it.
(*) security_key_alloc(), ->key_alloc()
(*) security_key_permission(), ->key_permission()
Changed. These now take cred pointers rather than task pointers to
refer to the security context.
(4) sys_capset().
This has been simplified and uses less locking. The LSM functions it
calls have been merged.
(5) reparent_to_kthreadd().
This gives the current thread the same credentials as init by simply using
commit_thread() to point that way.
(6) __sigqueue_alloc() and switch_uid()
__sigqueue_alloc() can't stop the target task from changing its creds
beneath it, so this function gets a reference to the currently applicable
user_struct which it then passes into the sigqueue struct it returns if
successful.
switch_uid() is now called from commit_creds(), and possibly should be
folded into that. commit_creds() should take care of protecting
__sigqueue_alloc().
(7) [sg]et[ug]id() and co and [sg]et_current_groups.
The set functions now all use prepare_creds(), commit_creds() and
abort_creds() to build and check a new set of credentials before applying
it.
security_task_set[ug]id() is called inside the prepared section. This
guarantees that nothing else will affect the creds until we've finished.
The calling of set_dumpable() has been moved into commit_creds().
Much of the functionality of set_user() has been moved into
commit_creds().
The get functions all simply access the data directly.
(8) security_task_prctl() and cap_task_prctl().
security_task_prctl() has been modified to return -ENOSYS if it doesn't
want to handle a function, or otherwise return the return value directly
rather than through an argument.
Additionally, cap_task_prctl() now prepares a new set of credentials, even
if it doesn't end up using it.
(9) Keyrings.
A number of changes have been made to the keyrings code:
(a) switch_uid_keyring(), copy_keys(), exit_keys() and suid_keys() have
all been dropped and built in to the credentials functions directly.
They may want separating out again later.
(b) key_alloc() and search_process_keyrings() now take a cred pointer
rather than a task pointer to specify the security context.
(c) copy_creds() gives a new thread within the same thread group a new
thread keyring if its parent had one, otherwise it discards the thread
keyring.
(d) The authorisation key now points directly to the credentials to extend
the search into rather pointing to the task that carries them.
(e) Installing thread, process or session keyrings causes a new set of
credentials to be created, even though it's not strictly necessary for
process or session keyrings (they're shared).
(10) Usermode helper.
The usermode helper code now carries a cred struct pointer in its
subprocess_info struct instead of a new session keyring pointer. This set
of credentials is derived from init_cred and installed on the new process
after it has been cloned.
call_usermodehelper_setup() allocates the new credentials and
call_usermodehelper_freeinfo() discards them if they haven't been used. A
special cred function (prepare_usermodeinfo_creds()) is provided
specifically for call_usermodehelper_setup() to call.
call_usermodehelper_setkeys() adjusts the credentials to sport the
supplied keyring as the new session keyring.
(11) SELinux.
SELinux has a number of changes, in addition to those to support the LSM
interface changes mentioned above:
(a) selinux_setprocattr() no longer does its check for whether the
current ptracer can access processes with the new SID inside the lock
that covers getting the ptracer's SID. Whilst this lock ensures that
the check is done with the ptracer pinned, the result is only valid
until the lock is released, so there's no point doing it inside the
lock.
(12) is_single_threaded().
This function has been extracted from selinux_setprocattr() and put into
a file of its own in the lib/ directory as join_session_keyring() now
wants to use it too.
The code in SELinux just checked to see whether a task shared mm_structs
with other tasks (CLONE_VM), but that isn't good enough. We really want
to know if they're part of the same thread group (CLONE_THREAD).
(13) nfsd.
The NFS server daemon now has to use the COW credentials to set the
credentials it is going to use. It really needs to pass the credentials
down to the functions it calls, but it can't do that until other patches
in this series have been applied.
Signed-off-by: David Howells <dhowells@redhat.com>
Acked-by: James Morris <jmorris@namei.org>
Signed-off-by: James Morris <jmorris@namei.org>
2008-11-14 07:39:23 +08:00
|
|
|
struct key *authkey)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2019-05-30 18:37:39 +08:00
|
|
|
struct assoc_array_edit *edit = NULL;
|
2010-04-30 21:32:39 +08:00
|
|
|
int ret, awaken, link_ret = 0;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
key_check(key);
|
|
|
|
key_check(keyring);
|
|
|
|
|
|
|
|
awaken = 0;
|
|
|
|
ret = -EBUSY;
|
|
|
|
|
KEYS: Add a facility to restrict new links into a keyring
Add a facility whereby proposed new links to be added to a keyring can be
vetted, permitting them to be rejected if necessary. This can be used to
block public keys from which the signature cannot be verified or for which
the signature verification fails. It could also be used to provide
blacklisting.
This affects operations like add_key(), KEYCTL_LINK and KEYCTL_INSTANTIATE.
To this end:
(1) A function pointer is added to the key struct that, if set, points to
the vetting function. This is called as:
int (*restrict_link)(struct key *keyring,
const struct key_type *key_type,
unsigned long key_flags,
const union key_payload *key_payload),
where 'keyring' will be the keyring being added to, key_type and
key_payload will describe the key being added and key_flags[*] can be
AND'ed with KEY_FLAG_TRUSTED.
[*] This parameter will be removed in a later patch when
KEY_FLAG_TRUSTED is removed.
The function should return 0 to allow the link to take place or an
error (typically -ENOKEY, -ENOPKG or -EKEYREJECTED) to reject the
link.
The pointer should not be set directly, but rather should be set
through keyring_alloc().
Note that if called during add_key(), preparse is called before this
method, but a key isn't actually allocated until after this function
is called.
(2) KEY_ALLOC_BYPASS_RESTRICTION is added. This can be passed to
key_create_or_update() or key_instantiate_and_link() to bypass the
restriction check.
(3) KEY_FLAG_TRUSTED_ONLY is removed. The entire contents of a keyring
with this restriction emplaced can be considered 'trustworthy' by
virtue of being in the keyring when that keyring is consulted.
(4) key_alloc() and keyring_alloc() take an extra argument that will be
used to set restrict_link in the new key. This ensures that the
pointer is set before the key is published, thus preventing a window
of unrestrictedness. Normally this argument will be NULL.
(5) As a temporary affair, keyring_restrict_trusted_only() is added. It
should be passed to keyring_alloc() as the extra argument instead of
setting KEY_FLAG_TRUSTED_ONLY on a keyring. This will be replaced in
a later patch with functions that look in the appropriate places for
authoritative keys.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: Mimi Zohar <zohar@linux.vnet.ibm.com>
2016-04-06 23:14:24 +08:00
|
|
|
if (keyring) {
|
|
|
|
if (keyring->restrict_link)
|
|
|
|
return -EPERM;
|
|
|
|
|
2019-05-30 18:37:39 +08:00
|
|
|
link_ret = __key_link_lock(keyring, &key->index_key);
|
|
|
|
if (link_ret == 0) {
|
|
|
|
link_ret = __key_link_begin(keyring, &key->index_key, &edit);
|
|
|
|
if (link_ret < 0)
|
|
|
|
__key_link_end(keyring, &key->index_key, edit);
|
|
|
|
}
|
KEYS: Add a facility to restrict new links into a keyring
Add a facility whereby proposed new links to be added to a keyring can be
vetted, permitting them to be rejected if necessary. This can be used to
block public keys from which the signature cannot be verified or for which
the signature verification fails. It could also be used to provide
blacklisting.
This affects operations like add_key(), KEYCTL_LINK and KEYCTL_INSTANTIATE.
To this end:
(1) A function pointer is added to the key struct that, if set, points to
the vetting function. This is called as:
int (*restrict_link)(struct key *keyring,
const struct key_type *key_type,
unsigned long key_flags,
const union key_payload *key_payload),
where 'keyring' will be the keyring being added to, key_type and
key_payload will describe the key being added and key_flags[*] can be
AND'ed with KEY_FLAG_TRUSTED.
[*] This parameter will be removed in a later patch when
KEY_FLAG_TRUSTED is removed.
The function should return 0 to allow the link to take place or an
error (typically -ENOKEY, -ENOPKG or -EKEYREJECTED) to reject the
link.
The pointer should not be set directly, but rather should be set
through keyring_alloc().
Note that if called during add_key(), preparse is called before this
method, but a key isn't actually allocated until after this function
is called.
(2) KEY_ALLOC_BYPASS_RESTRICTION is added. This can be passed to
key_create_or_update() or key_instantiate_and_link() to bypass the
restriction check.
(3) KEY_FLAG_TRUSTED_ONLY is removed. The entire contents of a keyring
with this restriction emplaced can be considered 'trustworthy' by
virtue of being in the keyring when that keyring is consulted.
(4) key_alloc() and keyring_alloc() take an extra argument that will be
used to set restrict_link in the new key. This ensures that the
pointer is set before the key is published, thus preventing a window
of unrestrictedness. Normally this argument will be NULL.
(5) As a temporary affair, keyring_restrict_trusted_only() is added. It
should be passed to keyring_alloc() as the extra argument instead of
setting KEY_FLAG_TRUSTED_ONLY on a keyring. This will be replaced in
a later patch with functions that look in the appropriate places for
authoritative keys.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: Mimi Zohar <zohar@linux.vnet.ibm.com>
2016-04-06 23:14:24 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2007-10-17 14:29:46 +08:00
|
|
|
mutex_lock(&key_construction_mutex);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/* can't instantiate twice */
|
2017-10-04 23:43:25 +08:00
|
|
|
if (key->state == KEY_IS_UNINSTANTIATED) {
|
2005-04-17 06:20:36 +08:00
|
|
|
/* mark the key as being negatively instantiated */
|
|
|
|
atomic_inc(&key->user->nikeys);
|
2017-10-04 23:43:25 +08:00
|
|
|
mark_key_instantiated(key, -error);
|
watch_queue: Add a key/keyring notification facility
Add a key/keyring change notification facility whereby notifications about
changes in key and keyring content and attributes can be received.
Firstly, an event queue needs to be created:
pipe2(fds, O_NOTIFICATION_PIPE);
ioctl(fds[1], IOC_WATCH_QUEUE_SET_SIZE, 256);
then a notification can be set up to report notifications via that queue:
struct watch_notification_filter filter = {
.nr_filters = 1,
.filters = {
[0] = {
.type = WATCH_TYPE_KEY_NOTIFY,
.subtype_filter[0] = UINT_MAX,
},
},
};
ioctl(fds[1], IOC_WATCH_QUEUE_SET_FILTER, &filter);
keyctl_watch_key(KEY_SPEC_SESSION_KEYRING, fds[1], 0x01);
After that, records will be placed into the queue when events occur in
which keys are changed in some way. Records are of the following format:
struct key_notification {
struct watch_notification watch;
__u32 key_id;
__u32 aux;
} *n;
Where:
n->watch.type will be WATCH_TYPE_KEY_NOTIFY.
n->watch.subtype will indicate the type of event, such as
NOTIFY_KEY_REVOKED.
n->watch.info & WATCH_INFO_LENGTH will indicate the length of the
record.
n->watch.info & WATCH_INFO_ID will be the second argument to
keyctl_watch_key(), shifted.
n->key will be the ID of the affected key.
n->aux will hold subtype-dependent information, such as the key
being linked into the keyring specified by n->key in the case of
NOTIFY_KEY_LINKED.
Note that it is permissible for event records to be of variable length -
or, at least, the length may be dependent on the subtype. Note also that
the queue can be shared between multiple notifications of various types.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: James Morris <jamorris@linux.microsoft.com>
2020-01-15 01:07:11 +08:00
|
|
|
notify_key(key, NOTIFY_KEY_INSTANTIATED, -error);
|
2017-11-16 00:38:45 +08:00
|
|
|
key->expiry = ktime_get_real_seconds() + timeout;
|
2009-09-15 00:26:13 +08:00
|
|
|
key_schedule_gc(key->expiry + key_gc_delay);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2005-06-24 13:00:49 +08:00
|
|
|
if (test_and_clear_bit(KEY_FLAG_USER_CONSTRUCT, &key->flags))
|
2005-04-17 06:20:36 +08:00
|
|
|
awaken = 1;
|
|
|
|
|
|
|
|
ret = 0;
|
|
|
|
|
|
|
|
/* and link it into the destination keyring */
|
2010-04-30 21:32:39 +08:00
|
|
|
if (keyring && link_ret == 0)
|
watch_queue: Add a key/keyring notification facility
Add a key/keyring change notification facility whereby notifications about
changes in key and keyring content and attributes can be received.
Firstly, an event queue needs to be created:
pipe2(fds, O_NOTIFICATION_PIPE);
ioctl(fds[1], IOC_WATCH_QUEUE_SET_SIZE, 256);
then a notification can be set up to report notifications via that queue:
struct watch_notification_filter filter = {
.nr_filters = 1,
.filters = {
[0] = {
.type = WATCH_TYPE_KEY_NOTIFY,
.subtype_filter[0] = UINT_MAX,
},
},
};
ioctl(fds[1], IOC_WATCH_QUEUE_SET_FILTER, &filter);
keyctl_watch_key(KEY_SPEC_SESSION_KEYRING, fds[1], 0x01);
After that, records will be placed into the queue when events occur in
which keys are changed in some way. Records are of the following format:
struct key_notification {
struct watch_notification watch;
__u32 key_id;
__u32 aux;
} *n;
Where:
n->watch.type will be WATCH_TYPE_KEY_NOTIFY.
n->watch.subtype will indicate the type of event, such as
NOTIFY_KEY_REVOKED.
n->watch.info & WATCH_INFO_LENGTH will indicate the length of the
record.
n->watch.info & WATCH_INFO_ID will be the second argument to
keyctl_watch_key(), shifted.
n->key will be the ID of the affected key.
n->aux will hold subtype-dependent information, such as the key
being linked into the keyring specified by n->key in the case of
NOTIFY_KEY_LINKED.
Note that it is permissible for event records to be of variable length -
or, at least, the length may be dependent on the subtype. Note also that
the queue can be shared between multiple notifications of various types.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: James Morris <jamorris@linux.microsoft.com>
2020-01-15 01:07:11 +08:00
|
|
|
__key_link(keyring, key, &edit);
|
[PATCH] Keys: Make request-key create an authorisation key
The attached patch makes the following changes:
(1) There's a new special key type called ".request_key_auth".
This is an authorisation key for when one process requests a key and
another process is started to construct it. This type of key cannot be
created by the user; nor can it be requested by kernel services.
Authorisation keys hold two references:
(a) Each refers to a key being constructed. When the key being
constructed is instantiated the authorisation key is revoked,
rendering it of no further use.
(b) The "authorising process". This is either:
(i) the process that called request_key(), or:
(ii) if the process that called request_key() itself had an
authorisation key in its session keyring, then the authorising
process referred to by that authorisation key will also be
referred to by the new authorisation key.
This means that the process that initiated a chain of key requests
will authorise the lot of them, and will, by default, wind up with
the keys obtained from them in its keyrings.
(2) request_key() creates an authorisation key which is then passed to
/sbin/request-key in as part of a new session keyring.
(3) When request_key() is searching for a key to hand back to the caller, if
it comes across an authorisation key in the session keyring of the
calling process, it will also search the keyrings of the process
specified therein and it will use the specified process's credentials
(fsuid, fsgid, groups) to do that rather than the calling process's
credentials.
This allows a process started by /sbin/request-key to find keys belonging
to the authorising process.
(4) A key can be read, even if the process executing KEYCTL_READ doesn't have
direct read or search permission if that key is contained within the
keyrings of a process specified by an authorisation key found within the
calling process's session keyring, and is searchable using the
credentials of the authorising process.
This allows a process started by /sbin/request-key to read keys belonging
to the authorising process.
(5) The magic KEY_SPEC_*_KEYRING key IDs when passed to KEYCTL_INSTANTIATE or
KEYCTL_NEGATE will specify a keyring of the authorising process, rather
than the process doing the instantiation.
(6) One of the process keyrings can be nominated as the default to which
request_key() should attach new keys if not otherwise specified. This is
done with KEYCTL_SET_REQKEY_KEYRING and one of the KEY_REQKEY_DEFL_*
constants. The current setting can also be read using this call.
(7) request_key() is partially interruptible. If it is waiting for another
process to finish constructing a key, it can be interrupted. This permits
a request-key cycle to be broken without recourse to rebooting.
Signed-Off-By: David Howells <dhowells@redhat.com>
Signed-Off-By: Benoit Boissinot <benoit.boissinot@ens-lyon.org>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-24 13:00:56 +08:00
|
|
|
|
|
|
|
/* disable the authorisation key */
|
CRED: Inaugurate COW credentials
Inaugurate copy-on-write credentials management. This uses RCU to manage the
credentials pointer in the task_struct with respect to accesses by other tasks.
A process may only modify its own credentials, and so does not need locking to
access or modify its own credentials.
A mutex (cred_replace_mutex) is added to the task_struct to control the effect
of PTRACE_ATTACHED on credential calculations, particularly with respect to
execve().
With this patch, the contents of an active credentials struct may not be
changed directly; rather a new set of credentials must be prepared, modified
and committed using something like the following sequence of events:
struct cred *new = prepare_creds();
int ret = blah(new);
if (ret < 0) {
abort_creds(new);
return ret;
}
return commit_creds(new);
There are some exceptions to this rule: the keyrings pointed to by the active
credentials may be instantiated - keyrings violate the COW rule as managing
COW keyrings is tricky, given that it is possible for a task to directly alter
the keys in a keyring in use by another task.
To help enforce this, various pointers to sets of credentials, such as those in
the task_struct, are declared const. The purpose of this is compile-time
discouragement of altering credentials through those pointers. Once a set of
credentials has been made public through one of these pointers, it may not be
modified, except under special circumstances:
(1) Its reference count may incremented and decremented.
(2) The keyrings to which it points may be modified, but not replaced.
The only safe way to modify anything else is to create a replacement and commit
using the functions described in Documentation/credentials.txt (which will be
added by a later patch).
This patch and the preceding patches have been tested with the LTP SELinux
testsuite.
This patch makes several logical sets of alteration:
(1) execve().
This now prepares and commits credentials in various places in the
security code rather than altering the current creds directly.
(2) Temporary credential overrides.
do_coredump() and sys_faccessat() now prepare their own credentials and
temporarily override the ones currently on the acting thread, whilst
preventing interference from other threads by holding cred_replace_mutex
on the thread being dumped.
This will be replaced in a future patch by something that hands down the
credentials directly to the functions being called, rather than altering
the task's objective credentials.
(3) LSM interface.
A number of functions have been changed, added or removed:
(*) security_capset_check(), ->capset_check()
(*) security_capset_set(), ->capset_set()
Removed in favour of security_capset().
(*) security_capset(), ->capset()
New. This is passed a pointer to the new creds, a pointer to the old
creds and the proposed capability sets. It should fill in the new
creds or return an error. All pointers, barring the pointer to the
new creds, are now const.
(*) security_bprm_apply_creds(), ->bprm_apply_creds()
Changed; now returns a value, which will cause the process to be
killed if it's an error.
(*) security_task_alloc(), ->task_alloc_security()
Removed in favour of security_prepare_creds().
(*) security_cred_free(), ->cred_free()
New. Free security data attached to cred->security.
(*) security_prepare_creds(), ->cred_prepare()
New. Duplicate any security data attached to cred->security.
(*) security_commit_creds(), ->cred_commit()
New. Apply any security effects for the upcoming installation of new
security by commit_creds().
(*) security_task_post_setuid(), ->task_post_setuid()
Removed in favour of security_task_fix_setuid().
(*) security_task_fix_setuid(), ->task_fix_setuid()
Fix up the proposed new credentials for setuid(). This is used by
cap_set_fix_setuid() to implicitly adjust capabilities in line with
setuid() changes. Changes are made to the new credentials, rather
than the task itself as in security_task_post_setuid().
(*) security_task_reparent_to_init(), ->task_reparent_to_init()
Removed. Instead the task being reparented to init is referred
directly to init's credentials.
NOTE! This results in the loss of some state: SELinux's osid no
longer records the sid of the thread that forked it.
(*) security_key_alloc(), ->key_alloc()
(*) security_key_permission(), ->key_permission()
Changed. These now take cred pointers rather than task pointers to
refer to the security context.
(4) sys_capset().
This has been simplified and uses less locking. The LSM functions it
calls have been merged.
(5) reparent_to_kthreadd().
This gives the current thread the same credentials as init by simply using
commit_thread() to point that way.
(6) __sigqueue_alloc() and switch_uid()
__sigqueue_alloc() can't stop the target task from changing its creds
beneath it, so this function gets a reference to the currently applicable
user_struct which it then passes into the sigqueue struct it returns if
successful.
switch_uid() is now called from commit_creds(), and possibly should be
folded into that. commit_creds() should take care of protecting
__sigqueue_alloc().
(7) [sg]et[ug]id() and co and [sg]et_current_groups.
The set functions now all use prepare_creds(), commit_creds() and
abort_creds() to build and check a new set of credentials before applying
it.
security_task_set[ug]id() is called inside the prepared section. This
guarantees that nothing else will affect the creds until we've finished.
The calling of set_dumpable() has been moved into commit_creds().
Much of the functionality of set_user() has been moved into
commit_creds().
The get functions all simply access the data directly.
(8) security_task_prctl() and cap_task_prctl().
security_task_prctl() has been modified to return -ENOSYS if it doesn't
want to handle a function, or otherwise return the return value directly
rather than through an argument.
Additionally, cap_task_prctl() now prepares a new set of credentials, even
if it doesn't end up using it.
(9) Keyrings.
A number of changes have been made to the keyrings code:
(a) switch_uid_keyring(), copy_keys(), exit_keys() and suid_keys() have
all been dropped and built in to the credentials functions directly.
They may want separating out again later.
(b) key_alloc() and search_process_keyrings() now take a cred pointer
rather than a task pointer to specify the security context.
(c) copy_creds() gives a new thread within the same thread group a new
thread keyring if its parent had one, otherwise it discards the thread
keyring.
(d) The authorisation key now points directly to the credentials to extend
the search into rather pointing to the task that carries them.
(e) Installing thread, process or session keyrings causes a new set of
credentials to be created, even though it's not strictly necessary for
process or session keyrings (they're shared).
(10) Usermode helper.
The usermode helper code now carries a cred struct pointer in its
subprocess_info struct instead of a new session keyring pointer. This set
of credentials is derived from init_cred and installed on the new process
after it has been cloned.
call_usermodehelper_setup() allocates the new credentials and
call_usermodehelper_freeinfo() discards them if they haven't been used. A
special cred function (prepare_usermodeinfo_creds()) is provided
specifically for call_usermodehelper_setup() to call.
call_usermodehelper_setkeys() adjusts the credentials to sport the
supplied keyring as the new session keyring.
(11) SELinux.
SELinux has a number of changes, in addition to those to support the LSM
interface changes mentioned above:
(a) selinux_setprocattr() no longer does its check for whether the
current ptracer can access processes with the new SID inside the lock
that covers getting the ptracer's SID. Whilst this lock ensures that
the check is done with the ptracer pinned, the result is only valid
until the lock is released, so there's no point doing it inside the
lock.
(12) is_single_threaded().
This function has been extracted from selinux_setprocattr() and put into
a file of its own in the lib/ directory as join_session_keyring() now
wants to use it too.
The code in SELinux just checked to see whether a task shared mm_structs
with other tasks (CLONE_VM), but that isn't good enough. We really want
to know if they're part of the same thread group (CLONE_THREAD).
(13) nfsd.
The NFS server daemon now has to use the COW credentials to set the
credentials it is going to use. It really needs to pass the credentials
down to the functions it calls, but it can't do that until other patches
in this series have been applied.
Signed-off-by: David Howells <dhowells@redhat.com>
Acked-by: James Morris <jmorris@namei.org>
Signed-off-by: James Morris <jmorris@namei.org>
2008-11-14 07:39:23 +08:00
|
|
|
if (authkey)
|
2019-06-19 23:10:15 +08:00
|
|
|
key_invalidate(authkey);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
2007-10-17 14:29:46 +08:00
|
|
|
mutex_unlock(&key_construction_mutex);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
KEYS: potential uninitialized variable
If __key_link_begin() failed then "edit" would be uninitialized. I've
added a check to fix that.
This allows a random user to crash the kernel, though it's quite
difficult to achieve. There are three ways it can be done as the user
would have to cause an error to occur in __key_link():
(1) Cause the kernel to run out of memory. In practice, this is difficult
to achieve without ENOMEM cropping up elsewhere and aborting the
attempt.
(2) Revoke the destination keyring between the keyring ID being looked up
and it being tested for revocation. In practice, this is difficult to
time correctly because the KEYCTL_REJECT function can only be used
from the request-key upcall process. Further, users can only make use
of what's in /sbin/request-key.conf, though this does including a
rejection debugging test - which means that the destination keyring
has to be the caller's session keyring in practice.
(3) Have just enough key quota available to create a key, a new session
keyring for the upcall and a link in the session keyring, but not then
sufficient quota to create a link in the nominated destination keyring
so that it fails with EDQUOT.
The bug can be triggered using option (3) above using something like the
following:
echo 80 >/proc/sys/kernel/keys/root_maxbytes
keyctl request2 user debug:fred negate @t
The above sets the quota to something much lower (80) to make the bug
easier to trigger, but this is dependent on the system. Note also that
the name of the keyring created contains a random number that may be
between 1 and 10 characters in size, so may throw the test off by
changing the amount of quota used.
Assuming the failure occurs, something like the following will be seen:
kfree_debugcheck: out of range ptr 6b6b6b6b6b6b6b68h
------------[ cut here ]------------
kernel BUG at ../mm/slab.c:2821!
...
RIP: 0010:[<ffffffff811600f9>] kfree_debugcheck+0x20/0x25
RSP: 0018:ffff8804014a7de8 EFLAGS: 00010092
RAX: 0000000000000034 RBX: 6b6b6b6b6b6b6b68 RCX: 0000000000000000
RDX: 0000000000040001 RSI: 00000000000000f6 RDI: 0000000000000300
RBP: ffff8804014a7df0 R08: 0000000000000001 R09: 0000000000000000
R10: ffff8804014a7e68 R11: 0000000000000054 R12: 0000000000000202
R13: ffffffff81318a66 R14: 0000000000000000 R15: 0000000000000001
...
Call Trace:
kfree+0xde/0x1bc
assoc_array_cancel_edit+0x1f/0x36
__key_link_end+0x55/0x63
key_reject_and_link+0x124/0x155
keyctl_reject_key+0xb6/0xe0
keyctl_negate_key+0x10/0x12
SyS_keyctl+0x9f/0xe7
do_syscall_64+0x63/0x13a
entry_SYSCALL64_slow_path+0x25/0x25
Fixes: f70e2e06196a ('KEYS: Do preallocation for __key_link()')
Signed-off-by: Dan Carpenter <dan.carpenter@oracle.com>
Signed-off-by: David Howells <dhowells@redhat.com>
cc: stable@vger.kernel.org
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2016-06-16 22:48:57 +08:00
|
|
|
if (keyring && link_ret == 0)
|
2013-09-24 17:35:18 +08:00
|
|
|
__key_link_end(keyring, &key->index_key, edit);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/* wake up anyone waiting for a key to be constructed */
|
|
|
|
if (awaken)
|
2007-10-17 14:29:46 +08:00
|
|
|
wake_up_bit(&key->flags, KEY_FLAG_USER_CONSTRUCT);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2010-04-30 21:32:39 +08:00
|
|
|
return ret == 0 ? link_ret : ret;
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2011-03-07 23:06:09 +08:00
|
|
|
EXPORT_SYMBOL(key_reject_and_link);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2011-01-21 00:38:33 +08:00
|
|
|
/**
|
|
|
|
* key_put - Discard a reference to a key.
|
|
|
|
* @key: The key to discard a reference from.
|
|
|
|
*
|
|
|
|
* Discard a reference to a key, and when all the references are gone, we
|
|
|
|
* schedule the cleanup task to come and pull it out of the tree in process
|
|
|
|
* context at some later time.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
void key_put(struct key *key)
|
|
|
|
{
|
|
|
|
if (key) {
|
|
|
|
key_check(key);
|
|
|
|
|
2017-03-31 20:20:48 +08:00
|
|
|
if (refcount_dec_and_test(&key->usage))
|
2012-08-21 05:51:24 +08:00
|
|
|
schedule_work(&key_gc_work);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
EXPORT_SYMBOL(key_put);
|
|
|
|
|
|
|
|
/*
|
2011-01-21 00:38:33 +08:00
|
|
|
* Find a key by its serial number.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
struct key *key_lookup(key_serial_t id)
|
|
|
|
{
|
|
|
|
struct rb_node *n;
|
|
|
|
struct key *key;
|
|
|
|
|
|
|
|
spin_lock(&key_serial_lock);
|
|
|
|
|
|
|
|
/* search the tree for the specified key */
|
|
|
|
n = key_serial_tree.rb_node;
|
|
|
|
while (n) {
|
|
|
|
key = rb_entry(n, struct key, serial_node);
|
|
|
|
|
|
|
|
if (id < key->serial)
|
|
|
|
n = n->rb_left;
|
|
|
|
else if (id > key->serial)
|
|
|
|
n = n->rb_right;
|
|
|
|
else
|
|
|
|
goto found;
|
|
|
|
}
|
|
|
|
|
2011-01-21 00:38:33 +08:00
|
|
|
not_found:
|
2005-04-17 06:20:36 +08:00
|
|
|
key = ERR_PTR(-ENOKEY);
|
|
|
|
goto error;
|
|
|
|
|
2011-01-21 00:38:33 +08:00
|
|
|
found:
|
2017-06-08 21:47:41 +08:00
|
|
|
/* A key is allowed to be looked up only if someone still owns a
|
|
|
|
* reference to it - otherwise it's awaiting the gc.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
2017-06-08 21:47:41 +08:00
|
|
|
if (!refcount_inc_not_zero(&key->usage))
|
|
|
|
goto not_found;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2011-01-21 00:38:33 +08:00
|
|
|
error:
|
2005-04-17 06:20:36 +08:00
|
|
|
spin_unlock(&key_serial_lock);
|
|
|
|
return key;
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/*
|
2011-01-21 00:38:33 +08:00
|
|
|
* Find and lock the specified key type against removal.
|
|
|
|
*
|
|
|
|
* We return with the sem read-locked if successful. If the type wasn't
|
|
|
|
* available -ENOKEY is returned instead.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
struct key_type *key_type_lookup(const char *type)
|
|
|
|
{
|
|
|
|
struct key_type *ktype;
|
|
|
|
|
|
|
|
down_read(&key_types_sem);
|
|
|
|
|
|
|
|
/* look up the key type to see if it's one of the registered kernel
|
|
|
|
* types */
|
|
|
|
list_for_each_entry(ktype, &key_types_list, link) {
|
|
|
|
if (strcmp(ktype->name, type) == 0)
|
|
|
|
goto found_kernel_type;
|
|
|
|
}
|
|
|
|
|
|
|
|
up_read(&key_types_sem);
|
|
|
|
ktype = ERR_PTR(-ENOKEY);
|
|
|
|
|
2011-01-21 00:38:33 +08:00
|
|
|
found_kernel_type:
|
2005-04-17 06:20:36 +08:00
|
|
|
return ktype;
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2012-02-25 03:14:50 +08:00
|
|
|
void key_set_timeout(struct key *key, unsigned timeout)
|
|
|
|
{
|
2017-11-16 00:38:45 +08:00
|
|
|
time64_t expiry = 0;
|
2012-02-25 03:14:50 +08:00
|
|
|
|
|
|
|
/* make the changes with the locks held to prevent races */
|
|
|
|
down_write(&key->sem);
|
|
|
|
|
2017-11-16 00:38:45 +08:00
|
|
|
if (timeout > 0)
|
|
|
|
expiry = ktime_get_real_seconds() + timeout;
|
2012-02-25 03:14:50 +08:00
|
|
|
|
|
|
|
key->expiry = expiry;
|
|
|
|
key_schedule_gc(key->expiry + key_gc_delay);
|
|
|
|
|
|
|
|
up_write(&key->sem);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(key_set_timeout);
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
2011-01-21 00:38:33 +08:00
|
|
|
* Unlock a key type locked by key_type_lookup().
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
void key_type_put(struct key_type *ktype)
|
|
|
|
{
|
|
|
|
up_read(&key_types_sem);
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/*
|
2011-01-21 00:38:33 +08:00
|
|
|
* Attempt to update an existing key.
|
|
|
|
*
|
|
|
|
* The key is given to us with an incremented refcount that we need to discard
|
|
|
|
* if we get an error.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
2005-09-29 00:03:15 +08:00
|
|
|
static inline key_ref_t __key_update(key_ref_t key_ref,
|
2012-09-13 20:06:29 +08:00
|
|
|
struct key_preparsed_payload *prep)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2005-09-29 00:03:15 +08:00
|
|
|
struct key *key = key_ref_to_ptr(key_ref);
|
2005-04-17 06:20:36 +08:00
|
|
|
int ret;
|
|
|
|
|
|
|
|
/* need write permission on the key to update it */
|
2014-03-15 01:44:49 +08:00
|
|
|
ret = key_permission(key_ref, KEY_NEED_WRITE);
|
2005-10-31 07:02:44 +08:00
|
|
|
if (ret < 0)
|
2005-04-17 06:20:36 +08:00
|
|
|
goto error;
|
|
|
|
|
|
|
|
ret = -EEXIST;
|
|
|
|
if (!key->type->update)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
down_write(&key->sem);
|
|
|
|
|
2012-09-13 20:06:29 +08:00
|
|
|
ret = key->type->update(key, prep);
|
watch_queue: Add a key/keyring notification facility
Add a key/keyring change notification facility whereby notifications about
changes in key and keyring content and attributes can be received.
Firstly, an event queue needs to be created:
pipe2(fds, O_NOTIFICATION_PIPE);
ioctl(fds[1], IOC_WATCH_QUEUE_SET_SIZE, 256);
then a notification can be set up to report notifications via that queue:
struct watch_notification_filter filter = {
.nr_filters = 1,
.filters = {
[0] = {
.type = WATCH_TYPE_KEY_NOTIFY,
.subtype_filter[0] = UINT_MAX,
},
},
};
ioctl(fds[1], IOC_WATCH_QUEUE_SET_FILTER, &filter);
keyctl_watch_key(KEY_SPEC_SESSION_KEYRING, fds[1], 0x01);
After that, records will be placed into the queue when events occur in
which keys are changed in some way. Records are of the following format:
struct key_notification {
struct watch_notification watch;
__u32 key_id;
__u32 aux;
} *n;
Where:
n->watch.type will be WATCH_TYPE_KEY_NOTIFY.
n->watch.subtype will indicate the type of event, such as
NOTIFY_KEY_REVOKED.
n->watch.info & WATCH_INFO_LENGTH will indicate the length of the
record.
n->watch.info & WATCH_INFO_ID will be the second argument to
keyctl_watch_key(), shifted.
n->key will be the ID of the affected key.
n->aux will hold subtype-dependent information, such as the key
being linked into the keyring specified by n->key in the case of
NOTIFY_KEY_LINKED.
Note that it is permissible for event records to be of variable length -
or, at least, the length may be dependent on the subtype. Note also that
the queue can be shared between multiple notifications of various types.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: James Morris <jamorris@linux.microsoft.com>
2020-01-15 01:07:11 +08:00
|
|
|
if (ret == 0) {
|
2017-10-04 23:43:25 +08:00
|
|
|
/* Updating a negative key positively instantiates it */
|
|
|
|
mark_key_instantiated(key, 0);
|
watch_queue: Add a key/keyring notification facility
Add a key/keyring change notification facility whereby notifications about
changes in key and keyring content and attributes can be received.
Firstly, an event queue needs to be created:
pipe2(fds, O_NOTIFICATION_PIPE);
ioctl(fds[1], IOC_WATCH_QUEUE_SET_SIZE, 256);
then a notification can be set up to report notifications via that queue:
struct watch_notification_filter filter = {
.nr_filters = 1,
.filters = {
[0] = {
.type = WATCH_TYPE_KEY_NOTIFY,
.subtype_filter[0] = UINT_MAX,
},
},
};
ioctl(fds[1], IOC_WATCH_QUEUE_SET_FILTER, &filter);
keyctl_watch_key(KEY_SPEC_SESSION_KEYRING, fds[1], 0x01);
After that, records will be placed into the queue when events occur in
which keys are changed in some way. Records are of the following format:
struct key_notification {
struct watch_notification watch;
__u32 key_id;
__u32 aux;
} *n;
Where:
n->watch.type will be WATCH_TYPE_KEY_NOTIFY.
n->watch.subtype will indicate the type of event, such as
NOTIFY_KEY_REVOKED.
n->watch.info & WATCH_INFO_LENGTH will indicate the length of the
record.
n->watch.info & WATCH_INFO_ID will be the second argument to
keyctl_watch_key(), shifted.
n->key will be the ID of the affected key.
n->aux will hold subtype-dependent information, such as the key
being linked into the keyring specified by n->key in the case of
NOTIFY_KEY_LINKED.
Note that it is permissible for event records to be of variable length -
or, at least, the length may be dependent on the subtype. Note also that
the queue can be shared between multiple notifications of various types.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: James Morris <jamorris@linux.microsoft.com>
2020-01-15 01:07:11 +08:00
|
|
|
notify_key(key, NOTIFY_KEY_UPDATED, 0);
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
up_write(&key->sem);
|
|
|
|
|
|
|
|
if (ret < 0)
|
|
|
|
goto error;
|
2005-09-29 00:03:15 +08:00
|
|
|
out:
|
|
|
|
return key_ref;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2005-09-29 00:03:15 +08:00
|
|
|
error:
|
2005-04-17 06:20:36 +08:00
|
|
|
key_put(key);
|
2005-09-29 00:03:15 +08:00
|
|
|
key_ref = ERR_PTR(ret);
|
2005-04-17 06:20:36 +08:00
|
|
|
goto out;
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2011-01-21 00:38:33 +08:00
|
|
|
/**
|
|
|
|
* key_create_or_update - Update or create and instantiate a key.
|
|
|
|
* @keyring_ref: A pointer to the destination keyring with possession flag.
|
|
|
|
* @type: The type of key.
|
|
|
|
* @description: The searchable description for the key.
|
|
|
|
* @payload: The data to use to instantiate or update the key.
|
|
|
|
* @plen: The length of @payload.
|
2019-07-11 09:43:43 +08:00
|
|
|
* @perm: The permissions mask for a new key.
|
2011-01-21 00:38:33 +08:00
|
|
|
* @flags: The quota flags for a new key.
|
|
|
|
*
|
|
|
|
* Search the destination keyring for a key of the same description and if one
|
|
|
|
* is found, update it, otherwise create and instantiate a new one and create a
|
|
|
|
* link to it from that keyring.
|
|
|
|
*
|
|
|
|
* If perm is KEY_PERM_UNDEF then an appropriate key permissions mask will be
|
|
|
|
* concocted.
|
|
|
|
*
|
|
|
|
* Returns a pointer to the new key if successful, -ENODEV if the key type
|
|
|
|
* wasn't available, -ENOTDIR if the keyring wasn't a keyring, -EACCES if the
|
|
|
|
* caller isn't permitted to modify the keyring or the LSM did not permit
|
|
|
|
* creation of the key.
|
|
|
|
*
|
|
|
|
* On success, the possession flag from the keyring ref will be tacked on to
|
|
|
|
* the key ref before it is returned.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
2005-09-29 00:03:15 +08:00
|
|
|
key_ref_t key_create_or_update(key_ref_t keyring_ref,
|
|
|
|
const char *type,
|
|
|
|
const char *description,
|
|
|
|
const void *payload,
|
|
|
|
size_t plen,
|
2019-07-11 09:43:43 +08:00
|
|
|
key_perm_t perm,
|
2006-06-26 15:24:50 +08:00
|
|
|
unsigned long flags)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2013-09-24 17:35:15 +08:00
|
|
|
struct keyring_index_key index_key = {
|
|
|
|
.description = description,
|
|
|
|
};
|
2012-09-13 20:06:29 +08:00
|
|
|
struct key_preparsed_payload prep;
|
2019-05-30 18:37:39 +08:00
|
|
|
struct assoc_array_edit *edit = NULL;
|
CRED: Inaugurate COW credentials
Inaugurate copy-on-write credentials management. This uses RCU to manage the
credentials pointer in the task_struct with respect to accesses by other tasks.
A process may only modify its own credentials, and so does not need locking to
access or modify its own credentials.
A mutex (cred_replace_mutex) is added to the task_struct to control the effect
of PTRACE_ATTACHED on credential calculations, particularly with respect to
execve().
With this patch, the contents of an active credentials struct may not be
changed directly; rather a new set of credentials must be prepared, modified
and committed using something like the following sequence of events:
struct cred *new = prepare_creds();
int ret = blah(new);
if (ret < 0) {
abort_creds(new);
return ret;
}
return commit_creds(new);
There are some exceptions to this rule: the keyrings pointed to by the active
credentials may be instantiated - keyrings violate the COW rule as managing
COW keyrings is tricky, given that it is possible for a task to directly alter
the keys in a keyring in use by another task.
To help enforce this, various pointers to sets of credentials, such as those in
the task_struct, are declared const. The purpose of this is compile-time
discouragement of altering credentials through those pointers. Once a set of
credentials has been made public through one of these pointers, it may not be
modified, except under special circumstances:
(1) Its reference count may incremented and decremented.
(2) The keyrings to which it points may be modified, but not replaced.
The only safe way to modify anything else is to create a replacement and commit
using the functions described in Documentation/credentials.txt (which will be
added by a later patch).
This patch and the preceding patches have been tested with the LTP SELinux
testsuite.
This patch makes several logical sets of alteration:
(1) execve().
This now prepares and commits credentials in various places in the
security code rather than altering the current creds directly.
(2) Temporary credential overrides.
do_coredump() and sys_faccessat() now prepare their own credentials and
temporarily override the ones currently on the acting thread, whilst
preventing interference from other threads by holding cred_replace_mutex
on the thread being dumped.
This will be replaced in a future patch by something that hands down the
credentials directly to the functions being called, rather than altering
the task's objective credentials.
(3) LSM interface.
A number of functions have been changed, added or removed:
(*) security_capset_check(), ->capset_check()
(*) security_capset_set(), ->capset_set()
Removed in favour of security_capset().
(*) security_capset(), ->capset()
New. This is passed a pointer to the new creds, a pointer to the old
creds and the proposed capability sets. It should fill in the new
creds or return an error. All pointers, barring the pointer to the
new creds, are now const.
(*) security_bprm_apply_creds(), ->bprm_apply_creds()
Changed; now returns a value, which will cause the process to be
killed if it's an error.
(*) security_task_alloc(), ->task_alloc_security()
Removed in favour of security_prepare_creds().
(*) security_cred_free(), ->cred_free()
New. Free security data attached to cred->security.
(*) security_prepare_creds(), ->cred_prepare()
New. Duplicate any security data attached to cred->security.
(*) security_commit_creds(), ->cred_commit()
New. Apply any security effects for the upcoming installation of new
security by commit_creds().
(*) security_task_post_setuid(), ->task_post_setuid()
Removed in favour of security_task_fix_setuid().
(*) security_task_fix_setuid(), ->task_fix_setuid()
Fix up the proposed new credentials for setuid(). This is used by
cap_set_fix_setuid() to implicitly adjust capabilities in line with
setuid() changes. Changes are made to the new credentials, rather
than the task itself as in security_task_post_setuid().
(*) security_task_reparent_to_init(), ->task_reparent_to_init()
Removed. Instead the task being reparented to init is referred
directly to init's credentials.
NOTE! This results in the loss of some state: SELinux's osid no
longer records the sid of the thread that forked it.
(*) security_key_alloc(), ->key_alloc()
(*) security_key_permission(), ->key_permission()
Changed. These now take cred pointers rather than task pointers to
refer to the security context.
(4) sys_capset().
This has been simplified and uses less locking. The LSM functions it
calls have been merged.
(5) reparent_to_kthreadd().
This gives the current thread the same credentials as init by simply using
commit_thread() to point that way.
(6) __sigqueue_alloc() and switch_uid()
__sigqueue_alloc() can't stop the target task from changing its creds
beneath it, so this function gets a reference to the currently applicable
user_struct which it then passes into the sigqueue struct it returns if
successful.
switch_uid() is now called from commit_creds(), and possibly should be
folded into that. commit_creds() should take care of protecting
__sigqueue_alloc().
(7) [sg]et[ug]id() and co and [sg]et_current_groups.
The set functions now all use prepare_creds(), commit_creds() and
abort_creds() to build and check a new set of credentials before applying
it.
security_task_set[ug]id() is called inside the prepared section. This
guarantees that nothing else will affect the creds until we've finished.
The calling of set_dumpable() has been moved into commit_creds().
Much of the functionality of set_user() has been moved into
commit_creds().
The get functions all simply access the data directly.
(8) security_task_prctl() and cap_task_prctl().
security_task_prctl() has been modified to return -ENOSYS if it doesn't
want to handle a function, or otherwise return the return value directly
rather than through an argument.
Additionally, cap_task_prctl() now prepares a new set of credentials, even
if it doesn't end up using it.
(9) Keyrings.
A number of changes have been made to the keyrings code:
(a) switch_uid_keyring(), copy_keys(), exit_keys() and suid_keys() have
all been dropped and built in to the credentials functions directly.
They may want separating out again later.
(b) key_alloc() and search_process_keyrings() now take a cred pointer
rather than a task pointer to specify the security context.
(c) copy_creds() gives a new thread within the same thread group a new
thread keyring if its parent had one, otherwise it discards the thread
keyring.
(d) The authorisation key now points directly to the credentials to extend
the search into rather pointing to the task that carries them.
(e) Installing thread, process or session keyrings causes a new set of
credentials to be created, even though it's not strictly necessary for
process or session keyrings (they're shared).
(10) Usermode helper.
The usermode helper code now carries a cred struct pointer in its
subprocess_info struct instead of a new session keyring pointer. This set
of credentials is derived from init_cred and installed on the new process
after it has been cloned.
call_usermodehelper_setup() allocates the new credentials and
call_usermodehelper_freeinfo() discards them if they haven't been used. A
special cred function (prepare_usermodeinfo_creds()) is provided
specifically for call_usermodehelper_setup() to call.
call_usermodehelper_setkeys() adjusts the credentials to sport the
supplied keyring as the new session keyring.
(11) SELinux.
SELinux has a number of changes, in addition to those to support the LSM
interface changes mentioned above:
(a) selinux_setprocattr() no longer does its check for whether the
current ptracer can access processes with the new SID inside the lock
that covers getting the ptracer's SID. Whilst this lock ensures that
the check is done with the ptracer pinned, the result is only valid
until the lock is released, so there's no point doing it inside the
lock.
(12) is_single_threaded().
This function has been extracted from selinux_setprocattr() and put into
a file of its own in the lib/ directory as join_session_keyring() now
wants to use it too.
The code in SELinux just checked to see whether a task shared mm_structs
with other tasks (CLONE_VM), but that isn't good enough. We really want
to know if they're part of the same thread group (CLONE_THREAD).
(13) nfsd.
The NFS server daemon now has to use the COW credentials to set the
credentials it is going to use. It really needs to pass the credentials
down to the functions it calls, but it can't do that until other patches
in this series have been applied.
Signed-off-by: David Howells <dhowells@redhat.com>
Acked-by: James Morris <jmorris@namei.org>
Signed-off-by: James Morris <jmorris@namei.org>
2008-11-14 07:39:23 +08:00
|
|
|
const struct cred *cred = current_cred();
|
2005-09-29 00:03:15 +08:00
|
|
|
struct key *keyring, *key = NULL;
|
|
|
|
key_ref_t key_ref;
|
2005-04-17 06:20:36 +08:00
|
|
|
int ret;
|
2016-09-01 07:05:43 +08:00
|
|
|
struct key_restriction *restrict_link = NULL;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/* look up the key type to see if it's one of the registered kernel
|
|
|
|
* types */
|
2013-09-24 17:35:15 +08:00
|
|
|
index_key.type = key_type_lookup(type);
|
|
|
|
if (IS_ERR(index_key.type)) {
|
2005-09-29 00:03:15 +08:00
|
|
|
key_ref = ERR_PTR(-ENODEV);
|
2005-04-17 06:20:36 +08:00
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
|
2005-09-29 00:03:15 +08:00
|
|
|
key_ref = ERR_PTR(-EINVAL);
|
2014-09-17 00:36:06 +08:00
|
|
|
if (!index_key.type->instantiate ||
|
2013-09-24 17:35:15 +08:00
|
|
|
(!index_key.description && !index_key.type->preparse))
|
2012-09-13 20:06:29 +08:00
|
|
|
goto error_put_type;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2005-09-29 00:03:15 +08:00
|
|
|
keyring = key_ref_to_ptr(keyring_ref);
|
|
|
|
|
|
|
|
key_check(keyring);
|
|
|
|
|
KEYS: Add a facility to restrict new links into a keyring
Add a facility whereby proposed new links to be added to a keyring can be
vetted, permitting them to be rejected if necessary. This can be used to
block public keys from which the signature cannot be verified or for which
the signature verification fails. It could also be used to provide
blacklisting.
This affects operations like add_key(), KEYCTL_LINK and KEYCTL_INSTANTIATE.
To this end:
(1) A function pointer is added to the key struct that, if set, points to
the vetting function. This is called as:
int (*restrict_link)(struct key *keyring,
const struct key_type *key_type,
unsigned long key_flags,
const union key_payload *key_payload),
where 'keyring' will be the keyring being added to, key_type and
key_payload will describe the key being added and key_flags[*] can be
AND'ed with KEY_FLAG_TRUSTED.
[*] This parameter will be removed in a later patch when
KEY_FLAG_TRUSTED is removed.
The function should return 0 to allow the link to take place or an
error (typically -ENOKEY, -ENOPKG or -EKEYREJECTED) to reject the
link.
The pointer should not be set directly, but rather should be set
through keyring_alloc().
Note that if called during add_key(), preparse is called before this
method, but a key isn't actually allocated until after this function
is called.
(2) KEY_ALLOC_BYPASS_RESTRICTION is added. This can be passed to
key_create_or_update() or key_instantiate_and_link() to bypass the
restriction check.
(3) KEY_FLAG_TRUSTED_ONLY is removed. The entire contents of a keyring
with this restriction emplaced can be considered 'trustworthy' by
virtue of being in the keyring when that keyring is consulted.
(4) key_alloc() and keyring_alloc() take an extra argument that will be
used to set restrict_link in the new key. This ensures that the
pointer is set before the key is published, thus preventing a window
of unrestrictedness. Normally this argument will be NULL.
(5) As a temporary affair, keyring_restrict_trusted_only() is added. It
should be passed to keyring_alloc() as the extra argument instead of
setting KEY_FLAG_TRUSTED_ONLY on a keyring. This will be replaced in
a later patch with functions that look in the appropriate places for
authoritative keys.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: Mimi Zohar <zohar@linux.vnet.ibm.com>
2016-04-06 23:14:24 +08:00
|
|
|
if (!(flags & KEY_ALLOC_BYPASS_RESTRICTION))
|
|
|
|
restrict_link = keyring->restrict_link;
|
|
|
|
|
2006-04-10 22:15:21 +08:00
|
|
|
key_ref = ERR_PTR(-ENOTDIR);
|
|
|
|
if (keyring->type != &key_type_keyring)
|
2012-09-13 20:06:29 +08:00
|
|
|
goto error_put_type;
|
|
|
|
|
|
|
|
memset(&prep, 0, sizeof(prep));
|
|
|
|
prep.data = payload;
|
|
|
|
prep.datalen = plen;
|
2013-09-24 17:35:15 +08:00
|
|
|
prep.quotalen = index_key.type->def_datalen;
|
2017-11-16 00:38:45 +08:00
|
|
|
prep.expiry = TIME64_MAX;
|
2013-09-24 17:35:15 +08:00
|
|
|
if (index_key.type->preparse) {
|
|
|
|
ret = index_key.type->preparse(&prep);
|
2012-09-13 20:06:29 +08:00
|
|
|
if (ret < 0) {
|
|
|
|
key_ref = ERR_PTR(ret);
|
2014-07-19 01:56:34 +08:00
|
|
|
goto error_free_prep;
|
2012-09-13 20:06:29 +08:00
|
|
|
}
|
2013-09-24 17:35:15 +08:00
|
|
|
if (!index_key.description)
|
|
|
|
index_key.description = prep.description;
|
2012-09-13 20:06:29 +08:00
|
|
|
key_ref = ERR_PTR(-EINVAL);
|
2013-09-24 17:35:15 +08:00
|
|
|
if (!index_key.description)
|
2012-09-13 20:06:29 +08:00
|
|
|
goto error_free_prep;
|
|
|
|
}
|
2013-09-24 17:35:15 +08:00
|
|
|
index_key.desc_len = strlen(index_key.description);
|
2019-06-27 04:02:31 +08:00
|
|
|
key_set_index_key(&index_key);
|
2006-04-10 22:15:21 +08:00
|
|
|
|
2019-05-30 18:37:39 +08:00
|
|
|
ret = __key_link_lock(keyring, &index_key);
|
2016-10-05 07:27:32 +08:00
|
|
|
if (ret < 0) {
|
|
|
|
key_ref = ERR_PTR(ret);
|
|
|
|
goto error_free_prep;
|
|
|
|
}
|
|
|
|
|
2019-05-30 18:37:39 +08:00
|
|
|
ret = __key_link_begin(keyring, &index_key, &edit);
|
|
|
|
if (ret < 0) {
|
|
|
|
key_ref = ERR_PTR(ret);
|
|
|
|
goto error_link_end;
|
|
|
|
}
|
|
|
|
|
2016-09-01 07:05:43 +08:00
|
|
|
if (restrict_link && restrict_link->check) {
|
|
|
|
ret = restrict_link->check(keyring, index_key.type,
|
|
|
|
&prep.payload, restrict_link->key);
|
KEYS: Add a facility to restrict new links into a keyring
Add a facility whereby proposed new links to be added to a keyring can be
vetted, permitting them to be rejected if necessary. This can be used to
block public keys from which the signature cannot be verified or for which
the signature verification fails. It could also be used to provide
blacklisting.
This affects operations like add_key(), KEYCTL_LINK and KEYCTL_INSTANTIATE.
To this end:
(1) A function pointer is added to the key struct that, if set, points to
the vetting function. This is called as:
int (*restrict_link)(struct key *keyring,
const struct key_type *key_type,
unsigned long key_flags,
const union key_payload *key_payload),
where 'keyring' will be the keyring being added to, key_type and
key_payload will describe the key being added and key_flags[*] can be
AND'ed with KEY_FLAG_TRUSTED.
[*] This parameter will be removed in a later patch when
KEY_FLAG_TRUSTED is removed.
The function should return 0 to allow the link to take place or an
error (typically -ENOKEY, -ENOPKG or -EKEYREJECTED) to reject the
link.
The pointer should not be set directly, but rather should be set
through keyring_alloc().
Note that if called during add_key(), preparse is called before this
method, but a key isn't actually allocated until after this function
is called.
(2) KEY_ALLOC_BYPASS_RESTRICTION is added. This can be passed to
key_create_or_update() or key_instantiate_and_link() to bypass the
restriction check.
(3) KEY_FLAG_TRUSTED_ONLY is removed. The entire contents of a keyring
with this restriction emplaced can be considered 'trustworthy' by
virtue of being in the keyring when that keyring is consulted.
(4) key_alloc() and keyring_alloc() take an extra argument that will be
used to set restrict_link in the new key. This ensures that the
pointer is set before the key is published, thus preventing a window
of unrestrictedness. Normally this argument will be NULL.
(5) As a temporary affair, keyring_restrict_trusted_only() is added. It
should be passed to keyring_alloc() as the extra argument instead of
setting KEY_FLAG_TRUSTED_ONLY on a keyring. This will be replaced in
a later patch with functions that look in the appropriate places for
authoritative keys.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: Mimi Zohar <zohar@linux.vnet.ibm.com>
2016-04-06 23:14:24 +08:00
|
|
|
if (ret < 0) {
|
|
|
|
key_ref = ERR_PTR(ret);
|
2016-10-05 07:27:32 +08:00
|
|
|
goto error_link_end;
|
KEYS: Add a facility to restrict new links into a keyring
Add a facility whereby proposed new links to be added to a keyring can be
vetted, permitting them to be rejected if necessary. This can be used to
block public keys from which the signature cannot be verified or for which
the signature verification fails. It could also be used to provide
blacklisting.
This affects operations like add_key(), KEYCTL_LINK and KEYCTL_INSTANTIATE.
To this end:
(1) A function pointer is added to the key struct that, if set, points to
the vetting function. This is called as:
int (*restrict_link)(struct key *keyring,
const struct key_type *key_type,
unsigned long key_flags,
const union key_payload *key_payload),
where 'keyring' will be the keyring being added to, key_type and
key_payload will describe the key being added and key_flags[*] can be
AND'ed with KEY_FLAG_TRUSTED.
[*] This parameter will be removed in a later patch when
KEY_FLAG_TRUSTED is removed.
The function should return 0 to allow the link to take place or an
error (typically -ENOKEY, -ENOPKG or -EKEYREJECTED) to reject the
link.
The pointer should not be set directly, but rather should be set
through keyring_alloc().
Note that if called during add_key(), preparse is called before this
method, but a key isn't actually allocated until after this function
is called.
(2) KEY_ALLOC_BYPASS_RESTRICTION is added. This can be passed to
key_create_or_update() or key_instantiate_and_link() to bypass the
restriction check.
(3) KEY_FLAG_TRUSTED_ONLY is removed. The entire contents of a keyring
with this restriction emplaced can be considered 'trustworthy' by
virtue of being in the keyring when that keyring is consulted.
(4) key_alloc() and keyring_alloc() take an extra argument that will be
used to set restrict_link in the new key. This ensures that the
pointer is set before the key is published, thus preventing a window
of unrestrictedness. Normally this argument will be NULL.
(5) As a temporary affair, keyring_restrict_trusted_only() is added. It
should be passed to keyring_alloc() as the extra argument instead of
setting KEY_FLAG_TRUSTED_ONLY on a keyring. This will be replaced in
a later patch with functions that look in the appropriate places for
authoritative keys.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: Mimi Zohar <zohar@linux.vnet.ibm.com>
2016-04-06 23:14:24 +08:00
|
|
|
}
|
|
|
|
}
|
2013-08-30 23:07:37 +08:00
|
|
|
|
2005-09-29 00:03:15 +08:00
|
|
|
/* if we're going to allocate a new key, we're going to have
|
|
|
|
* to modify the keyring */
|
2014-03-15 01:44:49 +08:00
|
|
|
ret = key_permission(keyring_ref, KEY_NEED_WRITE);
|
2005-10-31 07:02:44 +08:00
|
|
|
if (ret < 0) {
|
|
|
|
key_ref = ERR_PTR(ret);
|
2012-09-13 20:06:29 +08:00
|
|
|
goto error_link_end;
|
2005-10-31 07:02:44 +08:00
|
|
|
}
|
2005-09-29 00:03:15 +08:00
|
|
|
|
2006-03-25 19:06:52 +08:00
|
|
|
/* if it's possible to update this type of key, search for an existing
|
|
|
|
* key of the same type and description in the destination keyring and
|
|
|
|
* update that instead if possible
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
2013-09-24 17:35:15 +08:00
|
|
|
if (index_key.type->update) {
|
2013-09-24 17:35:18 +08:00
|
|
|
key_ref = find_key_to_update(keyring_ref, &index_key);
|
|
|
|
if (key_ref)
|
2006-03-25 19:06:52 +08:00
|
|
|
goto found_matching_key;
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2019-07-11 09:43:43 +08:00
|
|
|
/* if the client doesn't provide, decide on the permissions we want */
|
|
|
|
if (perm == KEY_PERM_UNDEF) {
|
|
|
|
perm = KEY_POS_VIEW | KEY_POS_SEARCH | KEY_POS_LINK | KEY_POS_SETATTR;
|
|
|
|
perm |= KEY_USR_VIEW;
|
|
|
|
|
|
|
|
if (index_key.type->read)
|
|
|
|
perm |= KEY_POS_READ;
|
|
|
|
|
|
|
|
if (index_key.type == &key_type_keyring ||
|
|
|
|
index_key.type->update)
|
|
|
|
perm |= KEY_POS_WRITE;
|
|
|
|
}
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/* allocate a new key */
|
2013-09-24 17:35:15 +08:00
|
|
|
key = key_alloc(index_key.type, index_key.description,
|
2019-07-11 09:43:43 +08:00
|
|
|
cred->fsuid, cred->fsgid, cred, perm, flags, NULL);
|
2005-04-17 06:20:36 +08:00
|
|
|
if (IS_ERR(key)) {
|
2008-02-07 16:15:26 +08:00
|
|
|
key_ref = ERR_CAST(key);
|
2012-09-13 20:06:29 +08:00
|
|
|
goto error_link_end;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* instantiate it and link it into the target keyring */
|
2013-09-24 17:35:18 +08:00
|
|
|
ret = __key_instantiate_and_link(key, &prep, keyring, NULL, &edit);
|
2005-04-17 06:20:36 +08:00
|
|
|
if (ret < 0) {
|
|
|
|
key_put(key);
|
2005-09-29 00:03:15 +08:00
|
|
|
key_ref = ERR_PTR(ret);
|
2012-09-13 20:06:29 +08:00
|
|
|
goto error_link_end;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
2019-12-12 00:47:05 +08:00
|
|
|
ima_post_key_create_or_update(keyring, key, payload, plen,
|
|
|
|
flags, true);
|
|
|
|
|
2005-09-29 00:03:15 +08:00
|
|
|
key_ref = make_key_ref(key, is_key_possessed(keyring_ref));
|
|
|
|
|
2012-09-13 20:06:29 +08:00
|
|
|
error_link_end:
|
2013-09-24 17:35:18 +08:00
|
|
|
__key_link_end(keyring, &index_key, edit);
|
2012-09-13 20:06:29 +08:00
|
|
|
error_free_prep:
|
2013-09-24 17:35:15 +08:00
|
|
|
if (index_key.type->preparse)
|
|
|
|
index_key.type->free_preparse(&prep);
|
2012-09-13 20:06:29 +08:00
|
|
|
error_put_type:
|
2013-09-24 17:35:15 +08:00
|
|
|
key_type_put(index_key.type);
|
2012-09-13 20:06:29 +08:00
|
|
|
error:
|
2005-09-29 00:03:15 +08:00
|
|
|
return key_ref;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
found_matching_key:
|
|
|
|
/* we found a matching key, so we're going to try to update it
|
|
|
|
* - we can drop the locks first as we have the key pinned
|
|
|
|
*/
|
2013-09-24 17:35:18 +08:00
|
|
|
__key_link_end(keyring, &index_key, edit);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
KEYS: don't let add_key() update an uninstantiated key
Currently, when passed a key that already exists, add_key() will call the
key's ->update() method if such exists. But this is heavily broken in the
case where the key is uninstantiated because it doesn't call
__key_instantiate_and_link(). Consequently, it doesn't do most of the
things that are supposed to happen when the key is instantiated, such as
setting the instantiation state, clearing KEY_FLAG_USER_CONSTRUCT and
awakening tasks waiting on it, and incrementing key->user->nikeys.
It also never takes key_construction_mutex, which means that
->instantiate() can run concurrently with ->update() on the same key. In
the case of the "user" and "logon" key types this causes a memory leak, at
best. Maybe even worse, the ->update() methods of the "encrypted" and
"trusted" key types actually just dereference a NULL pointer when passed an
uninstantiated key.
Change key_create_or_update() to wait interruptibly for the key to finish
construction before continuing.
This patch only affects *uninstantiated* keys. For now we still allow a
negatively instantiated key to be updated (thereby positively
instantiating it), although that's broken too (the next patch fixes it)
and I'm not sure that anyone actually uses that functionality either.
Here is a simple reproducer for the bug using the "encrypted" key type
(requires CONFIG_ENCRYPTED_KEYS=y), though as noted above the bug
pertained to more than just the "encrypted" key type:
#include <stdlib.h>
#include <unistd.h>
#include <keyutils.h>
int main(void)
{
int ringid = keyctl_join_session_keyring(NULL);
if (fork()) {
for (;;) {
const char payload[] = "update user:foo 32";
usleep(rand() % 10000);
add_key("encrypted", "desc", payload, sizeof(payload), ringid);
keyctl_clear(ringid);
}
} else {
for (;;)
request_key("encrypted", "desc", "callout_info", ringid);
}
}
It causes:
BUG: unable to handle kernel NULL pointer dereference at 0000000000000018
IP: encrypted_update+0xb0/0x170
PGD 7a178067 P4D 7a178067 PUD 77269067 PMD 0
PREEMPT SMP
CPU: 0 PID: 340 Comm: reproduce Tainted: G D 4.14.0-rc1-00025-g428490e38b2e #796
Hardware name: QEMU Standard PC (i440FX + PIIX, 1996), BIOS Bochs 01/01/2011
task: ffff8a467a39a340 task.stack: ffffb15c40770000
RIP: 0010:encrypted_update+0xb0/0x170
RSP: 0018:ffffb15c40773de8 EFLAGS: 00010246
RAX: 0000000000000000 RBX: ffff8a467a275b00 RCX: 0000000000000000
RDX: 0000000000000005 RSI: ffff8a467a275b14 RDI: ffffffffb742f303
RBP: ffffb15c40773e20 R08: 0000000000000000 R09: ffff8a467a275b17
R10: 0000000000000020 R11: 0000000000000000 R12: 0000000000000000
R13: 0000000000000000 R14: ffff8a4677057180 R15: ffff8a467a275b0f
FS: 00007f5d7fb08700(0000) GS:ffff8a467f200000(0000) knlGS:0000000000000000
CS: 0010 DS: 0000 ES: 0000 CR0: 0000000080050033
CR2: 0000000000000018 CR3: 0000000077262005 CR4: 00000000001606f0
Call Trace:
key_create_or_update+0x2bc/0x460
SyS_add_key+0x10c/0x1d0
entry_SYSCALL_64_fastpath+0x1f/0xbe
RIP: 0033:0x7f5d7f211259
RSP: 002b:00007ffed03904c8 EFLAGS: 00000246 ORIG_RAX: 00000000000000f8
RAX: ffffffffffffffda RBX: 000000003b2a7955 RCX: 00007f5d7f211259
RDX: 00000000004009e4 RSI: 00000000004009ff RDI: 0000000000400a04
RBP: 0000000068db8bad R08: 000000003b2a7955 R09: 0000000000000004
R10: 000000000000001a R11: 0000000000000246 R12: 0000000000400868
R13: 00007ffed03905d0 R14: 0000000000000000 R15: 0000000000000000
Code: 77 28 e8 64 34 1f 00 45 31 c0 31 c9 48 8d 55 c8 48 89 df 48 8d 75 d0 e8 ff f9 ff ff 85 c0 41 89 c4 0f 88 84 00 00 00 4c 8b 7d c8 <49> 8b 75 18 4c 89 ff e8 24 f8 ff ff 85 c0 41 89 c4 78 6d 49 8b
RIP: encrypted_update+0xb0/0x170 RSP: ffffb15c40773de8
CR2: 0000000000000018
Cc: <stable@vger.kernel.org> # v2.6.12+
Reported-by: Eric Biggers <ebiggers@google.com>
Signed-off-by: David Howells <dhowells@redhat.com>
cc: Eric Biggers <ebiggers@google.com>
2017-10-12 23:00:41 +08:00
|
|
|
key = key_ref_to_ptr(key_ref);
|
|
|
|
if (test_bit(KEY_FLAG_USER_CONSTRUCT, &key->flags)) {
|
|
|
|
ret = wait_for_key_construction(key, true);
|
|
|
|
if (ret < 0) {
|
|
|
|
key_ref_put(key_ref);
|
|
|
|
key_ref = ERR_PTR(ret);
|
|
|
|
goto error_free_prep;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-09-13 20:06:29 +08:00
|
|
|
key_ref = __key_update(key_ref, &prep);
|
2019-12-12 00:47:05 +08:00
|
|
|
|
|
|
|
if (!IS_ERR(key_ref))
|
|
|
|
ima_post_key_create_or_update(keyring, key,
|
|
|
|
payload, plen,
|
|
|
|
flags, false);
|
|
|
|
|
2012-09-13 20:06:29 +08:00
|
|
|
goto error_free_prep;
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
EXPORT_SYMBOL(key_create_or_update);
|
|
|
|
|
2011-01-21 00:38:33 +08:00
|
|
|
/**
|
|
|
|
* key_update - Update a key's contents.
|
|
|
|
* @key_ref: The pointer (plus possession flag) to the key.
|
|
|
|
* @payload: The data to be used to update the key.
|
|
|
|
* @plen: The length of @payload.
|
|
|
|
*
|
|
|
|
* Attempt to update the contents of a key with the given payload data. The
|
|
|
|
* caller must be granted Write permission on the key. Negative keys can be
|
|
|
|
* instantiated by this method.
|
|
|
|
*
|
|
|
|
* Returns 0 on success, -EACCES if not permitted and -EOPNOTSUPP if the key
|
|
|
|
* type does not support updating. The key type may return other errors.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
2005-09-29 00:03:15 +08:00
|
|
|
int key_update(key_ref_t key_ref, const void *payload, size_t plen)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2012-09-13 20:06:29 +08:00
|
|
|
struct key_preparsed_payload prep;
|
2005-09-29 00:03:15 +08:00
|
|
|
struct key *key = key_ref_to_ptr(key_ref);
|
2005-04-17 06:20:36 +08:00
|
|
|
int ret;
|
|
|
|
|
|
|
|
key_check(key);
|
|
|
|
|
|
|
|
/* the key must be writable */
|
2014-03-15 01:44:49 +08:00
|
|
|
ret = key_permission(key_ref, KEY_NEED_WRITE);
|
2005-10-31 07:02:44 +08:00
|
|
|
if (ret < 0)
|
2017-06-08 21:48:47 +08:00
|
|
|
return ret;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/* attempt to update it if supported */
|
2012-09-13 20:06:29 +08:00
|
|
|
if (!key->type->update)
|
2017-06-08 21:48:47 +08:00
|
|
|
return -EOPNOTSUPP;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2012-09-13 20:06:29 +08:00
|
|
|
memset(&prep, 0, sizeof(prep));
|
|
|
|
prep.data = payload;
|
|
|
|
prep.datalen = plen;
|
|
|
|
prep.quotalen = key->type->def_datalen;
|
2017-11-16 00:38:45 +08:00
|
|
|
prep.expiry = TIME64_MAX;
|
2012-09-13 20:06:29 +08:00
|
|
|
if (key->type->preparse) {
|
|
|
|
ret = key->type->preparse(&prep);
|
|
|
|
if (ret < 0)
|
|
|
|
goto error;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
2012-09-13 20:06:29 +08:00
|
|
|
down_write(&key->sem);
|
|
|
|
|
|
|
|
ret = key->type->update(key, &prep);
|
watch_queue: Add a key/keyring notification facility
Add a key/keyring change notification facility whereby notifications about
changes in key and keyring content and attributes can be received.
Firstly, an event queue needs to be created:
pipe2(fds, O_NOTIFICATION_PIPE);
ioctl(fds[1], IOC_WATCH_QUEUE_SET_SIZE, 256);
then a notification can be set up to report notifications via that queue:
struct watch_notification_filter filter = {
.nr_filters = 1,
.filters = {
[0] = {
.type = WATCH_TYPE_KEY_NOTIFY,
.subtype_filter[0] = UINT_MAX,
},
},
};
ioctl(fds[1], IOC_WATCH_QUEUE_SET_FILTER, &filter);
keyctl_watch_key(KEY_SPEC_SESSION_KEYRING, fds[1], 0x01);
After that, records will be placed into the queue when events occur in
which keys are changed in some way. Records are of the following format:
struct key_notification {
struct watch_notification watch;
__u32 key_id;
__u32 aux;
} *n;
Where:
n->watch.type will be WATCH_TYPE_KEY_NOTIFY.
n->watch.subtype will indicate the type of event, such as
NOTIFY_KEY_REVOKED.
n->watch.info & WATCH_INFO_LENGTH will indicate the length of the
record.
n->watch.info & WATCH_INFO_ID will be the second argument to
keyctl_watch_key(), shifted.
n->key will be the ID of the affected key.
n->aux will hold subtype-dependent information, such as the key
being linked into the keyring specified by n->key in the case of
NOTIFY_KEY_LINKED.
Note that it is permissible for event records to be of variable length -
or, at least, the length may be dependent on the subtype. Note also that
the queue can be shared between multiple notifications of various types.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: James Morris <jamorris@linux.microsoft.com>
2020-01-15 01:07:11 +08:00
|
|
|
if (ret == 0) {
|
2017-10-04 23:43:25 +08:00
|
|
|
/* Updating a negative key positively instantiates it */
|
|
|
|
mark_key_instantiated(key, 0);
|
watch_queue: Add a key/keyring notification facility
Add a key/keyring change notification facility whereby notifications about
changes in key and keyring content and attributes can be received.
Firstly, an event queue needs to be created:
pipe2(fds, O_NOTIFICATION_PIPE);
ioctl(fds[1], IOC_WATCH_QUEUE_SET_SIZE, 256);
then a notification can be set up to report notifications via that queue:
struct watch_notification_filter filter = {
.nr_filters = 1,
.filters = {
[0] = {
.type = WATCH_TYPE_KEY_NOTIFY,
.subtype_filter[0] = UINT_MAX,
},
},
};
ioctl(fds[1], IOC_WATCH_QUEUE_SET_FILTER, &filter);
keyctl_watch_key(KEY_SPEC_SESSION_KEYRING, fds[1], 0x01);
After that, records will be placed into the queue when events occur in
which keys are changed in some way. Records are of the following format:
struct key_notification {
struct watch_notification watch;
__u32 key_id;
__u32 aux;
} *n;
Where:
n->watch.type will be WATCH_TYPE_KEY_NOTIFY.
n->watch.subtype will indicate the type of event, such as
NOTIFY_KEY_REVOKED.
n->watch.info & WATCH_INFO_LENGTH will indicate the length of the
record.
n->watch.info & WATCH_INFO_ID will be the second argument to
keyctl_watch_key(), shifted.
n->key will be the ID of the affected key.
n->aux will hold subtype-dependent information, such as the key
being linked into the keyring specified by n->key in the case of
NOTIFY_KEY_LINKED.
Note that it is permissible for event records to be of variable length -
or, at least, the length may be dependent on the subtype. Note also that
the queue can be shared between multiple notifications of various types.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: James Morris <jamorris@linux.microsoft.com>
2020-01-15 01:07:11 +08:00
|
|
|
notify_key(key, NOTIFY_KEY_UPDATED, 0);
|
|
|
|
}
|
2012-09-13 20:06:29 +08:00
|
|
|
|
|
|
|
up_write(&key->sem);
|
|
|
|
|
2014-07-19 01:56:34 +08:00
|
|
|
error:
|
2012-09-13 20:06:29 +08:00
|
|
|
if (key->type->preparse)
|
|
|
|
key->type->free_preparse(&prep);
|
2005-04-17 06:20:36 +08:00
|
|
|
return ret;
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
EXPORT_SYMBOL(key_update);
|
|
|
|
|
2011-01-21 00:38:33 +08:00
|
|
|
/**
|
|
|
|
* key_revoke - Revoke a key.
|
|
|
|
* @key: The key to be revoked.
|
|
|
|
*
|
|
|
|
* Mark a key as being revoked and ask the type to free up its resources. The
|
|
|
|
* revocation timeout is set and the key and all its links will be
|
|
|
|
* automatically garbage collected after key_gc_delay amount of time if they
|
|
|
|
* are not manually dealt with first.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
void key_revoke(struct key *key)
|
|
|
|
{
|
2017-11-16 00:38:45 +08:00
|
|
|
time64_t time;
|
2009-09-02 16:14:00 +08:00
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
key_check(key);
|
|
|
|
|
2007-10-17 14:29:46 +08:00
|
|
|
/* make sure no one's trying to change or use the key when we mark it
|
|
|
|
* - we tell lockdep that we might nest because we might be revoking an
|
|
|
|
* authorisation key whilst holding the sem on a key we've just
|
|
|
|
* instantiated
|
|
|
|
*/
|
|
|
|
down_write_nested(&key->sem, 1);
|
watch_queue: Add a key/keyring notification facility
Add a key/keyring change notification facility whereby notifications about
changes in key and keyring content and attributes can be received.
Firstly, an event queue needs to be created:
pipe2(fds, O_NOTIFICATION_PIPE);
ioctl(fds[1], IOC_WATCH_QUEUE_SET_SIZE, 256);
then a notification can be set up to report notifications via that queue:
struct watch_notification_filter filter = {
.nr_filters = 1,
.filters = {
[0] = {
.type = WATCH_TYPE_KEY_NOTIFY,
.subtype_filter[0] = UINT_MAX,
},
},
};
ioctl(fds[1], IOC_WATCH_QUEUE_SET_FILTER, &filter);
keyctl_watch_key(KEY_SPEC_SESSION_KEYRING, fds[1], 0x01);
After that, records will be placed into the queue when events occur in
which keys are changed in some way. Records are of the following format:
struct key_notification {
struct watch_notification watch;
__u32 key_id;
__u32 aux;
} *n;
Where:
n->watch.type will be WATCH_TYPE_KEY_NOTIFY.
n->watch.subtype will indicate the type of event, such as
NOTIFY_KEY_REVOKED.
n->watch.info & WATCH_INFO_LENGTH will indicate the length of the
record.
n->watch.info & WATCH_INFO_ID will be the second argument to
keyctl_watch_key(), shifted.
n->key will be the ID of the affected key.
n->aux will hold subtype-dependent information, such as the key
being linked into the keyring specified by n->key in the case of
NOTIFY_KEY_LINKED.
Note that it is permissible for event records to be of variable length -
or, at least, the length may be dependent on the subtype. Note also that
the queue can be shared between multiple notifications of various types.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: James Morris <jamorris@linux.microsoft.com>
2020-01-15 01:07:11 +08:00
|
|
|
if (!test_and_set_bit(KEY_FLAG_REVOKED, &key->flags)) {
|
|
|
|
notify_key(key, NOTIFY_KEY_REVOKED, 0);
|
|
|
|
if (key->type->revoke)
|
|
|
|
key->type->revoke(key);
|
|
|
|
|
|
|
|
/* set the death time to no more than the expiry time */
|
|
|
|
time = ktime_get_real_seconds();
|
|
|
|
if (key->revoked_at == 0 || key->revoked_at > time) {
|
|
|
|
key->revoked_at = time;
|
|
|
|
key_schedule_gc(key->revoked_at + key_gc_delay);
|
|
|
|
}
|
2009-09-02 16:14:00 +08:00
|
|
|
}
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
up_write(&key->sem);
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
EXPORT_SYMBOL(key_revoke);
|
|
|
|
|
2012-05-11 17:56:56 +08:00
|
|
|
/**
|
|
|
|
* key_invalidate - Invalidate a key.
|
|
|
|
* @key: The key to be invalidated.
|
|
|
|
*
|
|
|
|
* Mark a key as being invalidated and have it cleaned up immediately. The key
|
|
|
|
* is ignored by all searches and other operations from this point.
|
|
|
|
*/
|
|
|
|
void key_invalidate(struct key *key)
|
|
|
|
{
|
|
|
|
kenter("%d", key_serial(key));
|
|
|
|
|
|
|
|
key_check(key);
|
|
|
|
|
|
|
|
if (!test_bit(KEY_FLAG_INVALIDATED, &key->flags)) {
|
|
|
|
down_write_nested(&key->sem, 1);
|
watch_queue: Add a key/keyring notification facility
Add a key/keyring change notification facility whereby notifications about
changes in key and keyring content and attributes can be received.
Firstly, an event queue needs to be created:
pipe2(fds, O_NOTIFICATION_PIPE);
ioctl(fds[1], IOC_WATCH_QUEUE_SET_SIZE, 256);
then a notification can be set up to report notifications via that queue:
struct watch_notification_filter filter = {
.nr_filters = 1,
.filters = {
[0] = {
.type = WATCH_TYPE_KEY_NOTIFY,
.subtype_filter[0] = UINT_MAX,
},
},
};
ioctl(fds[1], IOC_WATCH_QUEUE_SET_FILTER, &filter);
keyctl_watch_key(KEY_SPEC_SESSION_KEYRING, fds[1], 0x01);
After that, records will be placed into the queue when events occur in
which keys are changed in some way. Records are of the following format:
struct key_notification {
struct watch_notification watch;
__u32 key_id;
__u32 aux;
} *n;
Where:
n->watch.type will be WATCH_TYPE_KEY_NOTIFY.
n->watch.subtype will indicate the type of event, such as
NOTIFY_KEY_REVOKED.
n->watch.info & WATCH_INFO_LENGTH will indicate the length of the
record.
n->watch.info & WATCH_INFO_ID will be the second argument to
keyctl_watch_key(), shifted.
n->key will be the ID of the affected key.
n->aux will hold subtype-dependent information, such as the key
being linked into the keyring specified by n->key in the case of
NOTIFY_KEY_LINKED.
Note that it is permissible for event records to be of variable length -
or, at least, the length may be dependent on the subtype. Note also that
the queue can be shared between multiple notifications of various types.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: James Morris <jamorris@linux.microsoft.com>
2020-01-15 01:07:11 +08:00
|
|
|
if (!test_and_set_bit(KEY_FLAG_INVALIDATED, &key->flags)) {
|
|
|
|
notify_key(key, NOTIFY_KEY_INVALIDATED, 0);
|
2012-05-11 17:56:56 +08:00
|
|
|
key_schedule_gc_links();
|
watch_queue: Add a key/keyring notification facility
Add a key/keyring change notification facility whereby notifications about
changes in key and keyring content and attributes can be received.
Firstly, an event queue needs to be created:
pipe2(fds, O_NOTIFICATION_PIPE);
ioctl(fds[1], IOC_WATCH_QUEUE_SET_SIZE, 256);
then a notification can be set up to report notifications via that queue:
struct watch_notification_filter filter = {
.nr_filters = 1,
.filters = {
[0] = {
.type = WATCH_TYPE_KEY_NOTIFY,
.subtype_filter[0] = UINT_MAX,
},
},
};
ioctl(fds[1], IOC_WATCH_QUEUE_SET_FILTER, &filter);
keyctl_watch_key(KEY_SPEC_SESSION_KEYRING, fds[1], 0x01);
After that, records will be placed into the queue when events occur in
which keys are changed in some way. Records are of the following format:
struct key_notification {
struct watch_notification watch;
__u32 key_id;
__u32 aux;
} *n;
Where:
n->watch.type will be WATCH_TYPE_KEY_NOTIFY.
n->watch.subtype will indicate the type of event, such as
NOTIFY_KEY_REVOKED.
n->watch.info & WATCH_INFO_LENGTH will indicate the length of the
record.
n->watch.info & WATCH_INFO_ID will be the second argument to
keyctl_watch_key(), shifted.
n->key will be the ID of the affected key.
n->aux will hold subtype-dependent information, such as the key
being linked into the keyring specified by n->key in the case of
NOTIFY_KEY_LINKED.
Note that it is permissible for event records to be of variable length -
or, at least, the length may be dependent on the subtype. Note also that
the queue can be shared between multiple notifications of various types.
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: James Morris <jamorris@linux.microsoft.com>
2020-01-15 01:07:11 +08:00
|
|
|
}
|
2012-05-11 17:56:56 +08:00
|
|
|
up_write(&key->sem);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(key_invalidate);
|
|
|
|
|
2014-07-19 01:56:34 +08:00
|
|
|
/**
|
|
|
|
* generic_key_instantiate - Simple instantiation of a key from preparsed data
|
|
|
|
* @key: The key to be instantiated
|
|
|
|
* @prep: The preparsed data to load.
|
|
|
|
*
|
|
|
|
* Instantiate a key from preparsed data. We assume we can just copy the data
|
|
|
|
* in directly and clear the old pointers.
|
|
|
|
*
|
|
|
|
* This can be pointed to directly by the key type instantiate op pointer.
|
|
|
|
*/
|
|
|
|
int generic_key_instantiate(struct key *key, struct key_preparsed_payload *prep)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
pr_devel("==>%s()\n", __func__);
|
|
|
|
|
|
|
|
ret = key_payload_reserve(key, prep->quotalen);
|
|
|
|
if (ret == 0) {
|
2015-10-21 21:04:48 +08:00
|
|
|
rcu_assign_keypointer(key, prep->payload.data[0]);
|
|
|
|
key->payload.data[1] = prep->payload.data[1];
|
|
|
|
key->payload.data[2] = prep->payload.data[2];
|
|
|
|
key->payload.data[3] = prep->payload.data[3];
|
|
|
|
prep->payload.data[0] = NULL;
|
|
|
|
prep->payload.data[1] = NULL;
|
|
|
|
prep->payload.data[2] = NULL;
|
|
|
|
prep->payload.data[3] = NULL;
|
2014-07-19 01:56:34 +08:00
|
|
|
}
|
|
|
|
pr_devel("<==%s() = %d\n", __func__, ret);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(generic_key_instantiate);
|
|
|
|
|
2011-01-21 00:38:33 +08:00
|
|
|
/**
|
|
|
|
* register_key_type - Register a type of key.
|
|
|
|
* @ktype: The new key type.
|
|
|
|
*
|
|
|
|
* Register a new key type.
|
|
|
|
*
|
|
|
|
* Returns 0 on success or -EEXIST if a type of this name already exists.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
int register_key_type(struct key_type *ktype)
|
|
|
|
{
|
|
|
|
struct key_type *p;
|
|
|
|
int ret;
|
|
|
|
|
2011-11-16 19:15:54 +08:00
|
|
|
memset(&ktype->lock_class, 0, sizeof(ktype->lock_class));
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
ret = -EEXIST;
|
|
|
|
down_write(&key_types_sem);
|
|
|
|
|
|
|
|
/* disallow key types with the same name */
|
|
|
|
list_for_each_entry(p, &key_types_list, link) {
|
|
|
|
if (strcmp(p->name, ktype->name) == 0)
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* store the type */
|
|
|
|
list_add(&ktype->link, &key_types_list);
|
2012-05-11 17:56:56 +08:00
|
|
|
|
|
|
|
pr_notice("Key type %s registered\n", ktype->name);
|
2005-04-17 06:20:36 +08:00
|
|
|
ret = 0;
|
|
|
|
|
2011-01-21 00:38:33 +08:00
|
|
|
out:
|
2005-04-17 06:20:36 +08:00
|
|
|
up_write(&key_types_sem);
|
|
|
|
return ret;
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
EXPORT_SYMBOL(register_key_type);
|
|
|
|
|
2011-01-21 00:38:33 +08:00
|
|
|
/**
|
|
|
|
* unregister_key_type - Unregister a type of key.
|
|
|
|
* @ktype: The key type.
|
|
|
|
*
|
|
|
|
* Unregister a key type and mark all the extant keys of this type as dead.
|
|
|
|
* Those keys of this type are then destroyed to get rid of their payloads and
|
|
|
|
* they and their links will be garbage collected as soon as possible.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
void unregister_key_type(struct key_type *ktype)
|
|
|
|
{
|
|
|
|
down_write(&key_types_sem);
|
|
|
|
list_del_init(&ktype->link);
|
KEYS: Correctly destroy key payloads when their keytype is removed
unregister_key_type() has code to mark a key as dead and make it unavailable in
one loop and then destroy all those unavailable key payloads in the next loop.
However, the loop to mark keys dead renders the key undetectable to the second
loop by changing the key type pointer also.
Fix this by the following means:
(1) The key code has two garbage collectors: one deletes unreferenced keys and
the other alters keyrings to delete links to old dead, revoked and expired
keys. They can end up holding each other up as both want to scan the key
serial tree under spinlock. Combine these into a single routine.
(2) Move the dead key marking, dead link removal and dead key removal into the
garbage collector as a three phase process running over the three cycles
of the normal garbage collection procedure. This is tracked by the
KEY_GC_REAPING_DEAD_1, _2 and _3 state flags.
unregister_key_type() then just unlinks the key type from the list, wakes
up the garbage collector and waits for the third phase to complete.
(3) Downgrade the key types sem in unregister_key_type() once it has deleted
the key type from the list so that it doesn't block the keyctl() syscall.
(4) Dead keys that cannot be simply removed in the third phase have their
payloads destroyed with the key's semaphore write-locked to prevent
interference by the keyctl() syscall. There should be no in-kernel users
of dead keys of that type by the point of unregistration, though keyctl()
may be holding a reference.
(5) Only perform timer recalculation in the GC if the timer actually expired.
If it didn't, we'll get another cycle when it goes off - and if the key
that actually triggered it has been removed, it's not a problem.
(6) Only garbage collect link if the timer expired or if we're doing dead key
clean up phase 2.
(7) As only key_garbage_collector() is permitted to use rb_erase() on the key
serial tree, it doesn't need to revalidate its cursor after dropping the
spinlock as the node the cursor points to must still exist in the tree.
(8) Drop the spinlock in the GC if there is contention on it or if we need to
reschedule. After dealing with that, get the spinlock again and resume
scanning.
This has been tested in the following ways:
(1) Run the keyutils testsuite against it.
(2) Using the AF_RXRPC and RxKAD modules to test keytype removal:
Load the rxrpc_s key type:
# insmod /tmp/af-rxrpc.ko
# insmod /tmp/rxkad.ko
Create a key (http://people.redhat.com/~dhowells/rxrpc/listen.c):
# /tmp/listen &
[1] 8173
Find the key:
# grep rxrpc_s /proc/keys
091086e1 I--Q-- 1 perm 39390000 0 0 rxrpc_s 52:2
Link it to a session keyring, preferably one with a higher serial number:
# keyctl link 0x20e36251 @s
Kill the process (the key should remain as it's linked to another place):
# fg
/tmp/listen
^C
Remove the key type:
rmmod rxkad
rmmod af-rxrpc
This can be made a more effective test by altering the following part of
the patch:
if (unlikely(gc_state & KEY_GC_REAPING_DEAD_2)) {
/* Make sure everyone revalidates their keys if we marked a
* bunch as being dead and make sure all keyring ex-payloads
* are destroyed.
*/
kdebug("dead sync");
synchronize_rcu();
To call synchronize_rcu() in GC phase 1 instead. That causes that the
keyring's old payload content to hang around longer until it's RCU
destroyed - which usually happens after GC phase 3 is complete. This
allows the destroy_dead_key branch to be tested.
Reported-by: Benjamin Coddington <bcodding@gmail.com>
Signed-off-by: David Howells <dhowells@redhat.com>
Signed-off-by: James Morris <jmorris@namei.org>
2011-08-22 21:09:36 +08:00
|
|
|
downgrade_write(&key_types_sem);
|
|
|
|
key_gc_keytype(ktype);
|
2012-05-11 17:56:56 +08:00
|
|
|
pr_notice("Key type %s unregistered\n", ktype->name);
|
KEYS: Correctly destroy key payloads when their keytype is removed
unregister_key_type() has code to mark a key as dead and make it unavailable in
one loop and then destroy all those unavailable key payloads in the next loop.
However, the loop to mark keys dead renders the key undetectable to the second
loop by changing the key type pointer also.
Fix this by the following means:
(1) The key code has two garbage collectors: one deletes unreferenced keys and
the other alters keyrings to delete links to old dead, revoked and expired
keys. They can end up holding each other up as both want to scan the key
serial tree under spinlock. Combine these into a single routine.
(2) Move the dead key marking, dead link removal and dead key removal into the
garbage collector as a three phase process running over the three cycles
of the normal garbage collection procedure. This is tracked by the
KEY_GC_REAPING_DEAD_1, _2 and _3 state flags.
unregister_key_type() then just unlinks the key type from the list, wakes
up the garbage collector and waits for the third phase to complete.
(3) Downgrade the key types sem in unregister_key_type() once it has deleted
the key type from the list so that it doesn't block the keyctl() syscall.
(4) Dead keys that cannot be simply removed in the third phase have their
payloads destroyed with the key's semaphore write-locked to prevent
interference by the keyctl() syscall. There should be no in-kernel users
of dead keys of that type by the point of unregistration, though keyctl()
may be holding a reference.
(5) Only perform timer recalculation in the GC if the timer actually expired.
If it didn't, we'll get another cycle when it goes off - and if the key
that actually triggered it has been removed, it's not a problem.
(6) Only garbage collect link if the timer expired or if we're doing dead key
clean up phase 2.
(7) As only key_garbage_collector() is permitted to use rb_erase() on the key
serial tree, it doesn't need to revalidate its cursor after dropping the
spinlock as the node the cursor points to must still exist in the tree.
(8) Drop the spinlock in the GC if there is contention on it or if we need to
reschedule. After dealing with that, get the spinlock again and resume
scanning.
This has been tested in the following ways:
(1) Run the keyutils testsuite against it.
(2) Using the AF_RXRPC and RxKAD modules to test keytype removal:
Load the rxrpc_s key type:
# insmod /tmp/af-rxrpc.ko
# insmod /tmp/rxkad.ko
Create a key (http://people.redhat.com/~dhowells/rxrpc/listen.c):
# /tmp/listen &
[1] 8173
Find the key:
# grep rxrpc_s /proc/keys
091086e1 I--Q-- 1 perm 39390000 0 0 rxrpc_s 52:2
Link it to a session keyring, preferably one with a higher serial number:
# keyctl link 0x20e36251 @s
Kill the process (the key should remain as it's linked to another place):
# fg
/tmp/listen
^C
Remove the key type:
rmmod rxkad
rmmod af-rxrpc
This can be made a more effective test by altering the following part of
the patch:
if (unlikely(gc_state & KEY_GC_REAPING_DEAD_2)) {
/* Make sure everyone revalidates their keys if we marked a
* bunch as being dead and make sure all keyring ex-payloads
* are destroyed.
*/
kdebug("dead sync");
synchronize_rcu();
To call synchronize_rcu() in GC phase 1 instead. That causes that the
keyring's old payload content to hang around longer until it's RCU
destroyed - which usually happens after GC phase 3 is complete. This
allows the destroy_dead_key branch to be tested.
Reported-by: Benjamin Coddington <bcodding@gmail.com>
Signed-off-by: David Howells <dhowells@redhat.com>
Signed-off-by: James Morris <jmorris@namei.org>
2011-08-22 21:09:36 +08:00
|
|
|
up_read(&key_types_sem);
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
EXPORT_SYMBOL(unregister_key_type);
|
|
|
|
|
|
|
|
/*
|
2011-01-21 00:38:33 +08:00
|
|
|
* Initialise the key management state.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
void __init key_init(void)
|
|
|
|
{
|
|
|
|
/* allocate a slab in which we can store keys */
|
|
|
|
key_jar = kmem_cache_create("key_jar", sizeof(struct key),
|
2007-07-20 09:11:58 +08:00
|
|
|
0, SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/* add the special key types */
|
|
|
|
list_add_tail(&key_type_keyring.link, &key_types_list);
|
|
|
|
list_add_tail(&key_type_dead.link, &key_types_list);
|
|
|
|
list_add_tail(&key_type_user.link, &key_types_list);
|
2012-01-18 05:09:11 +08:00
|
|
|
list_add_tail(&key_type_logon.link, &key_types_list);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/* record the root user tracking */
|
|
|
|
rb_link_node(&root_key_user.node,
|
|
|
|
NULL,
|
|
|
|
&key_user_tree.rb_node);
|
|
|
|
|
|
|
|
rb_insert_color(&root_key_user.node,
|
|
|
|
&key_user_tree);
|
2011-01-21 00:38:27 +08:00
|
|
|
}
|