2000-02-24 14:29:47 +00:00
|
|
|
/*
|
|
|
|
* Author: Tatu Ylonen <ylo@cs.hut.fi>
|
|
|
|
* Copyright (c) 1995 Tatu Ylonen <ylo@cs.hut.fi>, Espoo, Finland
|
|
|
|
* All rights reserved
|
2000-09-10 08:31:17 +00:00
|
|
|
* Functions for manipulating the known hosts files.
|
2000-05-15 04:37:24 +00:00
|
|
|
*
|
2000-09-10 08:31:17 +00:00
|
|
|
* As far as I am concerned, the code I have written for this software
|
|
|
|
* can be used freely for any purpose. Any derived versions of this
|
|
|
|
* software must be clearly marked as such, and if the derived work is
|
|
|
|
* incompatible with the protocol description in the RFC file, it must be
|
|
|
|
* called by a name other than "ssh" or "Secure Shell".
|
2000-05-15 04:37:24 +00:00
|
|
|
*
|
|
|
|
*
|
2002-03-18 09:55:03 +00:00
|
|
|
* Copyright (c) 1999, 2000 Markus Friedl. All rights reserved.
|
2000-09-10 08:31:17 +00:00
|
|
|
* Copyright (c) 1999 Niels Provos. All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
|
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
2000-02-24 14:29:47 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "includes.h"
|
2005-06-05 15:41:57 +00:00
|
|
|
RCSID("$OpenBSD: hostfile.c,v 1.34 2005/03/10 22:01:05 deraadt Exp $");
|
2005-06-05 15:40:50 +00:00
|
|
|
|
|
|
|
#include <resolv.h>
|
|
|
|
#include <openssl/hmac.h>
|
|
|
|
#include <openssl/sha.h>
|
2000-02-24 14:29:47 +00:00
|
|
|
|
|
|
|
#include "packet.h"
|
2000-03-26 07:07:24 +00:00
|
|
|
#include "match.h"
|
|
|
|
#include "key.h"
|
|
|
|
#include "hostfile.h"
|
2001-05-04 03:57:05 +00:00
|
|
|
#include "log.h"
|
2005-06-05 15:40:50 +00:00
|
|
|
#include "xmalloc.h"
|
|
|
|
|
|
|
|
static int
|
|
|
|
extract_salt(const char *s, u_int l, char *salt, size_t salt_len)
|
|
|
|
{
|
|
|
|
char *p, *b64salt;
|
|
|
|
u_int b64len;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
if (l < sizeof(HASH_MAGIC) - 1) {
|
|
|
|
debug2("extract_salt: string too short");
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
if (strncmp(s, HASH_MAGIC, sizeof(HASH_MAGIC) - 1) != 0) {
|
|
|
|
debug2("extract_salt: invalid magic identifier");
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
s += sizeof(HASH_MAGIC) - 1;
|
|
|
|
l -= sizeof(HASH_MAGIC) - 1;
|
|
|
|
if ((p = memchr(s, HASH_DELIM, l)) == NULL) {
|
|
|
|
debug2("extract_salt: missing salt termination character");
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
b64len = p - s;
|
|
|
|
/* Sanity check */
|
|
|
|
if (b64len == 0 || b64len > 1024) {
|
|
|
|
debug2("extract_salt: bad encoded salt length %u", b64len);
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
b64salt = xmalloc(1 + b64len);
|
|
|
|
memcpy(b64salt, s, b64len);
|
|
|
|
b64salt[b64len] = '\0';
|
|
|
|
|
|
|
|
ret = __b64_pton(b64salt, salt, salt_len);
|
|
|
|
xfree(b64salt);
|
|
|
|
if (ret == -1) {
|
|
|
|
debug2("extract_salt: salt decode error");
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
if (ret != SHA_DIGEST_LENGTH) {
|
|
|
|
debug2("extract_salt: expected salt len %u, got %u",
|
|
|
|
salt_len, ret);
|
|
|
|
return (-1);
|
|
|
|
}
|
2005-06-05 15:41:57 +00:00
|
|
|
|
2005-06-05 15:40:50 +00:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
char *
|
|
|
|
host_hash(const char *host, const char *name_from_hostfile, u_int src_len)
|
|
|
|
{
|
|
|
|
const EVP_MD *md = EVP_sha1();
|
|
|
|
HMAC_CTX mac_ctx;
|
|
|
|
char salt[256], result[256], uu_salt[512], uu_result[512];
|
|
|
|
static char encoded[1024];
|
|
|
|
u_int i, len;
|
|
|
|
|
|
|
|
len = EVP_MD_size(md);
|
|
|
|
|
|
|
|
if (name_from_hostfile == NULL) {
|
|
|
|
/* Create new salt */
|
|
|
|
for (i = 0; i < len; i++)
|
|
|
|
salt[i] = arc4random();
|
|
|
|
} else {
|
|
|
|
/* Extract salt from known host entry */
|
|
|
|
if (extract_salt(name_from_hostfile, src_len, salt,
|
|
|
|
sizeof(salt)) == -1)
|
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
HMAC_Init(&mac_ctx, salt, len, md);
|
|
|
|
HMAC_Update(&mac_ctx, host, strlen(host));
|
|
|
|
HMAC_Final(&mac_ctx, result, NULL);
|
|
|
|
HMAC_cleanup(&mac_ctx);
|
|
|
|
|
2005-06-05 15:41:57 +00:00
|
|
|
if (__b64_ntop(salt, len, uu_salt, sizeof(uu_salt)) == -1 ||
|
2005-06-05 15:40:50 +00:00
|
|
|
__b64_ntop(result, len, uu_result, sizeof(uu_result)) == -1)
|
|
|
|
fatal("host_hash: __b64_ntop failed");
|
|
|
|
|
|
|
|
snprintf(encoded, sizeof(encoded), "%s%s%c%s", HASH_MAGIC, uu_salt,
|
|
|
|
HASH_DELIM, uu_result);
|
|
|
|
|
|
|
|
return (encoded);
|
|
|
|
}
|
2000-02-24 14:29:47 +00:00
|
|
|
|
|
|
|
/*
|
2000-03-26 07:07:24 +00:00
|
|
|
* Parses an RSA (number of bits, e, n) or DSA key from a string. Moves the
|
|
|
|
* pointer over the key. Skips any whitespace at the beginning and at end.
|
2000-02-24 14:29:47 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
int
|
2001-05-04 03:57:05 +00:00
|
|
|
hostfile_read_key(char **cpp, u_int *bitsp, Key *ret)
|
2000-02-24 14:29:47 +00:00
|
|
|
{
|
|
|
|
char *cp;
|
|
|
|
|
|
|
|
/* Skip leading whitespace. */
|
|
|
|
for (cp = *cpp; *cp == ' ' || *cp == '\t'; cp++)
|
|
|
|
;
|
|
|
|
|
2001-05-04 03:57:05 +00:00
|
|
|
if (key_read(ret, &cp) != 1)
|
2000-02-24 14:29:47 +00:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* Skip trailing whitespace. */
|
|
|
|
for (; *cp == ' ' || *cp == '\t'; cp++)
|
|
|
|
;
|
|
|
|
|
|
|
|
/* Return results. */
|
|
|
|
*cpp = cp;
|
2001-05-04 03:57:05 +00:00
|
|
|
*bitsp = key_size(ret);
|
2000-02-24 14:29:47 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2002-03-18 09:55:03 +00:00
|
|
|
static int
|
2004-02-26 10:38:49 +00:00
|
|
|
hostfile_check_key(int bits, const Key *key, const char *host, const char *filename, int linenum)
|
2000-03-26 07:07:24 +00:00
|
|
|
{
|
2001-05-04 03:57:05 +00:00
|
|
|
if (key == NULL || key->type != KEY_RSA1 || key->rsa == NULL)
|
2000-03-26 07:07:24 +00:00
|
|
|
return 1;
|
|
|
|
if (bits != BN_num_bits(key->rsa->n)) {
|
2004-01-07 11:10:17 +00:00
|
|
|
logit("Warning: %s, line %d: keysize mismatch for host %s: "
|
2000-03-26 07:07:24 +00:00
|
|
|
"actual %d vs. announced %d.",
|
|
|
|
filename, linenum, host, BN_num_bits(key->rsa->n), bits);
|
2004-01-07 11:10:17 +00:00
|
|
|
logit("Warning: replace %d with %d in %s, line %d.",
|
2000-03-26 07:07:24 +00:00
|
|
|
bits, BN_num_bits(key->rsa->n), filename, linenum);
|
2000-02-24 14:29:47 +00:00
|
|
|
}
|
2000-03-26 07:07:24 +00:00
|
|
|
return 1;
|
2000-02-24 14:29:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Checks whether the given host (which must be in all lowercase) is already
|
|
|
|
* in the list of our known hosts. Returns HOST_OK if the host is known and
|
|
|
|
* has the specified key, HOST_NEW if the host is not known, and HOST_CHANGED
|
|
|
|
* if the host is known but used to have a different host key.
|
2002-10-29 09:43:00 +00:00
|
|
|
*
|
|
|
|
* If no 'key' has been specified and a key of type 'keytype' is known
|
|
|
|
* for the specified host, then HOST_FOUND is returned.
|
2000-02-24 14:29:47 +00:00
|
|
|
*/
|
|
|
|
|
2002-10-29 09:43:00 +00:00
|
|
|
static HostStatus
|
|
|
|
check_host_in_hostfile_by_key_or_type(const char *filename,
|
2004-02-26 10:38:49 +00:00
|
|
|
const char *host, const Key *key, int keytype, Key *found, int *numret)
|
2000-02-24 14:29:47 +00:00
|
|
|
{
|
|
|
|
FILE *f;
|
|
|
|
char line[8192];
|
|
|
|
int linenum = 0;
|
2001-05-04 03:57:05 +00:00
|
|
|
u_int kbits;
|
2005-06-05 15:40:50 +00:00
|
|
|
char *cp, *cp2, *hashed_host;
|
2000-02-24 14:29:47 +00:00
|
|
|
HostStatus end_return;
|
|
|
|
|
2001-05-04 03:57:05 +00:00
|
|
|
debug3("check_host_in_hostfile: filename %s", filename);
|
2002-10-29 09:43:00 +00:00
|
|
|
|
2000-02-24 14:29:47 +00:00
|
|
|
/* Open the file containing the list of known hosts. */
|
|
|
|
f = fopen(filename, "r");
|
|
|
|
if (!f)
|
|
|
|
return HOST_NEW;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return value when the loop terminates. This is set to
|
|
|
|
* HOST_CHANGED if we have seen a different key for the host and have
|
|
|
|
* not found the proper one.
|
|
|
|
*/
|
|
|
|
end_return = HOST_NEW;
|
|
|
|
|
2001-05-04 03:57:05 +00:00
|
|
|
/* Go through the file. */
|
2000-02-24 14:29:47 +00:00
|
|
|
while (fgets(line, sizeof(line), f)) {
|
|
|
|
cp = line;
|
|
|
|
linenum++;
|
|
|
|
|
|
|
|
/* Skip any leading whitespace, comments and empty lines. */
|
|
|
|
for (; *cp == ' ' || *cp == '\t'; cp++)
|
|
|
|
;
|
|
|
|
if (!*cp || *cp == '#' || *cp == '\n')
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/* Find the end of the host name portion. */
|
|
|
|
for (cp2 = cp; *cp2 && *cp2 != ' ' && *cp2 != '\t'; cp2++)
|
|
|
|
;
|
|
|
|
|
|
|
|
/* Check if the host name matches. */
|
2005-06-05 15:40:50 +00:00
|
|
|
if (match_hostname(host, cp, (u_int) (cp2 - cp)) != 1) {
|
|
|
|
if (*cp != HASH_DELIM)
|
|
|
|
continue;
|
|
|
|
hashed_host = host_hash(host, cp, (u_int) (cp2 - cp));
|
|
|
|
if (hashed_host == NULL) {
|
|
|
|
debug("Invalid hashed host line %d of %s",
|
|
|
|
linenum, filename);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (strncmp(hashed_host, cp, (u_int) (cp2 - cp)) != 0)
|
|
|
|
continue;
|
|
|
|
}
|
2000-02-24 14:29:47 +00:00
|
|
|
|
|
|
|
/* Got a match. Skip host name. */
|
|
|
|
cp = cp2;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Extract the key from the line. This will skip any leading
|
|
|
|
* whitespace. Ignore badly formatted lines.
|
|
|
|
*/
|
2000-03-26 07:07:24 +00:00
|
|
|
if (!hostfile_read_key(&cp, &kbits, found))
|
|
|
|
continue;
|
2000-02-24 14:29:47 +00:00
|
|
|
|
2001-05-04 03:57:05 +00:00
|
|
|
if (numret != NULL)
|
|
|
|
*numret = linenum;
|
|
|
|
|
2002-10-29 09:43:00 +00:00
|
|
|
if (key == NULL) {
|
|
|
|
/* we found a key of the requested type */
|
|
|
|
if (found->type == keytype)
|
|
|
|
return HOST_FOUND;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!hostfile_check_key(kbits, found, host, filename, linenum))
|
|
|
|
continue;
|
|
|
|
|
2000-02-24 14:29:47 +00:00
|
|
|
/* Check if the current key is the same as the given key. */
|
2000-03-26 07:07:24 +00:00
|
|
|
if (key_equal(key, found)) {
|
2000-02-24 14:29:47 +00:00
|
|
|
/* Ok, they match. */
|
2001-05-04 03:57:05 +00:00
|
|
|
debug3("check_host_in_hostfile: match line %d", linenum);
|
2000-02-24 14:29:47 +00:00
|
|
|
fclose(f);
|
|
|
|
return HOST_OK;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* They do not match. We will continue to go through the
|
|
|
|
* file; however, we note that we will not return that it is
|
|
|
|
* new.
|
|
|
|
*/
|
|
|
|
end_return = HOST_CHANGED;
|
|
|
|
}
|
|
|
|
/* Clear variables and close the file. */
|
|
|
|
fclose(f);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return either HOST_NEW or HOST_CHANGED, depending on whether we
|
|
|
|
* saw a different key for the host.
|
|
|
|
*/
|
|
|
|
return end_return;
|
|
|
|
}
|
|
|
|
|
2002-10-29 09:43:00 +00:00
|
|
|
HostStatus
|
2004-02-26 10:38:49 +00:00
|
|
|
check_host_in_hostfile(const char *filename, const char *host, const Key *key,
|
2002-10-29 09:43:00 +00:00
|
|
|
Key *found, int *numret)
|
|
|
|
{
|
|
|
|
if (key == NULL)
|
|
|
|
fatal("no key to look up");
|
|
|
|
return (check_host_in_hostfile_by_key_or_type(filename, host, key, 0,
|
|
|
|
found, numret));
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
lookup_key_in_hostfile_by_type(const char *filename, const char *host,
|
|
|
|
int keytype, Key *found, int *numret)
|
|
|
|
{
|
|
|
|
return (check_host_in_hostfile_by_key_or_type(filename, host, NULL,
|
|
|
|
keytype, found, numret) == HOST_FOUND);
|
|
|
|
}
|
|
|
|
|
2000-02-24 14:29:47 +00:00
|
|
|
/*
|
|
|
|
* Appends an entry to the host file. Returns false if the entry could not
|
|
|
|
* be appended.
|
|
|
|
*/
|
|
|
|
|
|
|
|
int
|
2005-06-05 15:41:57 +00:00
|
|
|
add_host_to_hostfile(const char *filename, const char *host, const Key *key,
|
2005-06-05 15:40:50 +00:00
|
|
|
int store_hash)
|
2000-02-24 14:29:47 +00:00
|
|
|
{
|
|
|
|
FILE *f;
|
2000-03-26 07:07:24 +00:00
|
|
|
int success = 0;
|
2005-06-05 15:40:50 +00:00
|
|
|
char *hashed_host;
|
|
|
|
|
2000-03-26 07:07:24 +00:00
|
|
|
if (key == NULL)
|
2000-05-15 04:37:24 +00:00
|
|
|
return 1; /* XXX ? */
|
2000-02-24 14:29:47 +00:00
|
|
|
f = fopen(filename, "a");
|
|
|
|
if (!f)
|
|
|
|
return 0;
|
2005-06-05 15:40:50 +00:00
|
|
|
|
|
|
|
if (store_hash) {
|
|
|
|
if ((hashed_host = host_hash(host, NULL, 0)) == NULL) {
|
|
|
|
error("add_host_to_hostfile: host_hash failed");
|
|
|
|
fclose(f);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
fprintf(f, "%s ", store_hash ? hashed_host : host);
|
|
|
|
|
2000-03-26 07:07:24 +00:00
|
|
|
if (key_write(key, f)) {
|
|
|
|
success = 1;
|
|
|
|
} else {
|
2000-05-15 04:37:24 +00:00
|
|
|
error("add_host_to_hostfile: saving key in %s failed", filename);
|
2000-02-24 14:29:47 +00:00
|
|
|
}
|
2000-05-15 04:37:24 +00:00
|
|
|
fprintf(f, "\n");
|
2000-02-24 14:29:47 +00:00
|
|
|
fclose(f);
|
2000-03-26 07:07:24 +00:00
|
|
|
return success;
|
2000-02-24 14:29:47 +00:00
|
|
|
}
|