big_key.c 10.1 KB
Newer Older
1 2
/* Large capacity key type
 *
3
 * Copyright (C) 2017 Jason A. Donenfeld <Jason@zx2c4.com>. All Rights Reserved.
4 5 6 7 8 9 10 11 12
 * Copyright (C) 2013 Red Hat, Inc. All Rights Reserved.
 * Written by David Howells (dhowells@redhat.com)
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public Licence
 * as published by the Free Software Foundation; either version
 * 2 of the Licence, or (at your option) any later version.
 */

13
#define pr_fmt(fmt) "big_key: "fmt
14 15 16 17 18
#include <linux/init.h>
#include <linux/seq_file.h>
#include <linux/file.h>
#include <linux/shmem_fs.h>
#include <linux/err.h>
19
#include <linux/scatterlist.h>
20
#include <linux/random.h>
21 22
#include <keys/user-type.h>
#include <keys/big_key-type.h>
23
#include <crypto/aead.h>
24

25 26 27 28 29 30 31
struct big_key_buf {
	unsigned int		nr_pages;
	void			*virt;
	struct scatterlist	*sg;
	struct page		*pages[];
};

32 33 34 35 36 37 38 39 40 41
/*
 * Layout of key payload words.
 */
enum {
	big_key_data,
	big_key_path,
	big_key_path_2nd_part,
	big_key_len,
};

42 43 44 45 46 47 48 49
/*
 * Crypto operation with big_key data
 */
enum big_key_op {
	BIG_KEY_ENC,
	BIG_KEY_DEC,
};

50 51 52 53 54 55 56
/*
 * If the data is under this limit, there's no point creating a shm file to
 * hold it as the permanently resident metadata for the shmem fs will be at
 * least as large as the data.
 */
#define BIG_KEY_FILE_THRESHOLD (sizeof(struct inode) + sizeof(struct dentry))

57 58 59
/*
 * Key size for big_key data encryption
 */
60 61 62 63 64 65
#define ENC_KEY_SIZE 32

/*
 * Authentication tag length
 */
#define ENC_AUTHTAG_SIZE 16
66

67 68 69 70 71 72
/*
 * big_key defined keys take an arbitrary string as the description and an
 * arbitrary blob of data as the payload
 */
struct key_type key_type_big_key = {
	.name			= "big_key",
73 74 75
	.preparse		= big_key_preparse,
	.free_preparse		= big_key_free_preparse,
	.instantiate		= generic_key_instantiate,
76 77 78 79
	.revoke			= big_key_revoke,
	.destroy		= big_key_destroy,
	.describe		= big_key_describe,
	.read			= big_key_read,
80
	/* no ->update(); don't add it without changing big_key_crypt() nonce */
81 82
};

83
/*
84
 * Crypto names for big_key data authenticated encryption
85
 */
86
static const char big_key_alg_name[] = "gcm(aes)";
87 88

/*
89
 * Crypto algorithms for big_key data authenticated encryption
90
 */
91
static struct crypto_aead *big_key_aead;
92 93

/*
94
 * Since changing the key affects the entire object, we need a mutex.
95
 */
96
static DEFINE_MUTEX(big_key_aead_lock);
97 98 99 100

/*
 * Encrypt/decrypt big_key data
 */
101
static int big_key_crypt(enum big_key_op op, struct big_key_buf *buf, size_t datalen, u8 *key)
102
{
103 104 105 106 107 108 109 110 111 112 113 114 115 116 117
	int ret;
	struct aead_request *aead_req;
	/* We always use a zero nonce. The reason we can get away with this is
	 * because we're using a different randomly generated key for every
	 * different encryption. Notably, too, key_type_big_key doesn't define
	 * an .update function, so there's no chance we'll wind up reusing the
	 * key to encrypt updated data. Simply put: one key, one encryption.
	 */
	u8 zero_nonce[crypto_aead_ivsize(big_key_aead)];

	aead_req = aead_request_alloc(big_key_aead, GFP_KERNEL);
	if (!aead_req)
		return -ENOMEM;

	memset(zero_nonce, 0, sizeof(zero_nonce));
118
	aead_request_set_crypt(aead_req, buf->sg, buf->sg, datalen, zero_nonce);
119 120 121 122 123
	aead_request_set_callback(aead_req, CRYPTO_TFM_REQ_MAY_SLEEP, NULL, NULL);
	aead_request_set_ad(aead_req, 0);

	mutex_lock(&big_key_aead_lock);
	if (crypto_aead_setkey(big_key_aead, key, ENC_KEY_SIZE)) {
124 125 126 127
		ret = -EAGAIN;
		goto error;
	}
	if (op == BIG_KEY_ENC)
128
		ret = crypto_aead_encrypt(aead_req);
129
	else
130
		ret = crypto_aead_decrypt(aead_req);
131
error:
132 133
	mutex_unlock(&big_key_aead_lock);
	aead_request_free(aead_req);
134 135 136
	return ret;
}

137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197
/*
 * Free up the buffer.
 */
static void big_key_free_buffer(struct big_key_buf *buf)
{
	unsigned int i;

	if (buf->virt) {
		memset(buf->virt, 0, buf->nr_pages * PAGE_SIZE);
		vunmap(buf->virt);
	}

	for (i = 0; i < buf->nr_pages; i++)
		if (buf->pages[i])
			__free_page(buf->pages[i]);

	kfree(buf);
}

/*
 * Allocate a buffer consisting of a set of pages with a virtual mapping
 * applied over them.
 */
static void *big_key_alloc_buffer(size_t len)
{
	struct big_key_buf *buf;
	unsigned int npg = (len + PAGE_SIZE - 1) >> PAGE_SHIFT;
	unsigned int i, l;

	buf = kzalloc(sizeof(struct big_key_buf) +
		      sizeof(struct page) * npg +
		      sizeof(struct scatterlist) * npg,
		      GFP_KERNEL);
	if (!buf)
		return NULL;

	buf->nr_pages = npg;
	buf->sg = (void *)(buf->pages + npg);
	sg_init_table(buf->sg, npg);

	for (i = 0; i < buf->nr_pages; i++) {
		buf->pages[i] = alloc_page(GFP_KERNEL);
		if (!buf->pages[i])
			goto nomem;

		l = min_t(size_t, len, PAGE_SIZE);
		sg_set_page(&buf->sg[i], buf->pages[i], l, 0);
		len -= l;
	}

	buf->virt = vmap(buf->pages, buf->nr_pages, VM_MAP, PAGE_KERNEL);
	if (!buf->virt)
		goto nomem;

	return buf;

nomem:
	big_key_free_buffer(buf);
	return NULL;
}

198
/*
199
 * Preparse a big key
200
 */
201
int big_key_preparse(struct key_preparsed_payload *prep)
202
{
203
	struct big_key_buf *buf;
204
	struct path *path = (struct path *)&prep->payload.data[big_key_path];
205
	struct file *file;
206
	u8 *enckey;
207
	ssize_t written;
208
	size_t datalen = prep->datalen, enclen = datalen + ENC_AUTHTAG_SIZE;
209 210 211
	int ret;

	if (datalen <= 0 || datalen > 1024 * 1024 || !prep->data)
212
		return -EINVAL;
213 214

	/* Set an arbitrary quota */
215
	prep->quotalen = 16;
216

217
	prep->payload.data[big_key_len] = (void *)(unsigned long)datalen;
218 219 220 221 222

	if (datalen > BIG_KEY_FILE_THRESHOLD) {
		/* Create a shmem file to store the data in.  This will permit the data
		 * to be swapped out if needed.
		 *
223
		 * File content is stored encrypted with randomly generated key.
224
		 */
225
		loff_t pos = 0;
226

227 228
		buf = big_key_alloc_buffer(enclen);
		if (!buf)
229
			return -ENOMEM;
230
		memcpy(buf->virt, prep->data, datalen);
231 232 233 234 235 236 237

		/* generate random key */
		enckey = kmalloc(ENC_KEY_SIZE, GFP_KERNEL);
		if (!enckey) {
			ret = -ENOMEM;
			goto error;
		}
238 239
		ret = get_random_bytes_wait(enckey, ENC_KEY_SIZE);
		if (unlikely(ret))
240 241 242
			goto err_enckey;

		/* encrypt aligned data */
243
		ret = big_key_crypt(BIG_KEY_ENC, buf, datalen, enckey);
244 245 246 247 248
		if (ret)
			goto err_enckey;

		/* save aligned data to file */
		file = shmem_kernel_file_setup("", enclen, 0);
249 250
		if (IS_ERR(file)) {
			ret = PTR_ERR(file);
251
			goto err_enckey;
252
		}
253

254
		written = kernel_write(file, buf->virt, enclen, &pos);
255
		if (written != enclen) {
256
			ret = written;
257 258 259 260 261 262 263 264
			if (written >= 0)
				ret = -ENOMEM;
			goto err_fput;
		}

		/* Pin the mount and dentry to the key so that we can open it again
		 * later
		 */
265
		prep->payload.data[big_key_data] = enckey;
266 267 268
		*path = file->f_path;
		path_get(path);
		fput(file);
269
		big_key_free_buffer(buf);
270 271 272
	} else {
		/* Just store the data in a buffer */
		void *data = kmalloc(datalen, GFP_KERNEL);
273

274 275
		if (!data)
			return -ENOMEM;
276

277 278
		prep->payload.data[big_key_data] = data;
		memcpy(data, prep->data, prep->datalen);
279 280 281 282 283
	}
	return 0;

err_fput:
	fput(file);
284
err_enckey:
285
	kzfree(enckey);
286
error:
287
	big_key_free_buffer(buf);
288 289 290
	return ret;
}

291 292 293 294 295 296
/*
 * Clear preparsement.
 */
void big_key_free_preparse(struct key_preparsed_payload *prep)
{
	if (prep->datalen > BIG_KEY_FILE_THRESHOLD) {
297
		struct path *path = (struct path *)&prep->payload.data[big_key_path];
298

299 300
		path_put(path);
	}
301
	kzfree(prep->payload.data[big_key_data]);
302 303
}

304 305 306 307 308 309
/*
 * dispose of the links from a revoked keyring
 * - called with the key sem write-locked
 */
void big_key_revoke(struct key *key)
{
310
	struct path *path = (struct path *)&key->payload.data[big_key_path];
311 312 313

	/* clear the quota */
	key_payload_reserve(key, 0);
314
	if (key_is_positive(key) &&
315
	    (size_t)key->payload.data[big_key_len] > BIG_KEY_FILE_THRESHOLD)
316 317 318 319 320 321 322 323
		vfs_truncate(path, 0);
}

/*
 * dispose of the data dangling from the corpse of a big_key key
 */
void big_key_destroy(struct key *key)
{
324 325
	size_t datalen = (size_t)key->payload.data[big_key_len];

326
	if (datalen > BIG_KEY_FILE_THRESHOLD) {
327
		struct path *path = (struct path *)&key->payload.data[big_key_path];
328

329 330 331 332
		path_put(path);
		path->mnt = NULL;
		path->dentry = NULL;
	}
333
	kzfree(key->payload.data[big_key_data]);
334
	key->payload.data[big_key_data] = NULL;
335 336 337 338 339 340 341
}

/*
 * describe the big_key key
 */
void big_key_describe(const struct key *key, struct seq_file *m)
{
342
	size_t datalen = (size_t)key->payload.data[big_key_len];
343 344 345

	seq_puts(m, key->description);

346
	if (key_is_positive(key))
347
		seq_printf(m, ": %zu [%s]",
348 349 350 351 352 353 354 355 356 357
			   datalen,
			   datalen > BIG_KEY_FILE_THRESHOLD ? "file" : "buff");
}

/*
 * read the key data
 * - the key's semaphore is read-locked
 */
long big_key_read(const struct key *key, char __user *buffer, size_t buflen)
{
358
	size_t datalen = (size_t)key->payload.data[big_key_len];
359 360 361 362 363 364
	long ret;

	if (!buffer || buflen < datalen)
		return datalen;

	if (datalen > BIG_KEY_FILE_THRESHOLD) {
365
		struct big_key_buf *buf;
366
		struct path *path = (struct path *)&key->payload.data[big_key_path];
367
		struct file *file;
368
		u8 *enckey = (u8 *)key->payload.data[big_key_data];
369
		size_t enclen = datalen + ENC_AUTHTAG_SIZE;
370
		loff_t pos = 0;
371

372 373
		buf = big_key_alloc_buffer(enclen);
		if (!buf)
374
			return -ENOMEM;
375 376

		file = dentry_open(path, O_RDONLY, current_cred());
377 378 379 380
		if (IS_ERR(file)) {
			ret = PTR_ERR(file);
			goto error;
		}
381

382
		/* read file to kernel and decrypt */
383
		ret = kernel_read(file, buf->virt, enclen, &pos);
384
		if (ret >= 0 && ret != enclen) {
385
			ret = -EIO;
386 387 388
			goto err_fput;
		}

389
		ret = big_key_crypt(BIG_KEY_DEC, buf, enclen, enckey);
390 391 392 393 394 395
		if (ret)
			goto err_fput;

		ret = datalen;

		/* copy decrypted data to user */
396
		if (copy_to_user(buffer, buf->virt, datalen) != 0)
397 398 399 400 401
			ret = -EFAULT;

err_fput:
		fput(file);
error:
402
		big_key_free_buffer(buf);
403 404
	} else {
		ret = datalen;
405 406
		if (copy_to_user(buffer, key->payload.data[big_key_data],
				 datalen) != 0)
407 408 409 410 411 412
			ret = -EFAULT;
	}

	return ret;
}

413 414 415
/*
 * Register key type
 */
416 417
static int __init big_key_init(void)
{
418
	int ret;
419 420

	/* init block cipher */
421 422 423
	big_key_aead = crypto_alloc_aead(big_key_alg_name, 0, CRYPTO_ALG_ASYNC);
	if (IS_ERR(big_key_aead)) {
		ret = PTR_ERR(big_key_aead);
424
		pr_err("Can't alloc crypto: %d\n", ret);
425 426 427 428 429 430
		return ret;
	}
	ret = crypto_aead_setauthsize(big_key_aead, ENC_AUTHTAG_SIZE);
	if (ret < 0) {
		pr_err("Can't set crypto auth tag len: %d\n", ret);
		goto free_aead;
431 432 433 434 435
	}

	ret = register_key_type(&key_type_big_key);
	if (ret < 0) {
		pr_err("Can't register type: %d\n", ret);
436
		goto free_aead;
437 438 439 440
	}

	return 0;

441 442
free_aead:
	crypto_free_aead(big_key_aead);
443 444 445
	return ret;
}

446
late_initcall(big_key_init);