Index: head/sys/kgssapi/gss_canonicalize_name.c =================================================================== --- head/sys/kgssapi/gss_canonicalize_name.c (revision 365228) +++ head/sys/kgssapi/gss_canonicalize_name.c (revision 365229) @@ -1,83 +1,83 @@ /*- * SPDX-License-Identifier: BSD-2-Clause-FreeBSD * * Copyright (c) 2008 Isilon Inc http://www.isilon.com/ * Authors: Doug Rabson * Developed with Red Inc: Alfred Perlstein * * 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 AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include __FBSDID("$FreeBSD$"); #include #include #include #include #include #include #include #include #include "gssd.h" OM_uint32 gss_canonicalize_name(OM_uint32 *minor_status, gss_name_t input_name, const gss_OID mech_type, gss_name_t *output_name) { struct canonicalize_name_res res; struct canonicalize_name_args args; enum clnt_stat stat; gss_name_t name; CLIENT *cl; *minor_status = 0; cl = kgss_gssd_client(); if (cl == NULL) return (GSS_S_FAILURE); args.input_name = input_name->handle; args.mech_type = mech_type; - + bzero(&res, sizeof(res)); stat = gssd_canonicalize_name_1(&args, &res, cl); CLNT_RELEASE(cl); if (stat != RPC_SUCCESS) { *minor_status = stat; return (GSS_S_FAILURE); } if (res.major_status != GSS_S_COMPLETE) { *minor_status = res.minor_status; return (res.major_status); } name = malloc(sizeof(struct _gss_name_t), M_GSSAPI, M_WAITOK); name->handle = res.output_name; *output_name = name; return (GSS_S_COMPLETE); } Index: head/sys/kgssapi/gss_delete_sec_context.c =================================================================== --- head/sys/kgssapi/gss_delete_sec_context.c (revision 365228) +++ head/sys/kgssapi/gss_delete_sec_context.c (revision 365229) @@ -1,100 +1,100 @@ /*- * SPDX-License-Identifier: BSD-2-Clause-FreeBSD * * Copyright (c) 2008 Isilon Inc http://www.isilon.com/ * Authors: Doug Rabson * Developed with Red Inc: Alfred Perlstein * * 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 AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include __FBSDID("$FreeBSD$"); #include #include #include #include #include #include #include #include #include "gssd.h" OM_uint32 gss_delete_sec_context(OM_uint32 *minor_status, gss_ctx_id_t *context_handle, gss_buffer_t output_token) { struct delete_sec_context_res res; struct delete_sec_context_args args; enum clnt_stat stat; gss_ctx_id_t ctx; CLIENT *cl; *minor_status = 0; if (!kgss_gssd_handle) return (GSS_S_FAILURE); if (*context_handle) { ctx = *context_handle; /* * If we are past the context establishment phase, let * the in-kernel code do the delete, otherwise * userland needs to deal with it. */ if (ctx->handle) { args.ctx = ctx->handle; cl = kgss_gssd_client(); if (cl == NULL) return (GSS_S_FAILURE); - + bzero(&res, sizeof(res)); stat = gssd_delete_sec_context_1(&args, &res, cl); CLNT_RELEASE(cl); if (stat != RPC_SUCCESS) { *minor_status = stat; return (GSS_S_FAILURE); } if (output_token) kgss_copy_buffer(&res.output_token, output_token); xdr_free((xdrproc_t) xdr_delete_sec_context_res, &res); kgss_delete_context(ctx, NULL); } else { kgss_delete_context(ctx, output_token); } *context_handle = NULL; } else { if (output_token) { output_token->length = 0; output_token->value = NULL; } } return (GSS_S_COMPLETE); } Index: head/sys/kgssapi/gss_display_status.c =================================================================== --- head/sys/kgssapi/gss_display_status.c (revision 365228) +++ head/sys/kgssapi/gss_display_status.c (revision 365229) @@ -1,86 +1,86 @@ /*- * SPDX-License-Identifier: BSD-2-Clause-FreeBSD * * Copyright (c) 2008 Isilon Inc http://www.isilon.com/ * Authors: Doug Rabson * Developed with Red Inc: Alfred Perlstein * * 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 AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include __FBSDID("$FreeBSD$"); #include #include #include #include #include #include #include #include #include "gssd.h" OM_uint32 gss_display_status(OM_uint32 *minor_status, OM_uint32 status_value, int status_type, const gss_OID mech_type, OM_uint32 *message_context, gss_buffer_t status_string) /* status_string */ { struct display_status_res res; struct display_status_args args; enum clnt_stat stat; CLIENT *cl; *minor_status = 0; cl = kgss_gssd_client(); if (cl == NULL) return (GSS_S_FAILURE); args.status_value = status_value; args.status_type = status_type; args.mech_type = mech_type; args.message_context = *message_context; - + bzero(&res, sizeof(res)); stat = gssd_display_status_1(&args, &res, cl); CLNT_RELEASE(cl); if (stat != RPC_SUCCESS) { *minor_status = stat; return (GSS_S_FAILURE); } if (res.major_status != GSS_S_COMPLETE) { *minor_status = res.minor_status; return (res.major_status); } *message_context = res.message_context; kgss_copy_buffer(&res.status_string, status_string); xdr_free((xdrproc_t) xdr_display_status_res, &res); return (GSS_S_COMPLETE); } Index: head/sys/kgssapi/gss_get_mic.c =================================================================== --- head/sys/kgssapi/gss_get_mic.c (revision 365228) +++ head/sys/kgssapi/gss_get_mic.c (revision 365229) @@ -1,91 +1,90 @@ /*- * SPDX-License-Identifier: BSD-2-Clause-FreeBSD * * Copyright (c) 2008 Isilon Inc http://www.isilon.com/ * Authors: Doug Rabson * Developed with Red Inc: Alfred Perlstein * * 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 AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include __FBSDID("$FreeBSD$"); #include #include #include #include #include #include #include #include "kgss_if.h" OM_uint32 gss_get_mic(OM_uint32 *minor_status, const gss_ctx_id_t ctx, gss_qop_t qop_req, const gss_buffer_t message_buffer, gss_buffer_t message_token) { OM_uint32 maj_stat; struct mbuf *m, *mic; if (!ctx) { *minor_status = 0; return (GSS_S_NO_CONTEXT); } MGET(m, M_WAITOK, MT_DATA); if (message_buffer->length > MLEN) MCLGET(m, M_WAITOK); m_append(m, message_buffer->length, message_buffer->value); maj_stat = KGSS_GET_MIC(ctx, minor_status, qop_req, m, &mic); m_freem(m); if (maj_stat == GSS_S_COMPLETE) { message_token->length = m_length(mic, NULL); message_token->value = malloc(message_token->length, M_GSSAPI, M_WAITOK); m_copydata(mic, 0, message_token->length, message_token->value); m_freem(mic); } return (maj_stat); } OM_uint32 gss_get_mic_mbuf(OM_uint32 *minor_status, const gss_ctx_id_t ctx, gss_qop_t qop_req, struct mbuf *m, struct mbuf **micp) { if (!ctx) { *minor_status = 0; return (GSS_S_NO_CONTEXT); } return (KGSS_GET_MIC(ctx, minor_status, qop_req, m, micp)); } - Index: head/sys/kgssapi/gss_import_name.c =================================================================== --- head/sys/kgssapi/gss_import_name.c (revision 365228) +++ head/sys/kgssapi/gss_import_name.c (revision 365229) @@ -1,86 +1,86 @@ /*- * SPDX-License-Identifier: BSD-2-Clause-FreeBSD * * Copyright (c) 2008 Isilon Inc http://www.isilon.com/ * Authors: Doug Rabson * Developed with Red Inc: Alfred Perlstein * * 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 AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include __FBSDID("$FreeBSD$"); #include #include #include #include #include #include #include #include #include "gssd.h" OM_uint32 gss_import_name(OM_uint32 *minor_status, const gss_buffer_t input_name_buffer, const gss_OID input_name_type, gss_name_t *output_name) { struct import_name_res res; struct import_name_args args; enum clnt_stat stat; gss_name_t name; CLIENT *cl; *minor_status = 0; *output_name = GSS_C_NO_NAME; cl = kgss_gssd_client(); if (cl == NULL) return (GSS_S_FAILURE); args.input_name_buffer = *input_name_buffer; args.input_name_type = input_name_type; - + bzero(&res, sizeof(res)); stat = gssd_import_name_1(&args, &res, cl); CLNT_RELEASE(cl); if (stat != RPC_SUCCESS) { *minor_status = stat; return (GSS_S_FAILURE); } if (res.major_status != GSS_S_COMPLETE) { *minor_status = res.minor_status; return (res.major_status); } name = malloc(sizeof(struct _gss_name_t), M_GSSAPI, M_WAITOK); name->handle = res.output_name; *minor_status = 0; *output_name = name; return (GSS_S_COMPLETE); } Index: head/sys/kgssapi/gss_names.c =================================================================== --- head/sys/kgssapi/gss_names.c (revision 365228) +++ head/sys/kgssapi/gss_names.c (revision 365229) @@ -1,178 +1,176 @@ /*- * SPDX-License-Identifier: BSD-2-Clause-FreeBSD * * Copyright (c) 2005 Doug Rabson * 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 AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include __FBSDID("$FreeBSD$"); #include #include /* * The implementation must reserve static storage for a * gss_OID_desc object containing the value * {10, (void *)"\x2a\x86\x48\x86\xf7\x12" * "\x01\x02\x01\x01"}, * corresponding to an object-identifier value of * {iso(1) member-body(2) United States(840) mit(113554) * infosys(1) gssapi(2) generic(1) user_name(1)}. The constant * GSS_C_NT_USER_NAME should be initialized to point * to that gss_OID_desc. */ static gss_OID_desc GSS_C_NT_USER_NAME_storage = {10, (void *)(uintptr_t)"\x2a\x86\x48\x86\xf7\x12\x01\x02\x01\x01"}; gss_OID GSS_C_NT_USER_NAME = &GSS_C_NT_USER_NAME_storage; /* * The implementation must reserve static storage for a * gss_OID_desc object containing the value * {10, (void *)"\x2a\x86\x48\x86\xf7\x12" * "\x01\x02\x01\x02"}, * corresponding to an object-identifier value of * {iso(1) member-body(2) United States(840) mit(113554) * infosys(1) gssapi(2) generic(1) machine_uid_name(2)}. * The constant GSS_C_NT_MACHINE_UID_NAME should be * initialized to point to that gss_OID_desc. */ static gss_OID_desc GSS_C_NT_MACHINE_UID_NAME_storage = {10, (void *)(uintptr_t)"\x2a\x86\x48\x86\xf7\x12\x01\x02\x01\x02"}; gss_OID GSS_C_NT_MACHINE_UID_NAME = &GSS_C_NT_MACHINE_UID_NAME_storage; /* * The implementation must reserve static storage for a * gss_OID_desc object containing the value * {10, (void *)"\x2a\x86\x48\x86\xf7\x12" * "\x01\x02\x01\x03"}, * corresponding to an object-identifier value of * {iso(1) member-body(2) United States(840) mit(113554) * infosys(1) gssapi(2) generic(1) string_uid_name(3)}. * The constant GSS_C_NT_STRING_UID_NAME should be * initialized to point to that gss_OID_desc. */ static gss_OID_desc GSS_C_NT_STRING_UID_NAME_storage = {10, (void *)(uintptr_t)"\x2a\x86\x48\x86\xf7\x12\x01\x02\x01\x03"}; gss_OID GSS_C_NT_STRING_UID_NAME = &GSS_C_NT_STRING_UID_NAME_storage; /* * The implementation must reserve static storage for a * gss_OID_desc object containing the value * {6, (void *)"\x2b\x06\x01\x05\x06\x02"}, * corresponding to an object-identifier value of * {iso(1) org(3) dod(6) internet(1) security(5) * nametypes(6) gss-host-based-services(2)). The constant * GSS_C_NT_HOSTBASED_SERVICE_X should be initialized to point * to that gss_OID_desc. This is a deprecated OID value, and * implementations wishing to support hostbased-service names * should instead use the GSS_C_NT_HOSTBASED_SERVICE OID, * defined below, to identify such names; * GSS_C_NT_HOSTBASED_SERVICE_X should be accepted a synonym * for GSS_C_NT_HOSTBASED_SERVICE when presented as an input * parameter, but should not be emitted by GSS-API * implementations */ static gss_OID_desc GSS_C_NT_HOSTBASED_SERVICE_X_storage = {6, (void *)(uintptr_t)"\x2b\x06\x01\x05\x06\x02"}; gss_OID GSS_C_NT_HOSTBASED_SERVICE_X = &GSS_C_NT_HOSTBASED_SERVICE_X_storage; /* * The implementation must reserve static storage for a * gss_OID_desc object containing the value * {10, (void *)"\x2a\x86\x48\x86\xf7\x12" * "\x01\x02\x01\x04"}, corresponding to an * object-identifier value of {iso(1) member-body(2) * Unites States(840) mit(113554) infosys(1) gssapi(2) * generic(1) service_name(4)}. The constant * GSS_C_NT_HOSTBASED_SERVICE should be initialized * to point to that gss_OID_desc. */ static gss_OID_desc GSS_C_NT_HOSTBASED_SERVICE_storage = {10, (void *)(uintptr_t)"\x2a\x86\x48\x86\xf7\x12\x01\x02\x01\x04"}; gss_OID GSS_C_NT_HOSTBASED_SERVICE = &GSS_C_NT_HOSTBASED_SERVICE_storage; /* * The implementation must reserve static storage for a * gss_OID_desc object containing the value * {6, (void *)"\x2b\x06\01\x05\x06\x03"}, * corresponding to an object identifier value of * {1(iso), 3(org), 6(dod), 1(internet), 5(security), * 6(nametypes), 3(gss-anonymous-name)}. The constant * and GSS_C_NT_ANONYMOUS should be initialized to point * to that gss_OID_desc. */ static gss_OID_desc GSS_C_NT_ANONYMOUS_storage = {6, (void *)(uintptr_t)"\x2b\x06\01\x05\x06\x03"}; gss_OID GSS_C_NT_ANONYMOUS = &GSS_C_NT_ANONYMOUS_storage; /* * The implementation must reserve static storage for a * gss_OID_desc object containing the value * {6, (void *)"\x2b\x06\x01\x05\x06\x04"}, * corresponding to an object-identifier value of * {1(iso), 3(org), 6(dod), 1(internet), 5(security), * 6(nametypes), 4(gss-api-exported-name)}. The constant * GSS_C_NT_EXPORT_NAME should be initialized to point * to that gss_OID_desc. */ static gss_OID_desc GSS_C_NT_EXPORT_NAME_storage = {6, (void *)(uintptr_t)"\x2b\x06\x01\x05\x06\x04"}; gss_OID GSS_C_NT_EXPORT_NAME = &GSS_C_NT_EXPORT_NAME_storage; /* * This name form shall be represented by the Object Identifier {iso(1) * member-body(2) United States(840) mit(113554) infosys(1) gssapi(2) * krb5(2) krb5_name(1)}. The recommended symbolic name for this type * is "GSS_KRB5_NT_PRINCIPAL_NAME". */ static gss_OID_desc GSS_KRB5_NT_PRINCIPAL_NAME_storage = {10, (void *)(uintptr_t)"\x2a\x86\x48\x86\xf7\x12\x01\x02\x02\x01"}; gss_OID GSS_KRB5_NT_PRINCIPAL_NAME = &GSS_KRB5_NT_PRINCIPAL_NAME_storage; /* * This name form shall be represented by the Object Identifier {iso(1) * member-body(2) United States(840) mit(113554) infosys(1) gssapi(2) * generic(1) user_name(1)}. The recommended symbolic name for this * type is "GSS_KRB5_NT_USER_NAME". */ gss_OID GSS_KRB5_NT_USER_NAME = &GSS_C_NT_USER_NAME_storage; /* * This name form shall be represented by the Object Identifier {iso(1) * member-body(2) United States(840) mit(113554) infosys(1) gssapi(2) * generic(1) machine_uid_name(2)}. The recommended symbolic name for * this type is "GSS_KRB5_NT_MACHINE_UID_NAME". */ gss_OID GSS_KRB5_NT_MACHINE_UID_NAME = &GSS_C_NT_MACHINE_UID_NAME_storage; /* * This name form shall be represented by the Object Identifier {iso(1) * member-body(2) United States(840) mit(113554) infosys(1) gssapi(2) * generic(1) string_uid_name(3)}. The recommended symbolic name for * this type is "GSS_KRB5_NT_STRING_UID_NAME". */ gss_OID GSS_KRB5_NT_STRING_UID_NAME = &GSS_C_NT_STRING_UID_NAME_storage; - - Index: head/sys/kgssapi/gss_release_buffer.c =================================================================== --- head/sys/kgssapi/gss_release_buffer.c (revision 365228) +++ head/sys/kgssapi/gss_release_buffer.c (revision 365229) @@ -1,54 +1,53 @@ /*- * SPDX-License-Identifier: BSD-2-Clause-FreeBSD * * Copyright (c) 2008 Isilon Inc http://www.isilon.com/ * Authors: Doug Rabson * Developed with Red Inc: Alfred Perlstein * * 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 AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include __FBSDID("$FreeBSD$"); #include #include #include #include #include #include OM_uint32 gss_release_buffer(OM_uint32 *minor_status, gss_buffer_t buffer) { *minor_status = 0; if (buffer->value) { free(buffer->value, M_GSSAPI); } buffer->length = 0; buffer->value = NULL; return (GSS_S_COMPLETE); } - Index: head/sys/kgssapi/gss_release_name.c =================================================================== --- head/sys/kgssapi/gss_release_name.c (revision 365228) +++ head/sys/kgssapi/gss_release_name.c (revision 365229) @@ -1,83 +1,83 @@ /*- * SPDX-License-Identifier: BSD-2-Clause-FreeBSD * * Copyright (c) 2008 Isilon Inc http://www.isilon.com/ * Authors: Doug Rabson * Developed with Red Inc: Alfred Perlstein * * 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 AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include __FBSDID("$FreeBSD$"); #include #include #include #include #include #include #include #include #include "gssd.h" OM_uint32 gss_release_name(OM_uint32 *minor_status, gss_name_t *input_name) { struct release_name_res res; struct release_name_args args; enum clnt_stat stat; gss_name_t name; CLIENT *cl; *minor_status = 0; if (!kgss_gssd_handle) return (GSS_S_FAILURE); if (*input_name) { name = *input_name; args.input_name = name->handle; - + cl = kgss_gssd_client(); if (cl == NULL) return (GSS_S_FAILURE); stat = gssd_release_name_1(&args, &res, cl); CLNT_RELEASE(cl); if (stat != RPC_SUCCESS) { *minor_status = stat; return (GSS_S_FAILURE); } free(name, M_GSSAPI); *input_name = NULL; if (res.major_status != GSS_S_COMPLETE) { *minor_status = res.minor_status; return (res.major_status); } } return (GSS_S_COMPLETE); } Index: head/sys/kgssapi/gss_unwrap.c =================================================================== --- head/sys/kgssapi/gss_unwrap.c (revision 365228) +++ head/sys/kgssapi/gss_unwrap.c (revision 365229) @@ -1,99 +1,98 @@ /*- * SPDX-License-Identifier: BSD-2-Clause-FreeBSD * * Copyright (c) 2008 Isilon Inc http://www.isilon.com/ * Authors: Doug Rabson * Developed with Red Inc: Alfred Perlstein * * 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 AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include __FBSDID("$FreeBSD$"); #include #include #include #include #include #include #include #include "kgss_if.h" OM_uint32 gss_unwrap(OM_uint32 *minor_status, const gss_ctx_id_t ctx, const gss_buffer_t input_message_buffer, gss_buffer_t output_message_buffer, int *conf_state, gss_qop_t *qop_state) { OM_uint32 maj_stat; struct mbuf *m; if (!ctx) { *minor_status = 0; return (GSS_S_NO_CONTEXT); } MGET(m, M_WAITOK, MT_DATA); if (input_message_buffer->length > MLEN) MCLGET(m, M_WAITOK); m_append(m, input_message_buffer->length, input_message_buffer->value); maj_stat = KGSS_UNWRAP(ctx, minor_status, &m, conf_state, qop_state); /* * On success, m is the wrapped message, on failure, m is * freed. */ if (maj_stat == GSS_S_COMPLETE) { output_message_buffer->length = m_length(m, NULL); output_message_buffer->value = malloc(output_message_buffer->length, M_GSSAPI, M_WAITOK); m_copydata(m, 0, output_message_buffer->length, output_message_buffer->value); m_freem(m); } return (maj_stat); } OM_uint32 gss_unwrap_mbuf(OM_uint32 *minor_status, const gss_ctx_id_t ctx, struct mbuf **mp, int *conf_state, gss_qop_t *qop_state) { if (!ctx) { *minor_status = 0; return (GSS_S_NO_CONTEXT); } return (KGSS_UNWRAP(ctx, minor_status, mp, conf_state, qop_state)); } - Index: head/sys/kgssapi/gss_verify_mic.c =================================================================== --- head/sys/kgssapi/gss_verify_mic.c (revision 365228) +++ head/sys/kgssapi/gss_verify_mic.c (revision 365229) @@ -1,89 +1,88 @@ /*- * SPDX-License-Identifier: BSD-2-Clause-FreeBSD * * Copyright (c) 2008 Isilon Inc http://www.isilon.com/ * Authors: Doug Rabson * Developed with Red Inc: Alfred Perlstein * * 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 AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include __FBSDID("$FreeBSD$"); #include #include #include #include #include #include #include #include "kgss_if.h" OM_uint32 gss_verify_mic(OM_uint32 *minor_status, const gss_ctx_id_t ctx, const gss_buffer_t message_buffer, const gss_buffer_t token_buffer, gss_qop_t *qop_state) { OM_uint32 maj_stat; struct mbuf *m, *mic; if (!ctx) { *minor_status = 0; return (GSS_S_NO_CONTEXT); } MGET(m, M_WAITOK, MT_DATA); if (message_buffer->length > MLEN) MCLGET(m, M_WAITOK); m_append(m, message_buffer->length, message_buffer->value); MGET(mic, M_WAITOK, MT_DATA); if (token_buffer->length > MLEN) MCLGET(mic, M_WAITOK); m_append(mic, token_buffer->length, token_buffer->value); maj_stat = KGSS_VERIFY_MIC(ctx, minor_status, m, mic, qop_state); m_freem(m); m_freem(mic); return (maj_stat); } OM_uint32 gss_verify_mic_mbuf(OM_uint32 *minor_status, const gss_ctx_id_t ctx, struct mbuf *m, struct mbuf *mic, gss_qop_t *qop_state) { if (!ctx) { *minor_status = 0; return (GSS_S_NO_CONTEXT); } return (KGSS_VERIFY_MIC(ctx, minor_status, m, mic, qop_state)); } - Index: head/sys/kgssapi/gssapi.h =================================================================== --- head/sys/kgssapi/gssapi.h (revision 365228) +++ head/sys/kgssapi/gssapi.h (revision 365229) @@ -1,620 +1,619 @@ /* * Copyright (C) The Internet Society (2000). All Rights Reserved. * * This document and translations of it may be copied and furnished to * others, and derivative works that comment on or otherwise explain it * or assist in its implementation may be prepared, copied, published * and distributed, in whole or in part, without restriction of any * kind, provided that the above copyright notice and this paragraph are * included on all such copies and derivative works. However, this * document itself may not be modified in any way, such as by removing * the copyright notice or references to the Internet Society or other * Internet organizations, except as needed for the purpose of * developing Internet standards in which case the procedures for * copyrights defined in the Internet Standards process must be * followed, or as required to translate it into languages other than * English. * * The limited permissions granted above are perpetual and will not be * revoked by the Internet Society or its successors or assigns. * * This document and the information contained herein is provided on an * "AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING * TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING * BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION * HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. * * $FreeBSD$ */ #ifndef _KGSSAPI_GSSAPI_H_ #define _KGSSAPI_GSSAPI_H_ /* * A cut-down version of the GSS-API for in-kernel use */ /* * Now define the three implementation-dependent types. */ typedef struct _gss_ctx_id_t *gss_ctx_id_t; typedef struct _gss_cred_id_t *gss_cred_id_t; typedef struct _gss_name_t *gss_name_t; /* * We can't use X/Open definitions, so roll our own. */ typedef uint32_t OM_uint32; typedef uint64_t OM_uint64; typedef struct gss_OID_desc_struct { OM_uint32 length; void *elements; } gss_OID_desc, *gss_OID; typedef struct gss_OID_set_desc_struct { size_t count; gss_OID elements; } gss_OID_set_desc, *gss_OID_set; typedef struct gss_buffer_desc_struct { size_t length; void *value; } gss_buffer_desc, *gss_buffer_t; typedef struct gss_channel_bindings_struct { OM_uint32 initiator_addrtype; gss_buffer_desc initiator_address; OM_uint32 acceptor_addrtype; gss_buffer_desc acceptor_address; gss_buffer_desc application_data; } *gss_channel_bindings_t; /* * For now, define a QOP-type as an OM_uint32 */ typedef OM_uint32 gss_qop_t; typedef int gss_cred_usage_t; /* * Flag bits for context-level services. */ #define GSS_C_DELEG_FLAG 1 #define GSS_C_MUTUAL_FLAG 2 #define GSS_C_REPLAY_FLAG 4 #define GSS_C_SEQUENCE_FLAG 8 #define GSS_C_CONF_FLAG 16 #define GSS_C_INTEG_FLAG 32 #define GSS_C_ANON_FLAG 64 #define GSS_C_PROT_READY_FLAG 128 #define GSS_C_TRANS_FLAG 256 /* * Credential usage options */ #define GSS_C_BOTH 0 #define GSS_C_INITIATE 1 #define GSS_C_ACCEPT 2 /* * Status code types for gss_display_status */ #define GSS_C_GSS_CODE 1 #define GSS_C_MECH_CODE 2 /* * The constant definitions for channel-bindings address families */ #define GSS_C_AF_UNSPEC 0 #define GSS_C_AF_LOCAL 1 #define GSS_C_AF_INET 2 #define GSS_C_AF_IMPLINK 3 #define GSS_C_AF_PUP 4 #define GSS_C_AF_CHAOS 5 #define GSS_C_AF_NS 6 #define GSS_C_AF_NBS 7 #define GSS_C_AF_ECMA 8 #define GSS_C_AF_DATAKIT 9 #define GSS_C_AF_CCITT 10 #define GSS_C_AF_SNA 11 #define GSS_C_AF_DECnet 12 #define GSS_C_AF_DLI 13 #define GSS_C_AF_LAT 14 #define GSS_C_AF_HYLINK 15 #define GSS_C_AF_APPLETALK 16 #define GSS_C_AF_BSC 17 #define GSS_C_AF_DSS 18 #define GSS_C_AF_OSI 19 #define GSS_C_AF_X25 21 #define GSS_C_AF_NULLADDR 255 /* * Various Null values */ #define GSS_C_NO_NAME ((gss_name_t) 0) #define GSS_C_NO_BUFFER ((gss_buffer_t) 0) #define GSS_C_NO_OID ((gss_OID) 0) #define GSS_C_NO_OID_SET ((gss_OID_set) 0) #define GSS_C_NO_CONTEXT ((gss_ctx_id_t) 0) #define GSS_C_NO_CREDENTIAL ((gss_cred_id_t) 0) #define GSS_C_NO_CHANNEL_BINDINGS ((gss_channel_bindings_t) 0) #define GSS_C_EMPTY_BUFFER {0, NULL} /* * Some alternate names for a couple of the above * values. These are defined for V1 compatibility. */ #define GSS_C_NULL_OID GSS_C_NO_OID #define GSS_C_NULL_OID_SET GSS_C_NO_OID_SET /* * Define the default Quality of Protection for per-message * services. Note that an implementation that offers multiple * levels of QOP may define GSS_C_QOP_DEFAULT to be either zero * (as done here) to mean "default protection", or to a specific * explicit QOP value. However, a value of 0 should always be * interpreted by a GSS-API implementation as a request for the * default protection level. */ #define GSS_C_QOP_DEFAULT 0 /* * Expiration time of 2^32-1 seconds means infinite lifetime for a * credential or security context */ #define GSS_C_INDEFINITE 0xfffffffful /* * The implementation must reserve static storage for a * gss_OID_desc object containing the value * {10, (void *)"\x2a\x86\x48\x86\xf7\x12" * "\x01\x02\x01\x01"}, * corresponding to an object-identifier value of * {iso(1) member-body(2) United States(840) mit(113554) * infosys(1) gssapi(2) generic(1) user_name(1)}. The constant * GSS_C_NT_USER_NAME should be initialized to point * to that gss_OID_desc. */ extern gss_OID GSS_C_NT_USER_NAME; /* * The implementation must reserve static storage for a * gss_OID_desc object containing the value * {10, (void *)"\x2a\x86\x48\x86\xf7\x12" * "\x01\x02\x01\x02"}, * corresponding to an object-identifier value of * {iso(1) member-body(2) United States(840) mit(113554) * infosys(1) gssapi(2) generic(1) machine_uid_name(2)}. * The constant GSS_C_NT_MACHINE_UID_NAME should be * initialized to point to that gss_OID_desc. */ extern gss_OID GSS_C_NT_MACHINE_UID_NAME; /* * The implementation must reserve static storage for a * gss_OID_desc object containing the value * {10, (void *)"\x2a\x86\x48\x86\xf7\x12" * "\x01\x02\x01\x03"}, * corresponding to an object-identifier value of * {iso(1) member-body(2) United States(840) mit(113554) * infosys(1) gssapi(2) generic(1) string_uid_name(3)}. * The constant GSS_C_NT_STRING_UID_NAME should be * initialized to point to that gss_OID_desc. */ extern gss_OID GSS_C_NT_STRING_UID_NAME; /* * The implementation must reserve static storage for a * gss_OID_desc object containing the value * {6, (void *)"\x2b\x06\x01\x05\x06\x02"}, * corresponding to an object-identifier value of * {iso(1) org(3) dod(6) internet(1) security(5) * nametypes(6) gss-host-based-services(2)). The constant * GSS_C_NT_HOSTBASED_SERVICE_X should be initialized to point * to that gss_OID_desc. This is a deprecated OID value, and * implementations wishing to support hostbased-service names * should instead use the GSS_C_NT_HOSTBASED_SERVICE OID, * defined below, to identify such names; * GSS_C_NT_HOSTBASED_SERVICE_X should be accepted a synonym * for GSS_C_NT_HOSTBASED_SERVICE when presented as an input * parameter, but should not be emitted by GSS-API * implementations */ extern gss_OID GSS_C_NT_HOSTBASED_SERVICE_X; /* * The implementation must reserve static storage for a * gss_OID_desc object containing the value * {10, (void *)"\x2a\x86\x48\x86\xf7\x12" * "\x01\x02\x01\x04"}, corresponding to an * object-identifier value of {iso(1) member-body(2) * Unites States(840) mit(113554) infosys(1) gssapi(2) * generic(1) service_name(4)}. The constant * GSS_C_NT_HOSTBASED_SERVICE should be initialized * to point to that gss_OID_desc. */ extern gss_OID GSS_C_NT_HOSTBASED_SERVICE; /* * The implementation must reserve static storage for a * gss_OID_desc object containing the value * {6, (void *)"\x2b\x06\01\x05\x06\x03"}, * corresponding to an object identifier value of * {1(iso), 3(org), 6(dod), 1(internet), 5(security), * 6(nametypes), 3(gss-anonymous-name)}. The constant * and GSS_C_NT_ANONYMOUS should be initialized to point * to that gss_OID_desc. */ extern gss_OID GSS_C_NT_ANONYMOUS; - /* * The implementation must reserve static storage for a * gss_OID_desc object containing the value * {6, (void *)"\x2b\x06\x01\x05\x06\x04"}, * corresponding to an object-identifier value of * {1(iso), 3(org), 6(dod), 1(internet), 5(security), * 6(nametypes), 4(gss-api-exported-name)}. The constant * GSS_C_NT_EXPORT_NAME should be initialized to point * to that gss_OID_desc. */ extern gss_OID GSS_C_NT_EXPORT_NAME; /* * This name form shall be represented by the Object Identifier {iso(1) * member-body(2) United States(840) mit(113554) infosys(1) gssapi(2) * krb5(2) krb5_name(1)}. The recommended symbolic name for this type * is "GSS_KRB5_NT_PRINCIPAL_NAME". */ extern gss_OID GSS_KRB5_NT_PRINCIPAL_NAME; /* * This name form shall be represented by the Object Identifier {iso(1) * member-body(2) United States(840) mit(113554) infosys(1) gssapi(2) * generic(1) user_name(1)}. The recommended symbolic name for this * type is "GSS_KRB5_NT_USER_NAME". */ extern gss_OID GSS_KRB5_NT_USER_NAME; /* * This name form shall be represented by the Object Identifier {iso(1) * member-body(2) United States(840) mit(113554) infosys(1) gssapi(2) * generic(1) machine_uid_name(2)}. The recommended symbolic name for * this type is "GSS_KRB5_NT_MACHINE_UID_NAME". */ extern gss_OID GSS_KRB5_NT_MACHINE_UID_NAME; /* * This name form shall be represented by the Object Identifier {iso(1) * member-body(2) United States(840) mit(113554) infosys(1) gssapi(2) * generic(1) string_uid_name(3)}. The recommended symbolic name for * this type is "GSS_KRB5_NT_STRING_UID_NAME". */ extern gss_OID GSS_KRB5_NT_STRING_UID_NAME; /* Major status codes */ #define GSS_S_COMPLETE 0 /* * Some "helper" definitions to make the status code macros obvious. */ #define GSS_C_CALLING_ERROR_OFFSET 24 #define GSS_C_ROUTINE_ERROR_OFFSET 16 #define GSS_C_SUPPLEMENTARY_OFFSET 0 #define GSS_C_CALLING_ERROR_MASK 0377ul #define GSS_C_ROUTINE_ERROR_MASK 0377ul #define GSS_C_SUPPLEMENTARY_MASK 0177777ul /* * The macros that test status codes for error conditions. * Note that the GSS_ERROR() macro has changed slightly from * the V1 GSS-API so that it now evaluates its argument * only once. */ #define GSS_CALLING_ERROR(x) \ (x & (GSS_C_CALLING_ERROR_MASK << GSS_C_CALLING_ERROR_OFFSET)) #define GSS_ROUTINE_ERROR(x) \ (x & (GSS_C_ROUTINE_ERROR_MASK << GSS_C_ROUTINE_ERROR_OFFSET)) #define GSS_SUPPLEMENTARY_INFO(x) \ (x & (GSS_C_SUPPLEMENTARY_MASK << GSS_C_SUPPLEMENTARY_OFFSET)) #define GSS_ERROR(x) \ (x & ((GSS_C_CALLING_ERROR_MASK << GSS_C_CALLING_ERROR_OFFSET) | \ (GSS_C_ROUTINE_ERROR_MASK << GSS_C_ROUTINE_ERROR_OFFSET))) /* * Now the actual status code definitions */ /* * Calling errors: */ #define GSS_S_CALL_INACCESSIBLE_READ \ (1ul << GSS_C_CALLING_ERROR_OFFSET) #define GSS_S_CALL_INACCESSIBLE_WRITE \ (2ul << GSS_C_CALLING_ERROR_OFFSET) #define GSS_S_CALL_BAD_STRUCTURE \ (3ul << GSS_C_CALLING_ERROR_OFFSET) /* * Routine errors: */ #define GSS_S_BAD_MECH (1ul << GSS_C_ROUTINE_ERROR_OFFSET) #define GSS_S_BAD_NAME (2ul << GSS_C_ROUTINE_ERROR_OFFSET) #define GSS_S_BAD_NAMETYPE (3ul << GSS_C_ROUTINE_ERROR_OFFSET) #define GSS_S_BAD_BINDINGS (4ul << GSS_C_ROUTINE_ERROR_OFFSET) #define GSS_S_BAD_STATUS (5ul << GSS_C_ROUTINE_ERROR_OFFSET) #define GSS_S_BAD_SIG (6ul << GSS_C_ROUTINE_ERROR_OFFSET) #define GSS_S_BAD_MIC GSS_S_BAD_SIG #define GSS_S_NO_CRED (7ul << GSS_C_ROUTINE_ERROR_OFFSET) #define GSS_S_NO_CONTEXT (8ul << GSS_C_ROUTINE_ERROR_OFFSET) #define GSS_S_DEFECTIVE_TOKEN (9ul << GSS_C_ROUTINE_ERROR_OFFSET) #define GSS_S_DEFECTIVE_CREDENTIAL (10ul << GSS_C_ROUTINE_ERROR_OFFSET) #define GSS_S_CREDENTIALS_EXPIRED (11ul << GSS_C_ROUTINE_ERROR_OFFSET) #define GSS_S_CONTEXT_EXPIRED (12ul << GSS_C_ROUTINE_ERROR_OFFSET) #define GSS_S_FAILURE (13ul << GSS_C_ROUTINE_ERROR_OFFSET) #define GSS_S_BAD_QOP (14ul << GSS_C_ROUTINE_ERROR_OFFSET) #define GSS_S_UNAUTHORIZED (15ul << GSS_C_ROUTINE_ERROR_OFFSET) #define GSS_S_UNAVAILABLE (16ul << GSS_C_ROUTINE_ERROR_OFFSET) #define GSS_S_DUPLICATE_ELEMENT (17ul << GSS_C_ROUTINE_ERROR_OFFSET) #define GSS_S_NAME_NOT_MN (18ul << GSS_C_ROUTINE_ERROR_OFFSET) /* * Supplementary info bits: */ #define GSS_S_CONTINUE_NEEDED \ (1ul << (GSS_C_SUPPLEMENTARY_OFFSET + 0)) #define GSS_S_DUPLICATE_TOKEN \ (1ul << (GSS_C_SUPPLEMENTARY_OFFSET + 1)) #define GSS_S_OLD_TOKEN \ (1ul << (GSS_C_SUPPLEMENTARY_OFFSET + 2)) #define GSS_S_UNSEQ_TOKEN \ (1ul << (GSS_C_SUPPLEMENTARY_OFFSET + 3)) #define GSS_S_GAP_TOKEN \ (1ul << (GSS_C_SUPPLEMENTARY_OFFSET + 4)) __BEGIN_DECLS /* * Finally, function prototypes for the GSS-API routines. */ OM_uint32 gss_acquire_cred (OM_uint32 *, /* minor_status */ const gss_name_t, /* desired_name */ OM_uint32, /* time_req */ const gss_OID_set, /* desired_mechs */ gss_cred_usage_t, /* cred_usage */ gss_cred_id_t *, /* output_cred_handle */ gss_OID_set *, /* actual_mechs */ OM_uint32 * /* time_rec */ ); OM_uint32 gss_release_cred (OM_uint32 *, /* minor_status */ gss_cred_id_t * /* cred_handle */ ); OM_uint32 gss_init_sec_context (OM_uint32 *, /* minor_status */ const gss_cred_id_t, /* initiator_cred_handle */ gss_ctx_id_t *, /* context_handle */ const gss_name_t, /* target_name */ const gss_OID, /* mech_type */ OM_uint32, /* req_flags */ OM_uint32, /* time_req */ const gss_channel_bindings_t, /* input_chan_bindings */ const gss_buffer_t, /* input_token */ gss_OID *, /* actual_mech_type */ gss_buffer_t, /* output_token */ OM_uint32 *, /* ret_flags */ OM_uint32 * /* time_rec */ ); OM_uint32 gss_accept_sec_context (OM_uint32 *, /* minor_status */ gss_ctx_id_t *, /* context_handle */ const gss_cred_id_t, /* acceptor_cred_handle */ const gss_buffer_t, /* input_token_buffer */ const gss_channel_bindings_t, /* input_chan_bindings */ gss_name_t *, /* src_name */ gss_OID *, /* mech_type */ gss_buffer_t, /* output_token */ OM_uint32 *, /* ret_flags */ OM_uint32 *, /* time_rec */ gss_cred_id_t * /* delegated_cred_handle */ ); OM_uint32 gss_delete_sec_context (OM_uint32 *, /* minor_status */ gss_ctx_id_t *, /* context_handle */ gss_buffer_t /* output_token */ ); OM_uint32 gss_get_mic (OM_uint32 *, /* minor_status */ const gss_ctx_id_t, /* context_handle */ gss_qop_t, /* qop_req */ const gss_buffer_t, /* message_buffer */ gss_buffer_t /* message_token */ ); OM_uint32 gss_verify_mic (OM_uint32 *, /* minor_status */ const gss_ctx_id_t, /* context_handle */ const gss_buffer_t, /* message_buffer */ const gss_buffer_t, /* token_buffer */ gss_qop_t * /* qop_state */ ); OM_uint32 gss_wrap (OM_uint32 *, /* minor_status */ const gss_ctx_id_t, /* context_handle */ int, /* conf_req_flag */ gss_qop_t, /* qop_req */ const gss_buffer_t, /* input_message_buffer */ int *, /* conf_state */ gss_buffer_t /* output_message_buffer */ ); OM_uint32 gss_unwrap (OM_uint32 *, /* minor_status */ const gss_ctx_id_t, /* context_handle */ const gss_buffer_t, /* input_message_buffer */ gss_buffer_t, /* output_message_buffer */ int *, /* conf_state */ gss_qop_t * /* qop_state */ ); OM_uint32 gss_display_status (OM_uint32 *, /* minor_status */ OM_uint32, /* status_value */ int, /* status_type */ const gss_OID, /* mech_type */ OM_uint32 *, /* message_context */ gss_buffer_t /* status_string */ ); OM_uint32 gss_import_name (OM_uint32 *, /* minor_status */ const gss_buffer_t, /* input_name_buffer */ const gss_OID, /* input_name_type */ gss_name_t * /* output_name */ ); OM_uint32 gss_export_name (OM_uint32 *, /* minor_status */ const gss_name_t, /* input_name */ gss_buffer_t /* exported_name */ ); OM_uint32 gss_release_name (OM_uint32 *, /* minor_status */ gss_name_t * /* input_name */ ); OM_uint32 gss_release_buffer (OM_uint32 *, /* minor_status */ gss_buffer_t /* buffer */ ); OM_uint32 gss_release_oid_set (OM_uint32 *, /* minor_status */ gss_OID_set * /* set */ ); OM_uint32 gss_wrap_size_limit ( OM_uint32 *, /* minor_status */ const gss_ctx_id_t, /* context_handle */ int, /* conf_req_flag */ gss_qop_t, /* qop_req */ OM_uint32, /* req_output_size */ OM_uint32 * /* max_input_size */ ); OM_uint32 gss_create_empty_oid_set ( OM_uint32 *, /* minor_status */ gss_OID_set * /* oid_set */ ); OM_uint32 gss_add_oid_set_member ( OM_uint32 *, /* minor_status */ const gss_OID, /* member_oid */ gss_OID_set * /* oid_set */ ); OM_uint32 gss_test_oid_set_member ( OM_uint32 *, /* minor_status */ const gss_OID, /* member */ const gss_OID_set, /* set */ int * /* present */ ); OM_uint32 gss_canonicalize_name ( OM_uint32 *, /* minor_status */ const gss_name_t, /* input_name */ const gss_OID, /* mech_type */ gss_name_t * /* output_name */ ); /* * Other extensions and helper functions. */ OM_uint32 gss_set_cred_option (OM_uint32 *, /* minor status */ gss_cred_id_t *, /* cred */ const gss_OID, /* option to set */ const gss_buffer_t /* option value */ ); OM_uint32 gss_pname_to_uid (OM_uint32 *, /* minor status */ const gss_name_t pname, /* principal name */ const gss_OID mech, /* mechanism to query */ uid_t *uidp /* pointer to UID for result */ ); /* * On entry, *numgroups is set to the maximum number of groups to return. On exit, *numgroups is set to the actual number of groups returned. */ OM_uint32 gss_pname_to_unix_cred (OM_uint32 *, /* minor status */ const gss_name_t pname, /* principal name */ const gss_OID mech, /* mechanism to query */ uid_t *uidp, /* pointer to UID for result */ gid_t *gidp, /* pointer to GID for result */ int *numgroups, /* number of groups */ gid_t *groups /* pointer to group list */ ); /* * Mbuf oriented message signing and encryption. * * Get_mic allocates an mbuf to hold the message checksum. Verify_mic * may modify the passed-in mic but will not free it. * * Wrap and unwrap * consume the message and generate a new mbuf chain with the * result. The original message is freed on error. */ struct mbuf; OM_uint32 gss_get_mic_mbuf (OM_uint32 *, /* minor_status */ const gss_ctx_id_t, /* context_handle */ gss_qop_t, /* qop_req */ struct mbuf *, /* message_buffer */ struct mbuf ** /* message_token */ ); OM_uint32 gss_verify_mic_mbuf (OM_uint32 *, /* minor_status */ const gss_ctx_id_t, /* context_handle */ struct mbuf *, /* message_buffer */ struct mbuf *, /* token_buffer */ gss_qop_t * /* qop_state */ ); OM_uint32 gss_wrap_mbuf (OM_uint32 *, /* minor_status */ const gss_ctx_id_t, /* context_handle */ int, /* conf_req_flag */ gss_qop_t, /* qop_req */ struct mbuf **, /* message_buffer */ int * /* conf_state */ ); OM_uint32 gss_unwrap_mbuf (OM_uint32 *, /* minor_status */ const gss_ctx_id_t, /* context_handle */ struct mbuf **, /* message_buffer */ int *, /* conf_state */ gss_qop_t * /* qop_state */ ); __END_DECLS #endif /* _KGSSAPI_GSSAPI_H_ */ Index: head/sys/kgssapi/gsstest.c =================================================================== --- head/sys/kgssapi/gsstest.c (revision 365228) +++ head/sys/kgssapi/gsstest.c (revision 365229) @@ -1,1149 +1,1147 @@ /*- * SPDX-License-Identifier: BSD-2-Clause-FreeBSD * * Copyright (c) 2008 Isilon Inc http://www.isilon.com/ * Authors: Doug Rabson * Developed with Red Inc: Alfred Perlstein * * 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 AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include __FBSDID("$FreeBSD$"); #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include static void report_error(gss_OID mech, OM_uint32 maj, OM_uint32 min) { OM_uint32 maj_stat, min_stat; OM_uint32 message_context; gss_buffer_desc buf; uprintf("major_stat=%d, minor_stat=%d\n", maj, min); message_context = 0; do { maj_stat = gss_display_status(&min_stat, maj, GSS_C_GSS_CODE, GSS_C_NO_OID, &message_context, &buf); if (GSS_ERROR(maj_stat)) break; uprintf("%.*s\n", (int)buf.length, (char *) buf.value); gss_release_buffer(&min_stat, &buf); } while (message_context); if (mech && min) { message_context = 0; do { maj_stat = gss_display_status(&min_stat, min, GSS_C_MECH_CODE, mech, &message_context, &buf); if (GSS_ERROR(maj_stat)) break; uprintf("%.*s\n", (int)buf.length, (char *) buf.value); gss_release_buffer(&min_stat, &buf); } while (message_context); } } #if 0 static void send_token_to_peer(const gss_buffer_t token) { const uint8_t *p; size_t i; printf("send token:\n"); printf("%d ", (int) token->length); p = (const uint8_t *) token->value; for (i = 0; i < token->length; i++) printf("%02x", *p++); printf("\n"); } static void receive_token_from_peer(gss_buffer_t token) { char line[8192]; char *p; uint8_t *q; int len, val; printf("receive token:\n"); fgets(line, sizeof(line), stdin); if (line[strlen(line) - 1] != '\n') { printf("token truncated\n"); exit(1); } p = line; if (sscanf(line, "%d ", &len) != 1) { printf("bad token\n"); exit(1); } p = strchr(p, ' ') + 1; token->length = len; token->value = malloc(len); q = (uint8_t *) token->value; while (len) { if (sscanf(p, "%02x", &val) != 1) { printf("bad token\n"); exit(1); } *q++ = val; p += 2; len--; } } #endif #if 0 void server(int argc, char** argv) { OM_uint32 maj_stat, min_stat; gss_buffer_desc input_token, output_token; gss_ctx_id_t context_hdl = GSS_C_NO_CONTEXT; gss_name_t client_name; gss_OID mech_type; if (argc != 1) usage(); do { receive_token_from_peer(&input_token); maj_stat = gss_accept_sec_context(&min_stat, &context_hdl, GSS_C_NO_CREDENTIAL, &input_token, GSS_C_NO_CHANNEL_BINDINGS, &client_name, &mech_type, &output_token, NULL, NULL, NULL); if (GSS_ERROR(maj_stat)) { report_error(mech_type, maj_stat, min_stat); } if (output_token.length != 0) { send_token_to_peer(&output_token); gss_release_buffer(&min_stat, &output_token); } if (GSS_ERROR(maj_stat)) { if (context_hdl != GSS_C_NO_CONTEXT) gss_delete_sec_context(&min_stat, &context_hdl, GSS_C_NO_BUFFER); break; } } while (maj_stat & GSS_S_CONTINUE_NEEDED); if (client_name) { gss_buffer_desc name_desc; char buf[512]; gss_display_name(&min_stat, client_name, &name_desc, NULL); memcpy(buf, name_desc.value, name_desc.length); buf[name_desc.length] = 0; gss_release_buffer(&min_stat, &name_desc); printf("client name is %s\n", buf); } receive_token_from_peer(&input_token); gss_unwrap(&min_stat, context_hdl, &input_token, &output_token, NULL, NULL); printf("%.*s\n", (int)output_token.length, (char *) output_token.value); gss_release_buffer(&min_stat, &output_token); } #endif /* 1.2.752.43.13.14 */ static gss_OID_desc gss_krb5_set_allowable_enctypes_x_desc = {6, (void *) "\x2a\x85\x70\x2b\x0d\x0e"}; gss_OID GSS_KRB5_SET_ALLOWABLE_ENCTYPES_X = &gss_krb5_set_allowable_enctypes_x_desc; #define ETYPE_DES_CBC_CRC 1 /* * Create an initiator context and acceptor context in the kernel and * use them to exchange signed and sealed messages. */ static int gsstest_1(struct thread *td) { OM_uint32 maj_stat, min_stat; OM_uint32 smaj_stat, smin_stat; int context_established = 0; gss_ctx_id_t client_context = GSS_C_NO_CONTEXT; gss_ctx_id_t server_context = GSS_C_NO_CONTEXT; gss_cred_id_t client_cred = GSS_C_NO_CREDENTIAL; gss_cred_id_t server_cred = GSS_C_NO_CREDENTIAL; gss_name_t name = GSS_C_NO_NAME; gss_name_t received_name = GSS_C_NO_NAME; gss_buffer_desc name_desc; gss_buffer_desc client_token, server_token, message_buf; gss_OID mech, actual_mech, mech_type; static gss_OID_desc krb5_desc = {9, (void *)"\x2a\x86\x48\x86\xf7\x12\x01\x02\x02"}; #if 0 static gss_OID_desc spnego_desc = {6, (void *)"\x2b\x06\x01\x05\x05\x02"}; static gss_OID_desc ntlm_desc = {10, (void *)"\x2b\x06\x01\x04\x01\x82\x37\x02\x02\x0a"}; #endif char enctype[sizeof(uint32_t)]; mech = GSS_C_NO_OID; { static char sbuf[512]; memcpy(sbuf, "nfs@", 4); getcredhostname(td->td_ucred, sbuf + 4, sizeof(sbuf) - 4); name_desc.value = sbuf; } name_desc.length = strlen((const char *) name_desc.value); maj_stat = gss_import_name(&min_stat, &name_desc, GSS_C_NT_HOSTBASED_SERVICE, &name); if (GSS_ERROR(maj_stat)) { printf("gss_import_name failed\n"); report_error(mech, maj_stat, min_stat); goto out; } maj_stat = gss_acquire_cred(&min_stat, GSS_C_NO_NAME, 0, GSS_C_NO_OID_SET, GSS_C_INITIATE, &client_cred, NULL, NULL); if (GSS_ERROR(maj_stat)) { printf("gss_acquire_cred (client) failed\n"); report_error(mech, maj_stat, min_stat); goto out; } enctype[0] = (ETYPE_DES_CBC_CRC >> 24) & 0xff; enctype[1] = (ETYPE_DES_CBC_CRC >> 16) & 0xff; enctype[2] = (ETYPE_DES_CBC_CRC >> 8) & 0xff; enctype[3] = ETYPE_DES_CBC_CRC & 0xff; message_buf.length = sizeof(enctype); message_buf.value = enctype; maj_stat = gss_set_cred_option(&min_stat, &client_cred, GSS_KRB5_SET_ALLOWABLE_ENCTYPES_X, &message_buf); if (GSS_ERROR(maj_stat)) { printf("gss_set_cred_option failed\n"); report_error(mech, maj_stat, min_stat); goto out; } server_token.length = 0; server_token.value = NULL; while (!context_established) { client_token.length = 0; client_token.value = NULL; maj_stat = gss_init_sec_context(&min_stat, client_cred, &client_context, name, mech, GSS_C_MUTUAL_FLAG|GSS_C_CONF_FLAG|GSS_C_INTEG_FLAG, 0, GSS_C_NO_CHANNEL_BINDINGS, &server_token, &actual_mech, &client_token, NULL, NULL); if (server_token.length) gss_release_buffer(&smin_stat, &server_token); if (GSS_ERROR(maj_stat)) { printf("gss_init_sec_context failed\n"); report_error(mech, maj_stat, min_stat); goto out; } if (client_token.length != 0) { if (!server_cred) { gss_OID_set_desc oid_set; oid_set.count = 1; oid_set.elements = &krb5_desc; smaj_stat = gss_acquire_cred(&smin_stat, name, 0, &oid_set, GSS_C_ACCEPT, &server_cred, NULL, NULL); if (GSS_ERROR(smaj_stat)) { printf("gss_acquire_cred (server) failed\n"); report_error(mech_type, smaj_stat, smin_stat); goto out; } } smaj_stat = gss_accept_sec_context(&smin_stat, &server_context, server_cred, &client_token, GSS_C_NO_CHANNEL_BINDINGS, &received_name, &mech_type, &server_token, NULL, NULL, NULL); if (GSS_ERROR(smaj_stat)) { printf("gss_accept_sec_context failed\n"); report_error(mech_type, smaj_stat, smin_stat); goto out; } gss_release_buffer(&min_stat, &client_token); } if (GSS_ERROR(maj_stat)) { if (client_context != GSS_C_NO_CONTEXT) gss_delete_sec_context(&min_stat, &client_context, GSS_C_NO_BUFFER); break; } if (maj_stat == GSS_S_COMPLETE) { context_established = 1; } } message_buf.length = strlen("Hello world"); message_buf.value = (void *) "Hello world"; maj_stat = gss_get_mic(&min_stat, client_context, GSS_C_QOP_DEFAULT, &message_buf, &client_token); if (GSS_ERROR(maj_stat)) { printf("gss_get_mic failed\n"); report_error(mech_type, maj_stat, min_stat); goto out; } maj_stat = gss_verify_mic(&min_stat, server_context, &message_buf, &client_token, NULL); if (GSS_ERROR(maj_stat)) { printf("gss_verify_mic failed\n"); report_error(mech_type, maj_stat, min_stat); goto out; } gss_release_buffer(&min_stat, &client_token); maj_stat = gss_wrap(&min_stat, client_context, TRUE, GSS_C_QOP_DEFAULT, &message_buf, NULL, &client_token); if (GSS_ERROR(maj_stat)) { printf("gss_wrap failed\n"); report_error(mech_type, maj_stat, min_stat); goto out; } maj_stat = gss_unwrap(&min_stat, server_context, &client_token, &server_token, NULL, NULL); if (GSS_ERROR(maj_stat)) { printf("gss_unwrap failed\n"); report_error(mech_type, maj_stat, min_stat); goto out; } if (message_buf.length != server_token.length || memcmp(message_buf.value, server_token.value, message_buf.length)) printf("unwrap result corrupt\n"); - + gss_release_buffer(&min_stat, &client_token); gss_release_buffer(&min_stat, &server_token); out: if (client_context) gss_delete_sec_context(&min_stat, &client_context, GSS_C_NO_BUFFER); if (server_context) gss_delete_sec_context(&min_stat, &server_context, GSS_C_NO_BUFFER); if (client_cred) gss_release_cred(&min_stat, &client_cred); if (server_cred) gss_release_cred(&min_stat, &server_cred); if (name) gss_release_name(&min_stat, &name); if (received_name) gss_release_name(&min_stat, &received_name); return (0); } /* * Interoperability with userland. This takes several steps: * * 1. Accept an initiator token from userland, return acceptor * token. Repeat this step until both userland and kernel return * GSS_S_COMPLETE. * * 2. Receive a signed message from userland and verify the * signature. Return a signed reply to userland for it to verify. * * 3. Receive a wrapped message from userland and unwrap it. Return a * wrapped reply to userland. */ static int gsstest_2(struct thread *td, int step, const gss_buffer_t input_token, OM_uint32 *maj_stat_res, OM_uint32 *min_stat_res, gss_buffer_t output_token) { OM_uint32 maj_stat, min_stat; static int context_established = 0; static gss_ctx_id_t server_context = GSS_C_NO_CONTEXT; static gss_cred_id_t server_cred = GSS_C_NO_CREDENTIAL; static gss_name_t name = GSS_C_NO_NAME; gss_buffer_desc name_desc; gss_buffer_desc message_buf; gss_OID mech_type = GSS_C_NO_OID; char enctype[sizeof(uint32_t)]; int error = EINVAL; maj_stat = GSS_S_FAILURE; min_stat = 0; switch (step) { - case 1: if (server_context == GSS_C_NO_CONTEXT) { static char sbuf[512]; memcpy(sbuf, "nfs@", 4); getcredhostname(td->td_ucred, sbuf + 4, sizeof(sbuf) - 4); name_desc.value = sbuf; name_desc.length = strlen((const char *) name_desc.value); maj_stat = gss_import_name(&min_stat, &name_desc, GSS_C_NT_HOSTBASED_SERVICE, &name); if (GSS_ERROR(maj_stat)) { printf("gss_import_name failed\n"); report_error(mech_type, maj_stat, min_stat); goto out; } maj_stat = gss_acquire_cred(&min_stat, name, 0, GSS_C_NO_OID_SET, GSS_C_ACCEPT, &server_cred, NULL, NULL); if (GSS_ERROR(maj_stat)) { printf("gss_acquire_cred (server) failed\n"); report_error(mech_type, maj_stat, min_stat); goto out; } enctype[0] = (ETYPE_DES_CBC_CRC >> 24) & 0xff; enctype[1] = (ETYPE_DES_CBC_CRC >> 16) & 0xff; enctype[2] = (ETYPE_DES_CBC_CRC >> 8) & 0xff; enctype[3] = ETYPE_DES_CBC_CRC & 0xff; message_buf.length = sizeof(enctype); message_buf.value = enctype; maj_stat = gss_set_cred_option(&min_stat, &server_cred, GSS_KRB5_SET_ALLOWABLE_ENCTYPES_X, &message_buf); if (GSS_ERROR(maj_stat)) { printf("gss_set_cred_option failed\n"); report_error(mech_type, maj_stat, min_stat); goto out; } } maj_stat = gss_accept_sec_context(&min_stat, &server_context, server_cred, input_token, GSS_C_NO_CHANNEL_BINDINGS, NULL, &mech_type, output_token, NULL, NULL, NULL); if (GSS_ERROR(maj_stat)) { printf("gss_accept_sec_context failed\n"); report_error(mech_type, maj_stat, min_stat); goto out; } if (maj_stat == GSS_S_COMPLETE) { context_established = 1; } *maj_stat_res = maj_stat; *min_stat_res = min_stat; break; case 2: message_buf.length = strlen("Hello world"); message_buf.value = (void *) "Hello world"; maj_stat = gss_verify_mic(&min_stat, server_context, &message_buf, input_token, NULL); if (GSS_ERROR(maj_stat)) { printf("gss_verify_mic failed\n"); report_error(mech_type, maj_stat, min_stat); goto out; } maj_stat = gss_get_mic(&min_stat, server_context, GSS_C_QOP_DEFAULT, &message_buf, output_token); if (GSS_ERROR(maj_stat)) { printf("gss_get_mic failed\n"); report_error(mech_type, maj_stat, min_stat); goto out; } break; case 3: maj_stat = gss_unwrap(&min_stat, server_context, input_token, &message_buf, NULL, NULL); if (GSS_ERROR(maj_stat)) { printf("gss_unwrap failed\n"); report_error(mech_type, maj_stat, min_stat); goto out; } gss_release_buffer(&min_stat, &message_buf); message_buf.length = strlen("Hello world"); message_buf.value = (void *) "Hello world"; maj_stat = gss_wrap(&min_stat, server_context, TRUE, GSS_C_QOP_DEFAULT, &message_buf, NULL, output_token); if (GSS_ERROR(maj_stat)) { printf("gss_wrap failed\n"); report_error(mech_type, maj_stat, min_stat); goto out; } break; case 4: maj_stat = gss_unwrap(&min_stat, server_context, input_token, &message_buf, NULL, NULL); if (GSS_ERROR(maj_stat)) { printf("gss_unwrap failed\n"); report_error(mech_type, maj_stat, min_stat); goto out; } gss_release_buffer(&min_stat, &message_buf); message_buf.length = strlen("Hello world"); message_buf.value = (void *) "Hello world"; maj_stat = gss_wrap(&min_stat, server_context, FALSE, GSS_C_QOP_DEFAULT, &message_buf, NULL, output_token); if (GSS_ERROR(maj_stat)) { printf("gss_wrap failed\n"); report_error(mech_type, maj_stat, min_stat); goto out; } break; case 5: error = 0; goto out; } *maj_stat_res = maj_stat; *min_stat_res = min_stat; return (0); - + out: *maj_stat_res = maj_stat; *min_stat_res = min_stat; if (server_context) gss_delete_sec_context(&min_stat, &server_context, GSS_C_NO_BUFFER); if (server_cred) gss_release_cred(&min_stat, &server_cred); if (name) gss_release_name(&min_stat, &name); return (error); } /* * Create an RPC client handle for the given (address,prog,vers) * triple using UDP. */ static CLIENT * gsstest_get_rpc(struct sockaddr *sa, rpcprog_t prog, rpcvers_t vers) { struct thread *td = curthread; const char* protofmly; struct sockaddr_storage ss; struct socket *so; CLIENT *rpcb; struct timeval timo; RPCB parms; char *uaddr; enum clnt_stat stat = RPC_SUCCESS; int rpcvers = RPCBVERS4; bool_t do_tcp = FALSE; struct portmap mapping; u_short port = 0; /* * First we need to contact the remote RPCBIND service to find * the right port. */ memcpy(&ss, sa, sa->sa_len); switch (ss.ss_family) { case AF_INET: ((struct sockaddr_in *)&ss)->sin_port = htons(111); protofmly = "inet"; socreate(AF_INET, &so, SOCK_DGRAM, 0, td->td_ucred, td); break; #ifdef INET6 case AF_INET6: ((struct sockaddr_in6 *)&ss)->sin6_port = htons(111); protofmly = "inet6"; socreate(AF_INET6, &so, SOCK_DGRAM, 0, td->td_ucred, td); break; #endif default: /* * Unsupported address family - fail. */ return (NULL); } rpcb = clnt_dg_create(so, (struct sockaddr *)&ss, RPCBPROG, rpcvers, 0, 0); if (!rpcb) return (NULL); try_tcp: parms.r_prog = prog; parms.r_vers = vers; if (do_tcp) parms.r_netid = "tcp"; else parms.r_netid = "udp"; parms.r_addr = ""; parms.r_owner = ""; /* * Use the default timeout. */ timo.tv_sec = 25; timo.tv_usec = 0; again: switch (rpcvers) { case RPCBVERS4: case RPCBVERS: /* * Try RPCBIND 4 then 3. */ uaddr = NULL; stat = CLNT_CALL(rpcb, (rpcprog_t) RPCBPROC_GETADDR, (xdrproc_t) xdr_rpcb, &parms, (xdrproc_t) xdr_wrapstring, &uaddr, timo); if (stat == RPC_PROGVERSMISMATCH) { if (rpcvers == RPCBVERS4) rpcvers = RPCBVERS; else if (rpcvers == RPCBVERS) rpcvers = PMAPVERS; CLNT_CONTROL(rpcb, CLSET_VERS, &rpcvers); goto again; } else if (stat == RPC_SUCCESS) { /* * We have a reply from the remote RPCBIND - turn it * into an appropriate address and make a new client * that can talk to the remote service. * * XXX fixup IPv6 scope ID. */ struct netbuf *a; a = __rpc_uaddr2taddr_af(ss.ss_family, uaddr); xdr_free((xdrproc_t) xdr_wrapstring, &uaddr); if (!a) { CLNT_DESTROY(rpcb); return (NULL); } memcpy(&ss, a->buf, a->len); free(a->buf, M_RPC); free(a, M_RPC); } break; case PMAPVERS: /* * Try portmap. */ mapping.pm_prog = parms.r_prog; mapping.pm_vers = parms.r_vers; mapping.pm_prot = do_tcp ? IPPROTO_TCP : IPPROTO_UDP; mapping.pm_port = 0; stat = CLNT_CALL(rpcb, (rpcprog_t) PMAPPROC_GETPORT, (xdrproc_t) xdr_portmap, &mapping, (xdrproc_t) xdr_u_short, &port, timo); if (stat == RPC_SUCCESS) { switch (ss.ss_family) { case AF_INET: ((struct sockaddr_in *)&ss)->sin_port = htons(port); break; #ifdef INET6 case AF_INET6: ((struct sockaddr_in6 *)&ss)->sin6_port = htons(port); break; #endif } } break; default: panic("invalid rpcvers %d", rpcvers); } /* * We may have a positive response from the portmapper, but * the requested service was not found. Make sure we received * a valid port. */ switch (ss.ss_family) { case AF_INET: port = ((struct sockaddr_in *)&ss)->sin_port; break; #ifdef INET6 case AF_INET6: port = ((struct sockaddr_in6 *)&ss)->sin6_port; break; #endif } if (stat != RPC_SUCCESS || !port) { /* * If we were able to talk to rpcbind or portmap, but the udp * variant wasn't available, ask about tcp. * * XXX - We could also check for a TCP portmapper, but * if the host is running a portmapper at all, we should be able * to hail it over UDP. */ if (stat == RPC_SUCCESS && !do_tcp) { do_tcp = TRUE; goto try_tcp; } /* Otherwise, bad news. */ printf("gsstest_get_rpc: failed to contact remote rpcbind, " "stat = %d, port = %d\n", (int) stat, port); CLNT_DESTROY(rpcb); return (NULL); } if (do_tcp) { /* * Destroy the UDP client we used to speak to rpcbind and * recreate as a TCP client. */ struct netconfig *nconf = NULL; CLNT_DESTROY(rpcb); switch (ss.ss_family) { case AF_INET: nconf = getnetconfigent("tcp"); break; #ifdef INET6 case AF_INET6: nconf = getnetconfigent("tcp6"); break; #endif } rpcb = clnt_reconnect_create(nconf, (struct sockaddr *)&ss, prog, vers, 0, 0); } else { /* * Re-use the client we used to speak to rpcbind. */ CLNT_CONTROL(rpcb, CLSET_SVC_ADDR, &ss); CLNT_CONTROL(rpcb, CLSET_PROG, &prog); CLNT_CONTROL(rpcb, CLSET_VERS, &vers); } return (rpcb); } /* * RPCSEC_GSS client */ static int gsstest_3(struct thread *td) { struct sockaddr_in sin; char service[128]; CLIENT *client; AUTH *auth; rpc_gss_options_ret_t options_ret; enum clnt_stat stat; struct timeval tv; rpc_gss_service_t svc; int i; sin.sin_len = sizeof(sin); sin.sin_family = AF_INET; sin.sin_addr.s_addr = htonl(INADDR_LOOPBACK); sin.sin_port = 0; client = gsstest_get_rpc((struct sockaddr *) &sin, 123456, 1); if (!client) { uprintf("Can't connect to service\n"); return(1); } memcpy(service, "host@", 5); getcredhostname(td->td_ucred, service + 5, sizeof(service) - 5); auth = rpc_gss_seccreate(client, curthread->td_ucred, service, "kerberosv5", rpc_gss_svc_privacy, NULL, NULL, &options_ret); if (!auth) { gss_OID oid; uprintf("Can't authorize to service (mech=%s)\n", options_ret.actual_mechanism); oid = GSS_C_NO_OID; rpc_gss_mech_to_oid(options_ret.actual_mechanism, &oid); report_error(oid, options_ret.major_status, options_ret.minor_status); CLNT_DESTROY(client); return (1); } for (svc = rpc_gss_svc_none; svc <= rpc_gss_svc_privacy; svc++) { const char *svc_names[] = { "rpc_gss_svc_default", "rpc_gss_svc_none", "rpc_gss_svc_integrity", "rpc_gss_svc_privacy" }; int num; rpc_gss_set_defaults(auth, svc, NULL); client->cl_auth = auth; tv.tv_sec = 5; tv.tv_usec = 0; for (i = 42; i < 142; i++) { num = i; stat = CLNT_CALL(client, 1, (xdrproc_t) xdr_int, (char *) &num, (xdrproc_t) xdr_int, (char *) &num, tv); if (stat == RPC_SUCCESS) { if (num != i + 100) uprintf("unexpected reply %d\n", num); } else { uprintf("call failed, stat=%d\n", (int) stat); break; } } if (i == 142) uprintf("call succeeded with %s\n", svc_names[svc]); } AUTH_DESTROY(auth); CLNT_RELEASE(client); return (0); } /* * RPCSEC_GSS server */ static rpc_gss_principal_t server_acl = NULL; static bool_t server_new_context(struct svc_req *req, gss_cred_id_t deleg, gss_ctx_id_t gss_context, rpc_gss_lock_t *lock, void **cookie); static void server_program_1(struct svc_req *rqstp, register SVCXPRT *transp); static int gsstest_4(struct thread *td) { SVCPOOL *pool; char principal[128 + 5]; const char **mechs; static rpc_gss_callback_t cb; memcpy(principal, "host@", 5); getcredhostname(td->td_ucred, principal + 5, sizeof(principal) - 5); mechs = rpc_gss_get_mechanisms(); while (*mechs) { if (!rpc_gss_set_svc_name(principal, *mechs, GSS_C_INDEFINITE, 123456, 1)) { rpc_gss_error_t e; rpc_gss_get_error(&e); printf("setting name for %s for %s failed: %d, %d\n", principal, *mechs, e.rpc_gss_error, e.system_error); } mechs++; } cb.program = 123456; cb.version = 1; cb.callback = server_new_context; rpc_gss_set_callback(&cb); pool = svcpool_create("gsstest", NULL); svc_create(pool, server_program_1, 123456, 1, NULL); svc_run(pool); rpc_gss_clear_svc_name(123456, 1); rpc_gss_clear_callback(&cb); svcpool_destroy(pool); return (0); } static void server_program_1(struct svc_req *rqstp, register SVCXPRT *transp) { rpc_gss_rawcred_t *rcred; rpc_gss_ucred_t *ucred; int i, num; if (rqstp->rq_cred.oa_flavor != RPCSEC_GSS) { svcerr_weakauth(rqstp); return; } if (!rpc_gss_getcred(rqstp, &rcred, &ucred, NULL)) { svcerr_systemerr(rqstp); return; } printf("svc=%d, mech=%s, uid=%d, gid=%d, gids={", rcred->service, rcred->mechanism, ucred->uid, ucred->gid); for (i = 0; i < ucred->gidlen; i++) { if (i > 0) printf(","); printf("%d", ucred->gidlist[i]); } printf("}\n"); switch (rqstp->rq_proc) { case 0: if (!svc_getargs(rqstp, (xdrproc_t) xdr_void, 0)) { svcerr_decode(rqstp); goto out; } if (!svc_sendreply(rqstp, (xdrproc_t) xdr_void, 0)) { svcerr_systemerr(rqstp); } goto out; case 1: if (!svc_getargs(rqstp, (xdrproc_t) xdr_int, (char *) &num)) { svcerr_decode(rqstp); goto out; } num += 100; if (!svc_sendreply(rqstp, (xdrproc_t) xdr_int, (char *) &num)) { svcerr_systemerr(rqstp); } goto out; default: svcerr_noproc(rqstp); goto out; } out: svc_freereq(rqstp); return; } static void print_principal(rpc_gss_principal_t principal) { int i, len, n; uint8_t *p; len = principal->len; p = (uint8_t *) principal->name; while (len > 0) { n = len; if (n > 16) n = 16; for (i = 0; i < n; i++) printf("%02x ", p[i]); for (; i < 16; i++) printf(" "); printf("|"); for (i = 0; i < n; i++) printf("%c", isprint(p[i]) ? p[i] : '.'); printf("|\n"); len -= n; p += n; } } static bool_t server_new_context(__unused struct svc_req *req, gss_cred_id_t deleg, __unused gss_ctx_id_t gss_context, rpc_gss_lock_t *lock, __unused void **cookie) { rpc_gss_rawcred_t *rcred = lock->raw_cred; OM_uint32 junk; printf("new security context version=%d, mech=%s, qop=%s:\n", rcred->version, rcred->mechanism, rcred->qop); print_principal(rcred->client_principal); if (server_acl) { if (rcred->client_principal->len != server_acl->len || memcmp(rcred->client_principal->name, server_acl->name, server_acl->len)) { return (FALSE); } } gss_release_cred(&junk, &deleg); return (TRUE); } /* * Hook up a syscall for gssapi testing. */ struct gsstest_args { int a_op; void *a_args; void *a_res; }; struct gsstest_2_args { int step; /* test step number */ gss_buffer_desc input_token; /* token from userland */ gss_buffer_desc output_token; /* buffer to receive reply token */ }; struct gsstest_2_res { OM_uint32 maj_stat; /* maj_stat from kernel */ OM_uint32 min_stat; /* min_stat from kernel */ gss_buffer_desc output_token; /* reply token (using space from gsstest_2_args.output) */ }; static int gsstest(struct thread *td, struct gsstest_args *uap) { int error; switch (uap->a_op) { case 1: return (gsstest_1(td)); case 2: { struct gsstest_2_args args; struct gsstest_2_res res; gss_buffer_desc input_token, output_token; OM_uint32 junk; error = copyin(uap->a_args, &args, sizeof(args)); if (error) return (error); input_token.length = args.input_token.length; input_token.value = malloc(input_token.length, M_GSSAPI, M_WAITOK); error = copyin(args.input_token.value, input_token.value, input_token.length); if (error) { gss_release_buffer(&junk, &input_token); return (error); } output_token.length = 0; output_token.value = NULL; gsstest_2(td, args.step, &input_token, &res.maj_stat, &res.min_stat, &output_token); gss_release_buffer(&junk, &input_token); if (output_token.length > args.output_token.length) { gss_release_buffer(&junk, &output_token); return (EOVERFLOW); } res.output_token.length = output_token.length; res.output_token.value = args.output_token.value; error = copyout(output_token.value, res.output_token.value, output_token.length); gss_release_buffer(&junk, &output_token); if (error) return (error); return (copyout(&res, uap->a_res, sizeof(res))); break; } case 3: return (gsstest_3(td)); case 4: return (gsstest_4(td)); } return (EINVAL); } /* * The `sysent' for the new syscall */ static struct sysent gsstest_sysent = { 3, /* sy_narg */ (sy_call_t *) gsstest /* sy_call */ }; /* * The offset in sysent where the syscall is allocated. */ static int gsstest_offset = NO_SYSCALL; /* * The function called at load/unload. */ - static int gsstest_load(struct module *module, int cmd, void *arg) { int error = 0; switch (cmd) { case MOD_LOAD : break; case MOD_UNLOAD : break; default : error = EOPNOTSUPP; break; } return error; } SYSCALL_MODULE(gsstest_syscall, &gsstest_offset, &gsstest_sysent, gsstest_load, NULL); Index: head/sys/kgssapi/krb5/kcrypto_aes.c =================================================================== --- head/sys/kgssapi/krb5/kcrypto_aes.c (revision 365228) +++ head/sys/kgssapi/krb5/kcrypto_aes.c (revision 365229) @@ -1,382 +1,382 @@ /*- * SPDX-License-Identifier: BSD-2-Clause-FreeBSD * * Copyright (c) 2008 Isilon Inc http://www.isilon.com/ * Authors: Doug Rabson * Developed with Red Inc: Alfred Perlstein * * 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 AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include __FBSDID("$FreeBSD$"); #include #include #include #include #include #include #include #include #include #include "kcrypto.h" struct aes_state { struct mtx as_lock; crypto_session_t as_session_aes; crypto_session_t as_session_sha1; }; static void aes_init(struct krb5_key_state *ks) { struct aes_state *as; as = malloc(sizeof(struct aes_state), M_GSSAPI, M_WAITOK|M_ZERO); mtx_init(&as->as_lock, "gss aes lock", NULL, MTX_DEF); ks->ks_priv = as; } static void aes_destroy(struct krb5_key_state *ks) { struct aes_state *as = ks->ks_priv; if (as->as_session_aes != 0) crypto_freesession(as->as_session_aes); if (as->as_session_sha1 != 0) crypto_freesession(as->as_session_sha1); mtx_destroy(&as->as_lock); free(ks->ks_priv, M_GSSAPI); } static void aes_set_key(struct krb5_key_state *ks, const void *in) { void *kp = ks->ks_key; struct aes_state *as = ks->ks_priv; struct crypto_session_params csp; if (kp != in) bcopy(in, kp, ks->ks_class->ec_keylen); if (as->as_session_aes != 0) crypto_freesession(as->as_session_aes); if (as->as_session_sha1 != 0) crypto_freesession(as->as_session_sha1); /* * We only want the first 96 bits of the HMAC. */ memset(&csp, 0, sizeof(csp)); csp.csp_mode = CSP_MODE_DIGEST; csp.csp_auth_alg = CRYPTO_SHA1_HMAC; csp.csp_auth_klen = ks->ks_class->ec_keybits / 8; csp.csp_auth_mlen = 12; csp.csp_auth_key = ks->ks_key; crypto_newsession(&as->as_session_sha1, &csp, CRYPTOCAP_F_HARDWARE | CRYPTOCAP_F_SOFTWARE); memset(&csp, 0, sizeof(csp)); csp.csp_mode = CSP_MODE_CIPHER; csp.csp_cipher_alg = CRYPTO_AES_CBC; csp.csp_cipher_klen = ks->ks_class->ec_keybits / 8; csp.csp_cipher_key = ks->ks_key; csp.csp_ivlen = 16; crypto_newsession(&as->as_session_aes, &csp, CRYPTOCAP_F_HARDWARE | CRYPTOCAP_F_SOFTWARE); } static void aes_random_to_key(struct krb5_key_state *ks, const void *in) { aes_set_key(ks, in); } static int aes_crypto_cb(struct cryptop *crp) { int error; struct aes_state *as = (struct aes_state *) crp->crp_opaque; - + if (crypto_ses2caps(crp->crp_session) & CRYPTOCAP_F_SYNC) return (0); error = crp->crp_etype; if (error == EAGAIN) error = crypto_dispatch(crp); mtx_lock(&as->as_lock); if (error || (crp->crp_flags & CRYPTO_F_DONE)) wakeup(crp); mtx_unlock(&as->as_lock); return (0); } static void aes_encrypt_1(const struct krb5_key_state *ks, int buftype, void *buf, size_t skip, size_t len, void *ivec, bool encrypt) { struct aes_state *as = ks->ks_priv; struct cryptop *crp; int error; crp = crypto_getreq(as->as_session_aes, M_WAITOK); crp->crp_payload_start = skip; crp->crp_payload_length = len; crp->crp_op = encrypt ? CRYPTO_OP_ENCRYPT : CRYPTO_OP_DECRYPT; crp->crp_flags = CRYPTO_F_CBIFSYNC | CRYPTO_F_IV_SEPARATE; if (ivec) { memcpy(crp->crp_iv, ivec, 16); } else { memset(crp->crp_iv, 0, 16); } if (buftype == CRYPTO_BUF_MBUF) crypto_use_mbuf(crp, buf); else crypto_use_buf(crp, buf, skip + len); crp->crp_opaque = as; crp->crp_callback = aes_crypto_cb; error = crypto_dispatch(crp); if ((crypto_ses2caps(as->as_session_aes) & CRYPTOCAP_F_SYNC) == 0) { mtx_lock(&as->as_lock); if (!error && !(crp->crp_flags & CRYPTO_F_DONE)) error = msleep(crp, &as->as_lock, 0, "gssaes", 0); mtx_unlock(&as->as_lock); } crypto_freereq(crp); } static void aes_encrypt(const struct krb5_key_state *ks, struct mbuf *inout, size_t skip, size_t len, void *ivec, size_t ivlen) { size_t blocklen = 16, plen; struct { uint8_t cn_1[16], cn[16]; } last2; int i, off; /* * AES encryption with cyphertext stealing: * * CTSencrypt(P[0], ..., P[n], IV, K): * len = length(P[n]) * (C[0], ..., C[n-2], E[n-1]) = * CBCencrypt(P[0], ..., P[n-1], IV, K) * P = pad(P[n], 0, blocksize) * E[n] = CBCencrypt(P, E[n-1], K); * C[n-1] = E[n] * C[n] = E[n-1]{0..len-1} */ plen = len % blocklen; if (len == blocklen) { /* * Note: caller will ensure len >= blocklen. */ aes_encrypt_1(ks, CRYPTO_BUF_MBUF, inout, skip, len, ivec, true); } else if (plen == 0) { /* * This is equivalent to CBC mode followed by swapping * the last two blocks. We assume that neither of the * last two blocks cross iov boundaries. */ aes_encrypt_1(ks, CRYPTO_BUF_MBUF, inout, skip, len, ivec, true); off = skip + len - 2 * blocklen; m_copydata(inout, off, 2 * blocklen, (void*) &last2); m_copyback(inout, off, blocklen, last2.cn); m_copyback(inout, off + blocklen, blocklen, last2.cn_1); } else { /* * This is the difficult case. We encrypt all but the * last partial block first. We then create a padded * copy of the last block and encrypt that using the * second to last encrypted block as IV. Once we have * the encrypted versions of the last two blocks, we * reshuffle to create the final result. */ aes_encrypt_1(ks, CRYPTO_BUF_MBUF, inout, skip, len - plen, ivec, true); /* * Copy out the last two blocks, pad the last block * and encrypt it. Rearrange to get the final * result. The cyphertext for cn_1 is in cn. The * cyphertext for cn is the first plen bytes of what * is in cn_1 now. */ off = skip + len - blocklen - plen; m_copydata(inout, off, blocklen + plen, (void*) &last2); for (i = plen; i < blocklen; i++) last2.cn[i] = 0; aes_encrypt_1(ks, CRYPTO_BUF_CONTIG, last2.cn, 0, blocklen, last2.cn_1, true); m_copyback(inout, off, blocklen, last2.cn); m_copyback(inout, off + blocklen, plen, last2.cn_1); } } static void aes_decrypt(const struct krb5_key_state *ks, struct mbuf *inout, size_t skip, size_t len, void *ivec, size_t ivlen) { size_t blocklen = 16, plen; struct { uint8_t cn_1[16], cn[16]; } last2; int i, off, t; /* * AES decryption with cyphertext stealing: * * CTSencrypt(C[0], ..., C[n], IV, K): * len = length(C[n]) * E[n] = C[n-1] * X = decrypt(E[n], K) * P[n] = (X ^ C[n]){0..len-1} * E[n-1] = {C[n,0],...,C[n,len-1],X[len],...,X[blocksize-1]} * (P[0],...,P[n-1]) = CBCdecrypt(C[0],...,C[n-2],E[n-1], IV, K) */ plen = len % blocklen; if (len == blocklen) { /* * Note: caller will ensure len >= blocklen. */ aes_encrypt_1(ks, CRYPTO_BUF_MBUF, inout, skip, len, ivec, false); } else if (plen == 0) { /* * This is equivalent to CBC mode followed by swapping * the last two blocks. */ off = skip + len - 2 * blocklen; m_copydata(inout, off, 2 * blocklen, (void*) &last2); m_copyback(inout, off, blocklen, last2.cn); m_copyback(inout, off + blocklen, blocklen, last2.cn_1); aes_encrypt_1(ks, CRYPTO_BUF_MBUF, inout, skip, len, ivec, false); } else { /* * This is the difficult case. We first decrypt the * second to last block with a zero IV to make X. The * plaintext for the last block is the XOR of X and * the last cyphertext block. * * We derive a new cypher text for the second to last * block by mixing the unused bytes of X with the last * cyphertext block. The result of that can be * decrypted with the rest in CBC mode. */ off = skip + len - plen - blocklen; aes_encrypt_1(ks, CRYPTO_BUF_MBUF, inout, off, blocklen, NULL, false); m_copydata(inout, off, blocklen + plen, (void*) &last2); for (i = 0; i < plen; i++) { t = last2.cn[i]; last2.cn[i] ^= last2.cn_1[i]; last2.cn_1[i] = t; } m_copyback(inout, off, blocklen + plen, (void*) &last2); aes_encrypt_1(ks, CRYPTO_BUF_MBUF, inout, skip, len - plen, ivec, false); } } static void aes_checksum(const struct krb5_key_state *ks, int usage, struct mbuf *inout, size_t skip, size_t inlen, size_t outlen) { struct aes_state *as = ks->ks_priv; struct cryptop *crp; int error; crp = crypto_getreq(as->as_session_sha1, M_WAITOK); crp->crp_payload_start = skip; crp->crp_payload_length = inlen; crp->crp_digest_start = skip + inlen; crp->crp_flags = CRYPTO_F_CBIFSYNC; crypto_use_mbuf(crp, inout); crp->crp_opaque = as; crp->crp_callback = aes_crypto_cb; error = crypto_dispatch(crp); if ((crypto_ses2caps(as->as_session_sha1) & CRYPTOCAP_F_SYNC) == 0) { mtx_lock(&as->as_lock); if (!error && !(crp->crp_flags & CRYPTO_F_DONE)) error = msleep(crp, &as->as_lock, 0, "gssaes", 0); mtx_unlock(&as->as_lock); } crypto_freereq(crp); } struct krb5_encryption_class krb5_aes128_encryption_class = { "aes128-cts-hmac-sha1-96", /* name */ ETYPE_AES128_CTS_HMAC_SHA1_96, /* etype */ EC_DERIVED_KEYS, /* flags */ 16, /* blocklen */ 1, /* msgblocklen */ 12, /* checksumlen */ 128, /* keybits */ 16, /* keylen */ aes_init, aes_destroy, aes_set_key, aes_random_to_key, aes_encrypt, aes_decrypt, aes_checksum }; struct krb5_encryption_class krb5_aes256_encryption_class = { "aes256-cts-hmac-sha1-96", /* name */ ETYPE_AES256_CTS_HMAC_SHA1_96, /* etype */ EC_DERIVED_KEYS, /* flags */ 16, /* blocklen */ 1, /* msgblocklen */ 12, /* checksumlen */ 256, /* keybits */ 32, /* keylen */ aes_init, aes_destroy, aes_set_key, aes_random_to_key, aes_encrypt, aes_decrypt, aes_checksum }; Index: head/sys/kgssapi/krb5/krb5_mech.c =================================================================== --- head/sys/kgssapi/krb5/krb5_mech.c (revision 365228) +++ head/sys/kgssapi/krb5/krb5_mech.c (revision 365229) @@ -1,2129 +1,2128 @@ /*- * SPDX-License-Identifier: BSD-2-Clause-FreeBSD * * Copyright (c) 2008 Isilon Inc http://www.isilon.com/ * Authors: Doug Rabson * Developed with Red Inc: Alfred Perlstein * * 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 AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include __FBSDID("$FreeBSD$"); #include "opt_inet6.h" #include #include #include #include #include #include #include #include #include #include #include "kgss_if.h" #include "kcrypto.h" #define GSS_TOKEN_SENT_BY_ACCEPTOR 1 #define GSS_TOKEN_SEALED 2 #define GSS_TOKEN_ACCEPTOR_SUBKEY 4 static gss_OID_desc krb5_mech_oid = {9, (void *) "\x2a\x86\x48\x86\xf7\x12\x01\x02\x02" }; struct krb5_data { size_t kd_length; void *kd_data; }; struct krb5_keyblock { uint16_t kk_type; /* encryption type */ struct krb5_data kk_key; /* key data */ }; struct krb5_address { uint16_t ka_type; struct krb5_data ka_addr; }; /* * The km_elem array is ordered so that the highest received sequence * number is listed first. */ struct krb5_msg_order { uint32_t km_flags; uint32_t km_start; uint32_t km_length; uint32_t km_jitter_window; uint32_t km_first_seq; uint32_t *km_elem; }; struct krb5_context { struct _gss_ctx_id_t kc_common; struct mtx kc_lock; uint32_t kc_ac_flags; uint32_t kc_ctx_flags; uint32_t kc_more_flags; #define LOCAL 1 #define OPEN 2 #define COMPAT_OLD_DES3 4 #define COMPAT_OLD_DES3_SELECTED 8 #define ACCEPTOR_SUBKEY 16 struct krb5_address kc_local_address; struct krb5_address kc_remote_address; uint16_t kc_local_port; uint16_t kc_remote_port; struct krb5_keyblock kc_keyblock; struct krb5_keyblock kc_local_subkey; struct krb5_keyblock kc_remote_subkey; volatile uint32_t kc_local_seqnumber; uint32_t kc_remote_seqnumber; uint32_t kc_keytype; uint32_t kc_cksumtype; struct krb5_data kc_source_name; struct krb5_data kc_target_name; uint32_t kc_lifetime; struct krb5_msg_order kc_msg_order; struct krb5_key_state *kc_tokenkey; struct krb5_key_state *kc_encryptkey; struct krb5_key_state *kc_checksumkey; struct krb5_key_state *kc_send_seal_Ke; struct krb5_key_state *kc_send_seal_Ki; struct krb5_key_state *kc_send_seal_Kc; struct krb5_key_state *kc_send_sign_Kc; struct krb5_key_state *kc_recv_seal_Ke; struct krb5_key_state *kc_recv_seal_Ki; struct krb5_key_state *kc_recv_seal_Kc; struct krb5_key_state *kc_recv_sign_Kc; }; static uint16_t get_uint16(const uint8_t **pp, size_t *lenp) { const uint8_t *p = *pp; uint16_t v; if (*lenp < 2) return (0); v = (p[0] << 8) | p[1]; *pp = p + 2; *lenp = *lenp - 2; return (v); } static uint32_t get_uint32(const uint8_t **pp, size_t *lenp) { const uint8_t *p = *pp; uint32_t v; if (*lenp < 4) return (0); v = (p[0] << 24) | (p[1] << 16) | (p[2] << 8) | p[3]; *pp = p + 4; *lenp = *lenp - 4; return (v); } static void get_data(const uint8_t **pp, size_t *lenp, struct krb5_data *dp) { size_t sz = get_uint32(pp, lenp); dp->kd_length = sz; dp->kd_data = malloc(sz, M_GSSAPI, M_WAITOK); if (*lenp < sz) sz = *lenp; bcopy(*pp, dp->kd_data, sz); (*pp) += sz; (*lenp) -= sz; } static void delete_data(struct krb5_data *dp) { if (dp->kd_data) { free(dp->kd_data, M_GSSAPI); dp->kd_length = 0; dp->kd_data = NULL; } } static void get_address(const uint8_t **pp, size_t *lenp, struct krb5_address *ka) { ka->ka_type = get_uint16(pp, lenp); get_data(pp, lenp, &ka->ka_addr); } static void delete_address(struct krb5_address *ka) { delete_data(&ka->ka_addr); } static void get_keyblock(const uint8_t **pp, size_t *lenp, struct krb5_keyblock *kk) { kk->kk_type = get_uint16(pp, lenp); get_data(pp, lenp, &kk->kk_key); } static void delete_keyblock(struct krb5_keyblock *kk) { if (kk->kk_key.kd_data) bzero(kk->kk_key.kd_data, kk->kk_key.kd_length); delete_data(&kk->kk_key); } static void copy_key(struct krb5_keyblock *from, struct krb5_keyblock **to) { if (from->kk_key.kd_length) *to = from; else *to = NULL; } /* * Return non-zero if we are initiator. */ static __inline int is_initiator(struct krb5_context *kc) { return (kc->kc_more_flags & LOCAL); } /* * Return non-zero if we are acceptor. */ static __inline int is_acceptor(struct krb5_context *kc) { return !(kc->kc_more_flags & LOCAL); } static void get_initiator_subkey(struct krb5_context *kc, struct krb5_keyblock **kdp) { if (is_initiator(kc)) copy_key(&kc->kc_local_subkey, kdp); else copy_key(&kc->kc_remote_subkey, kdp); if (!*kdp) copy_key(&kc->kc_keyblock, kdp); } static void get_acceptor_subkey(struct krb5_context *kc, struct krb5_keyblock **kdp) { if (is_initiator(kc)) copy_key(&kc->kc_remote_subkey, kdp); else copy_key(&kc->kc_local_subkey, kdp); } static OM_uint32 get_keys(struct krb5_context *kc) { struct krb5_keyblock *keydata; struct krb5_encryption_class *ec; struct krb5_key_state *key; int etype; keydata = NULL; get_acceptor_subkey(kc, &keydata); if (!keydata) if ((kc->kc_more_flags & ACCEPTOR_SUBKEY) == 0) get_initiator_subkey(kc, &keydata); if (!keydata) return (GSS_S_FAILURE); /* * GSS-API treats all DES etypes the same and all DES3 etypes * the same. */ switch (keydata->kk_type) { case ETYPE_DES_CBC_CRC: case ETYPE_DES_CBC_MD4: case ETYPE_DES_CBC_MD5: etype = ETYPE_DES_CBC_CRC; break; case ETYPE_DES3_CBC_MD5: case ETYPE_DES3_CBC_SHA1: case ETYPE_OLD_DES3_CBC_SHA1: etype = ETYPE_DES3_CBC_SHA1; break; default: etype = keydata->kk_type; } ec = krb5_find_encryption_class(etype); if (!ec) return (GSS_S_FAILURE); key = krb5_create_key(ec); krb5_set_key(key, keydata->kk_key.kd_data); kc->kc_tokenkey = key; switch (etype) { case ETYPE_DES_CBC_CRC: case ETYPE_ARCFOUR_HMAC_MD5: case ETYPE_ARCFOUR_HMAC_MD5_56: { /* * Single DES and ARCFOUR uses a 'derived' key (XOR * with 0xf0) for encrypting wrap tokens. The original * key is used for checksums and sequence numbers. */ struct krb5_key_state *ekey; uint8_t *ekp, *kp; int i; ekey = krb5_create_key(ec); ekp = ekey->ks_key; kp = key->ks_key; for (i = 0; i < ec->ec_keylen; i++) ekp[i] = kp[i] ^ 0xf0; krb5_set_key(ekey, ekp); kc->kc_encryptkey = ekey; refcount_acquire(&key->ks_refs); kc->kc_checksumkey = key; break; } case ETYPE_DES3_CBC_SHA1: /* * Triple DES uses a RFC 3961 style derived key with * usage number KG_USAGE_SIGN for checksums. The * original key is used for encryption and sequence * numbers. */ kc->kc_checksumkey = krb5_get_checksum_key(key, KG_USAGE_SIGN); refcount_acquire(&key->ks_refs); kc->kc_encryptkey = key; break; default: /* * We need eight derived keys four for sending and * four for receiving. */ if (is_initiator(kc)) { /* * We are initiator. */ kc->kc_send_seal_Ke = krb5_get_encryption_key(key, KG_USAGE_INITIATOR_SEAL); kc->kc_send_seal_Ki = krb5_get_integrity_key(key, KG_USAGE_INITIATOR_SEAL); kc->kc_send_seal_Kc = krb5_get_checksum_key(key, KG_USAGE_INITIATOR_SEAL); kc->kc_send_sign_Kc = krb5_get_checksum_key(key, KG_USAGE_INITIATOR_SIGN); kc->kc_recv_seal_Ke = krb5_get_encryption_key(key, KG_USAGE_ACCEPTOR_SEAL); kc->kc_recv_seal_Ki = krb5_get_integrity_key(key, KG_USAGE_ACCEPTOR_SEAL); kc->kc_recv_seal_Kc = krb5_get_checksum_key(key, KG_USAGE_ACCEPTOR_SEAL); kc->kc_recv_sign_Kc = krb5_get_checksum_key(key, KG_USAGE_ACCEPTOR_SIGN); } else { /* * We are acceptor. */ kc->kc_send_seal_Ke = krb5_get_encryption_key(key, KG_USAGE_ACCEPTOR_SEAL); kc->kc_send_seal_Ki = krb5_get_integrity_key(key, KG_USAGE_ACCEPTOR_SEAL); kc->kc_send_seal_Kc = krb5_get_checksum_key(key, KG_USAGE_ACCEPTOR_SEAL); kc->kc_send_sign_Kc = krb5_get_checksum_key(key, KG_USAGE_ACCEPTOR_SIGN); kc->kc_recv_seal_Ke = krb5_get_encryption_key(key, KG_USAGE_INITIATOR_SEAL); kc->kc_recv_seal_Ki = krb5_get_integrity_key(key, KG_USAGE_INITIATOR_SEAL); kc->kc_recv_seal_Kc = krb5_get_checksum_key(key, KG_USAGE_INITIATOR_SEAL); kc->kc_recv_sign_Kc = krb5_get_checksum_key(key, KG_USAGE_INITIATOR_SIGN); } break; } return (GSS_S_COMPLETE); } static void krb5_init(gss_ctx_id_t ctx) { struct krb5_context *kc = (struct krb5_context *)ctx; mtx_init(&kc->kc_lock, "krb5 gss lock", NULL, MTX_DEF); } static OM_uint32 krb5_import(gss_ctx_id_t ctx, enum sec_context_format format, const gss_buffer_t context_token) { struct krb5_context *kc = (struct krb5_context *)ctx; OM_uint32 res; const uint8_t *p = (const uint8_t *) context_token->value; size_t len = context_token->length; uint32_t flags; int i; - + /* * We support heimdal 0.6 and heimdal 1.1 */ if (format != KGSS_HEIMDAL_0_6 && format != KGSS_HEIMDAL_1_1) return (GSS_S_DEFECTIVE_TOKEN); #define SC_LOCAL_ADDRESS 1 #define SC_REMOTE_ADDRESS 2 #define SC_KEYBLOCK 4 #define SC_LOCAL_SUBKEY 8 #define SC_REMOTE_SUBKEY 16 /* * Ensure that the token starts with krb5 oid. */ if (p[0] != 0x00 || p[1] != krb5_mech_oid.length || len < krb5_mech_oid.length + 2 || bcmp(krb5_mech_oid.elements, p + 2, krb5_mech_oid.length)) return (GSS_S_DEFECTIVE_TOKEN); p += krb5_mech_oid.length + 2; len -= krb5_mech_oid.length + 2; flags = get_uint32(&p, &len); kc->kc_ac_flags = get_uint32(&p, &len); if (flags & SC_LOCAL_ADDRESS) get_address(&p, &len, &kc->kc_local_address); if (flags & SC_REMOTE_ADDRESS) get_address(&p, &len, &kc->kc_remote_address); kc->kc_local_port = get_uint16(&p, &len); kc->kc_remote_port = get_uint16(&p, &len); if (flags & SC_KEYBLOCK) get_keyblock(&p, &len, &kc->kc_keyblock); if (flags & SC_LOCAL_SUBKEY) get_keyblock(&p, &len, &kc->kc_local_subkey); if (flags & SC_REMOTE_SUBKEY) get_keyblock(&p, &len, &kc->kc_remote_subkey); kc->kc_local_seqnumber = get_uint32(&p, &len); kc->kc_remote_seqnumber = get_uint32(&p, &len); kc->kc_keytype = get_uint32(&p, &len); kc->kc_cksumtype = get_uint32(&p, &len); get_data(&p, &len, &kc->kc_source_name); get_data(&p, &len, &kc->kc_target_name); kc->kc_ctx_flags = get_uint32(&p, &len); kc->kc_more_flags = get_uint32(&p, &len); kc->kc_lifetime = get_uint32(&p, &len); /* * Heimdal 1.1 adds the message order stuff. */ if (format == KGSS_HEIMDAL_1_1) { kc->kc_msg_order.km_flags = get_uint32(&p, &len); kc->kc_msg_order.km_start = get_uint32(&p, &len); kc->kc_msg_order.km_length = get_uint32(&p, &len); kc->kc_msg_order.km_jitter_window = get_uint32(&p, &len); kc->kc_msg_order.km_first_seq = get_uint32(&p, &len); kc->kc_msg_order.km_elem = malloc(kc->kc_msg_order.km_jitter_window * sizeof(uint32_t), M_GSSAPI, M_WAITOK); for (i = 0; i < kc->kc_msg_order.km_jitter_window; i++) kc->kc_msg_order.km_elem[i] = get_uint32(&p, &len); } else { kc->kc_msg_order.km_flags = 0; } res = get_keys(kc); if (GSS_ERROR(res)) return (res); /* * We don't need these anymore. */ delete_keyblock(&kc->kc_keyblock); delete_keyblock(&kc->kc_local_subkey); delete_keyblock(&kc->kc_remote_subkey); return (GSS_S_COMPLETE); } static void krb5_delete(gss_ctx_id_t ctx, gss_buffer_t output_token) { struct krb5_context *kc = (struct krb5_context *)ctx; delete_address(&kc->kc_local_address); delete_address(&kc->kc_remote_address); delete_keyblock(&kc->kc_keyblock); delete_keyblock(&kc->kc_local_subkey); delete_keyblock(&kc->kc_remote_subkey); delete_data(&kc->kc_source_name); delete_data(&kc->kc_target_name); if (kc->kc_msg_order.km_elem) free(kc->kc_msg_order.km_elem, M_GSSAPI); if (output_token) { output_token->length = 0; output_token->value = NULL; } if (kc->kc_tokenkey) { krb5_free_key(kc->kc_tokenkey); if (kc->kc_encryptkey) { krb5_free_key(kc->kc_encryptkey); krb5_free_key(kc->kc_checksumkey); } else { krb5_free_key(kc->kc_send_seal_Ke); krb5_free_key(kc->kc_send_seal_Ki); krb5_free_key(kc->kc_send_seal_Kc); krb5_free_key(kc->kc_send_sign_Kc); krb5_free_key(kc->kc_recv_seal_Ke); krb5_free_key(kc->kc_recv_seal_Ki); krb5_free_key(kc->kc_recv_seal_Kc); krb5_free_key(kc->kc_recv_sign_Kc); } } mtx_destroy(&kc->kc_lock); } static gss_OID krb5_mech_type(gss_ctx_id_t ctx) { return (&krb5_mech_oid); } /* * Make a token with the given type and length (the length includes * the TOK_ID), initialising the token header appropriately. Return a * pointer to the TOK_ID of the token. A new mbuf is allocated with * the framing header plus hlen bytes of space. * * Format is as follows: * * 0x60 [APPLICATION 0] SEQUENCE * DER encoded length length of oid + type + inner token length * 0x06 NN OID of mechanism type * TT TT TOK_ID * data for inner token * * 1: der encoded length */ static void * krb5_make_token(char tok_id[2], size_t hlen, size_t len, struct mbuf **mp) { size_t inside_len, len_len, tlen; gss_OID oid = &krb5_mech_oid; struct mbuf *m; uint8_t *p; inside_len = 2 + oid->length + len; if (inside_len < 128) len_len = 1; else if (inside_len < 0x100) len_len = 2; else if (inside_len < 0x10000) len_len = 3; else if (inside_len < 0x1000000) len_len = 4; else len_len = 5; tlen = 1 + len_len + 2 + oid->length + hlen; KASSERT(tlen <= MLEN, ("token head too large")); MGET(m, M_WAITOK, MT_DATA); M_ALIGN(m, tlen); m->m_len = tlen; p = (uint8_t *) m->m_data; *p++ = 0x60; switch (len_len) { case 1: *p++ = inside_len; break; case 2: *p++ = 0x81; *p++ = inside_len; break; case 3: *p++ = 0x82; *p++ = inside_len >> 8; *p++ = inside_len; break; case 4: *p++ = 0x83; *p++ = inside_len >> 16; *p++ = inside_len >> 8; *p++ = inside_len; break; case 5: *p++ = 0x84; *p++ = inside_len >> 24; *p++ = inside_len >> 16; *p++ = inside_len >> 8; *p++ = inside_len; break; } *p++ = 0x06; *p++ = oid->length; bcopy(oid->elements, p, oid->length); p += oid->length; p[0] = tok_id[0]; p[1] = tok_id[1]; *mp = m; return (p); } /* * Verify a token, checking the inner token length and mechanism oid. * pointer to the first byte of the TOK_ID. The length of the * encapsulated data is checked to be at least len bytes; the actual * length of the encapsulated data (including TOK_ID) is returned in * *encap_len. * * If can_pullup is TRUE and the token header is fragmented, we will * rearrange it. * * Format is as follows: * * 0x60 [APPLICATION 0] SEQUENCE * DER encoded length length of oid + type + inner token length * 0x06 NN OID of mechanism type * TT TT TOK_ID * data for inner token * * 1: der encoded length */ static void * krb5_verify_token(char tok_id[2], size_t len, struct mbuf **mp, size_t *encap_len, bool_t can_pullup) { struct mbuf *m; size_t tlen, hlen, len_len, inside_len; gss_OID oid = &krb5_mech_oid; uint8_t *p; m = *mp; tlen = m_length(m, NULL); if (tlen < 2) return (NULL); /* * Ensure that at least the framing part of the token is * contigous. */ if (m->m_len < 2) { if (can_pullup) *mp = m = m_pullup(m, 2); else return (NULL); } p = m->m_data; if (*p++ != 0x60) return (NULL); if (*p < 0x80) { inside_len = *p++; len_len = 1; } else { /* * Ensure there is enough space for the DER encoded length. */ len_len = (*p & 0x7f) + 1; if (tlen < len_len + 1) return (NULL); if (m->m_len < len_len + 1) { if (can_pullup) *mp = m = m_pullup(m, len_len + 1); else return (NULL); p = m->m_data + 1; } switch (*p++) { case 0x81: inside_len = *p++; break; case 0x82: inside_len = (p[0] << 8) | p[1]; p += 2; break; case 0x83: inside_len = (p[0] << 16) | (p[1] << 8) | p[2]; p += 3; break; case 0x84: inside_len = (p[0] << 24) | (p[1] << 16) | (p[2] << 8) | p[3]; p += 4; break; default: return (NULL); } } if (tlen != inside_len + len_len + 1) return (NULL); if (inside_len < 2 + oid->length + len) return (NULL); /* * Now that we know the value of len_len, we can pullup the * whole header. The header is 1 + len_len + 2 + oid->length + * len bytes. */ hlen = 1 + len_len + 2 + oid->length + len; if (m->m_len < hlen) { if (can_pullup) *mp = m = m_pullup(m, hlen); else return (NULL); p = m->m_data + 1 + len_len; } if (*p++ != 0x06) return (NULL); if (*p++ != oid->length) return (NULL); if (bcmp(oid->elements, p, oid->length)) return (NULL); p += oid->length; if (p[0] != tok_id[0]) return (NULL); if (p[1] != tok_id[1]) return (NULL); *encap_len = inside_len - 2 - oid->length; return (p); } static void krb5_insert_seq(struct krb5_msg_order *mo, uint32_t seq, int index) { int i; if (mo->km_length < mo->km_jitter_window) mo->km_length++; for (i = mo->km_length - 1; i > index; i--) mo->km_elem[i] = mo->km_elem[i - 1]; mo->km_elem[index] = seq; } /* * Check sequence numbers according to RFC 2743 section 1.2.3. */ static OM_uint32 krb5_sequence_check(struct krb5_context *kc, uint32_t seq) { OM_uint32 res = GSS_S_FAILURE; struct krb5_msg_order *mo = &kc->kc_msg_order; int check_sequence = mo->km_flags & GSS_C_SEQUENCE_FLAG; int check_replay = mo->km_flags & GSS_C_REPLAY_FLAG; int i; mtx_lock(&kc->kc_lock); /* * Message is in-sequence with no gap. */ if (mo->km_length == 0 || seq == mo->km_elem[0] + 1) { /* * This message is received in-sequence with no gaps. */ krb5_insert_seq(mo, seq, 0); res = GSS_S_COMPLETE; goto out; } if (seq > mo->km_elem[0]) { /* * This message is received in-sequence with a gap. */ krb5_insert_seq(mo, seq, 0); if (check_sequence) res = GSS_S_GAP_TOKEN; else res = GSS_S_COMPLETE; goto out; } if (seq < mo->km_elem[mo->km_length - 1]) { if (check_replay && !check_sequence) res = GSS_S_OLD_TOKEN; else res = GSS_S_UNSEQ_TOKEN; goto out; } for (i = 0; i < mo->km_length; i++) { if (mo->km_elem[i] == seq) { res = GSS_S_DUPLICATE_TOKEN; goto out; } if (mo->km_elem[i] < seq) { /* * We need to insert this seq here, */ krb5_insert_seq(mo, seq, i); if (check_replay && !check_sequence) res = GSS_S_COMPLETE; else res = GSS_S_UNSEQ_TOKEN; goto out; } } out: mtx_unlock(&kc->kc_lock); return (res); } static uint8_t sgn_alg_des_md5[] = { 0x00, 0x00 }; static uint8_t seal_alg_des[] = { 0x00, 0x00 }; static uint8_t sgn_alg_des3_sha1[] = { 0x04, 0x00 }; static uint8_t seal_alg_des3[] = { 0x02, 0x00 }; static uint8_t seal_alg_rc4[] = { 0x10, 0x00 }; static uint8_t sgn_alg_hmac_md5[] = { 0x11, 0x00 }; /* * Return the size of the inner token given the use of the key's * encryption class. For wrap tokens, the length of the padded * plaintext will be added to this. */ static size_t token_length(struct krb5_key_state *key) { return (16 + key->ks_class->ec_checksumlen); } static OM_uint32 krb5_get_mic_old(struct krb5_context *kc, struct mbuf *m, struct mbuf **micp, uint8_t sgn_alg[2]) { struct mbuf *mlast, *mic, *tm; uint8_t *p, dir; size_t tlen, mlen, cklen; uint32_t seq; char buf[8]; mlen = m_length(m, &mlast); tlen = token_length(kc->kc_tokenkey); p = krb5_make_token("\x01\x01", tlen, tlen, &mic); p += 2; /* TOK_ID */ *p++ = sgn_alg[0]; /* SGN_ALG */ *p++ = sgn_alg[1]; *p++ = 0xff; /* filler */ *p++ = 0xff; *p++ = 0xff; *p++ = 0xff; /* * SGN_CKSUM: * * Calculate the keyed checksum of the token header plus the * message. */ cklen = kc->kc_checksumkey->ks_class->ec_checksumlen; mic->m_len = p - (uint8_t *) mic->m_data; mic->m_next = m; MGET(tm, M_WAITOK, MT_DATA); tm->m_len = cklen; mlast->m_next = tm; krb5_checksum(kc->kc_checksumkey, 15, mic, mic->m_len - 8, 8 + mlen, cklen); bcopy(tm->m_data, p + 8, cklen); mic->m_next = NULL; mlast->m_next = NULL; m_free(tm); - + /* * SND_SEQ: * * Take the four bytes of the sequence number least * significant first followed by four bytes of direction * marker (zero for initiator and 0xff for acceptor). Encrypt * that data using the SGN_CKSUM as IV. Note: ARC4 wants the * sequence number big-endian. */ seq = atomic_fetchadd_32(&kc->kc_local_seqnumber, 1); if (sgn_alg[0] == 0x11) { p[0] = (seq >> 24); p[1] = (seq >> 16); p[2] = (seq >> 8); p[3] = (seq >> 0); } else { p[0] = (seq >> 0); p[1] = (seq >> 8); p[2] = (seq >> 16); p[3] = (seq >> 24); } if (is_initiator(kc)) { dir = 0; } else { dir = 0xff; } p[4] = dir; p[5] = dir; p[6] = dir; p[7] = dir; bcopy(p + 8, buf, 8); /* * Set the mic buffer to its final size so that the encrypt * can see the SND_SEQ part. */ mic->m_len += 8 + cklen; krb5_encrypt(kc->kc_tokenkey, mic, mic->m_len - cklen - 8, 8, buf, 8); *micp = mic; return (GSS_S_COMPLETE); } static OM_uint32 krb5_get_mic_new(struct krb5_context *kc, struct mbuf *m, struct mbuf **micp) { struct krb5_key_state *key = kc->kc_send_sign_Kc; struct mbuf *mlast, *mic; uint8_t *p; int flags; size_t mlen, cklen; uint32_t seq; mlen = m_length(m, &mlast); cklen = key->ks_class->ec_checksumlen; KASSERT(16 + cklen <= MLEN, ("checksum too large for an mbuf")); MGET(mic, M_WAITOK, MT_DATA); M_ALIGN(mic, 16 + cklen); mic->m_len = 16 + cklen; p = mic->m_data; /* TOK_ID */ p[0] = 0x04; p[1] = 0x04; /* Flags */ flags = 0; if (is_acceptor(kc)) flags |= GSS_TOKEN_SENT_BY_ACCEPTOR; if (kc->kc_more_flags & ACCEPTOR_SUBKEY) flags |= GSS_TOKEN_ACCEPTOR_SUBKEY; p[2] = flags; /* Filler */ p[3] = 0xff; p[4] = 0xff; p[5] = 0xff; p[6] = 0xff; p[7] = 0xff; /* SND_SEQ */ p[8] = 0; p[9] = 0; p[10] = 0; p[11] = 0; seq = atomic_fetchadd_32(&kc->kc_local_seqnumber, 1); p[12] = (seq >> 24); p[13] = (seq >> 16); p[14] = (seq >> 8); p[15] = (seq >> 0); /* * SGN_CKSUM: * * Calculate the keyed checksum of the message plus the first * 16 bytes of the token header. */ mlast->m_next = mic; krb5_checksum(key, 0, m, 0, mlen + 16, cklen); mlast->m_next = NULL; *micp = mic; return (GSS_S_COMPLETE); } static OM_uint32 krb5_get_mic(gss_ctx_id_t ctx, OM_uint32 *minor_status, gss_qop_t qop_req, struct mbuf *m, struct mbuf **micp) { struct krb5_context *kc = (struct krb5_context *)ctx; *minor_status = 0; if (qop_req != GSS_C_QOP_DEFAULT) return (GSS_S_BAD_QOP); if (time_uptime > kc->kc_lifetime) return (GSS_S_CONTEXT_EXPIRED); switch (kc->kc_tokenkey->ks_class->ec_type) { case ETYPE_DES_CBC_CRC: return (krb5_get_mic_old(kc, m, micp, sgn_alg_des_md5)); case ETYPE_DES3_CBC_SHA1: return (krb5_get_mic_old(kc, m, micp, sgn_alg_des3_sha1)); case ETYPE_ARCFOUR_HMAC_MD5: case ETYPE_ARCFOUR_HMAC_MD5_56: return (krb5_get_mic_old(kc, m, micp, sgn_alg_hmac_md5)); default: return (krb5_get_mic_new(kc, m, micp)); } return (GSS_S_FAILURE); } static OM_uint32 krb5_verify_mic_old(struct krb5_context *kc, struct mbuf *m, struct mbuf *mic, uint8_t sgn_alg[2]) { struct mbuf *mlast, *tm; uint8_t *p, *tp, dir; size_t mlen, tlen, elen, miclen; size_t cklen; uint32_t seq; mlen = m_length(m, &mlast); tlen = token_length(kc->kc_tokenkey); p = krb5_verify_token("\x01\x01", tlen, &mic, &elen, FALSE); if (!p) return (GSS_S_DEFECTIVE_TOKEN); #if 0 /* * Disable this check - heimdal-1.1 generates DES3 MIC tokens * that are 2 bytes too big. */ if (elen != tlen) return (GSS_S_DEFECTIVE_TOKEN); #endif /* TOK_ID */ p += 2; /* SGN_ALG */ if (p[0] != sgn_alg[0] || p[1] != sgn_alg[1]) return (GSS_S_DEFECTIVE_TOKEN); p += 2; if (p[0] != 0xff || p[1] != 0xff || p[2] != 0xff || p[3] != 0xff) return (GSS_S_DEFECTIVE_TOKEN); p += 4; /* * SGN_CKSUM: * * Calculate the keyed checksum of the token header plus the * message. */ cklen = kc->kc_checksumkey->ks_class->ec_checksumlen; miclen = mic->m_len; mic->m_len = p - (uint8_t *) mic->m_data; mic->m_next = m; MGET(tm, M_WAITOK, MT_DATA); tm->m_len = cklen; mlast->m_next = tm; krb5_checksum(kc->kc_checksumkey, 15, mic, mic->m_len - 8, 8 + mlen, cklen); mic->m_next = NULL; mlast->m_next = NULL; if (bcmp(tm->m_data, p + 8, cklen)) { m_free(tm); return (GSS_S_BAD_SIG); } /* * SND_SEQ: * * Take the four bytes of the sequence number least * significant first followed by four bytes of direction * marker (zero for initiator and 0xff for acceptor). Encrypt * that data using the SGN_CKSUM as IV. Note: ARC4 wants the * sequence number big-endian. */ bcopy(p, tm->m_data, 8); tm->m_len = 8; krb5_decrypt(kc->kc_tokenkey, tm, 0, 8, p + 8, 8); tp = tm->m_data; if (sgn_alg[0] == 0x11) { seq = tp[3] | (tp[2] << 8) | (tp[1] << 16) | (tp[0] << 24); } else { seq = tp[0] | (tp[1] << 8) | (tp[2] << 16) | (tp[3] << 24); } if (is_initiator(kc)) { dir = 0xff; } else { dir = 0; } if (tp[4] != dir || tp[5] != dir || tp[6] != dir || tp[7] != dir) { m_free(tm); return (GSS_S_DEFECTIVE_TOKEN); } m_free(tm); if (kc->kc_msg_order.km_flags & (GSS_C_REPLAY_FLAG | GSS_C_SEQUENCE_FLAG)) { return (krb5_sequence_check(kc, seq)); } return (GSS_S_COMPLETE); } static OM_uint32 krb5_verify_mic_new(struct krb5_context *kc, struct mbuf *m, struct mbuf *mic) { OM_uint32 res; struct krb5_key_state *key = kc->kc_recv_sign_Kc; struct mbuf *mlast; uint8_t *p; int flags; size_t mlen, cklen; char buf[32]; mlen = m_length(m, &mlast); cklen = key->ks_class->ec_checksumlen; KASSERT(mic->m_next == NULL, ("MIC should be contiguous")); if (mic->m_len != 16 + cklen) return (GSS_S_DEFECTIVE_TOKEN); p = mic->m_data; /* TOK_ID */ if (p[0] != 0x04) return (GSS_S_DEFECTIVE_TOKEN); if (p[1] != 0x04) return (GSS_S_DEFECTIVE_TOKEN); /* Flags */ flags = 0; if (is_initiator(kc)) flags |= GSS_TOKEN_SENT_BY_ACCEPTOR; if (kc->kc_more_flags & ACCEPTOR_SUBKEY) flags |= GSS_TOKEN_ACCEPTOR_SUBKEY; if (p[2] != flags) return (GSS_S_DEFECTIVE_TOKEN); /* Filler */ if (p[3] != 0xff) return (GSS_S_DEFECTIVE_TOKEN); if (p[4] != 0xff) return (GSS_S_DEFECTIVE_TOKEN); if (p[5] != 0xff) return (GSS_S_DEFECTIVE_TOKEN); if (p[6] != 0xff) return (GSS_S_DEFECTIVE_TOKEN); if (p[7] != 0xff) return (GSS_S_DEFECTIVE_TOKEN); /* SND_SEQ */ if (kc->kc_msg_order.km_flags & (GSS_C_REPLAY_FLAG | GSS_C_SEQUENCE_FLAG)) { uint32_t seq; if (p[8] || p[9] || p[10] || p[11]) { res = GSS_S_UNSEQ_TOKEN; } else { seq = (p[12] << 24) | (p[13] << 16) | (p[14] << 8) | p[15]; res = krb5_sequence_check(kc, seq); } if (GSS_ERROR(res)) return (res); } else { res = GSS_S_COMPLETE; } /* * SGN_CKSUM: * * Calculate the keyed checksum of the message plus the first * 16 bytes of the token header. */ m_copydata(mic, 16, cklen, buf); mlast->m_next = mic; krb5_checksum(key, 0, m, 0, mlen + 16, cklen); mlast->m_next = NULL; if (bcmp(buf, p + 16, cklen)) { return (GSS_S_BAD_SIG); } return (GSS_S_COMPLETE); } static OM_uint32 krb5_verify_mic(gss_ctx_id_t ctx, OM_uint32 *minor_status, struct mbuf *m, struct mbuf *mic, gss_qop_t *qop_state) { struct krb5_context *kc = (struct krb5_context *)ctx; *minor_status = 0; if (qop_state) *qop_state = GSS_C_QOP_DEFAULT; if (time_uptime > kc->kc_lifetime) return (GSS_S_CONTEXT_EXPIRED); switch (kc->kc_tokenkey->ks_class->ec_type) { case ETYPE_DES_CBC_CRC: return (krb5_verify_mic_old(kc, m, mic, sgn_alg_des_md5)); case ETYPE_ARCFOUR_HMAC_MD5: case ETYPE_ARCFOUR_HMAC_MD5_56: return (krb5_verify_mic_old(kc, m, mic, sgn_alg_hmac_md5)); case ETYPE_DES3_CBC_SHA1: return (krb5_verify_mic_old(kc, m, mic, sgn_alg_des3_sha1)); default: return (krb5_verify_mic_new(kc, m, mic)); } return (GSS_S_FAILURE); } static OM_uint32 krb5_wrap_old(struct krb5_context *kc, int conf_req_flag, struct mbuf **mp, int *conf_state, uint8_t sgn_alg[2], uint8_t seal_alg[2]) { struct mbuf *m, *mlast, *tm, *cm, *pm; size_t mlen, tlen, padlen, datalen; uint8_t *p, dir; size_t cklen; uint8_t buf[8]; uint32_t seq; /* * How many trailing pad bytes do we need? */ m = *mp; mlen = m_length(m, &mlast); tlen = kc->kc_tokenkey->ks_class->ec_msgblocklen; padlen = tlen - (mlen % tlen); /* * The data part of the token has eight bytes of random * confounder prepended and followed by up to eight bytes of * padding bytes each of which is set to the number of padding * bytes. */ datalen = mlen + 8 + padlen; tlen = token_length(kc->kc_tokenkey); p = krb5_make_token("\x02\x01", tlen, datalen + tlen, &tm); p += 2; /* TOK_ID */ *p++ = sgn_alg[0]; /* SGN_ALG */ *p++ = sgn_alg[1]; if (conf_req_flag) { *p++ = seal_alg[0]; /* SEAL_ALG */ *p++ = seal_alg[1]; } else { *p++ = 0xff; /* SEAL_ALG = none */ *p++ = 0xff; } *p++ = 0xff; /* filler */ *p++ = 0xff; /* * Copy the padded message data. */ if (M_LEADINGSPACE(m) >= 8) { m->m_data -= 8; m->m_len += 8; } else { MGET(cm, M_WAITOK, MT_DATA); cm->m_len = 8; cm->m_next = m; m = cm; } arc4rand(m->m_data, 8, 0); if (M_TRAILINGSPACE(mlast) >= padlen) { memset(mlast->m_data + mlast->m_len, padlen, padlen); mlast->m_len += padlen; } else { MGET(pm, M_WAITOK, MT_DATA); memset(pm->m_data, padlen, padlen); pm->m_len = padlen; mlast->m_next = pm; mlast = pm; } tm->m_next = m; /* * SGN_CKSUM: * * Calculate the keyed checksum of the token header plus the * padded message. Fiddle with tm->m_len so that we only * checksum the 8 bytes of head that we care about. */ cklen = kc->kc_checksumkey->ks_class->ec_checksumlen; tlen = tm->m_len; tm->m_len = p - (uint8_t *) tm->m_data; MGET(cm, M_WAITOK, MT_DATA); cm->m_len = cklen; mlast->m_next = cm; krb5_checksum(kc->kc_checksumkey, 13, tm, tm->m_len - 8, datalen + 8, cklen); tm->m_len = tlen; mlast->m_next = NULL; bcopy(cm->m_data, p + 8, cklen); m_free(cm); /* * SND_SEQ: * * Take the four bytes of the sequence number least * significant first (most significant first for ARCFOUR) * followed by four bytes of direction marker (zero for * initiator and 0xff for acceptor). Encrypt that data using * the SGN_CKSUM as IV. */ seq = atomic_fetchadd_32(&kc->kc_local_seqnumber, 1); if (sgn_alg[0] == 0x11) { p[0] = (seq >> 24); p[1] = (seq >> 16); p[2] = (seq >> 8); p[3] = (seq >> 0); } else { p[0] = (seq >> 0); p[1] = (seq >> 8); p[2] = (seq >> 16); p[3] = (seq >> 24); } if (is_initiator(kc)) { dir = 0; } else { dir = 0xff; } p[4] = dir; p[5] = dir; p[6] = dir; p[7] = dir; krb5_encrypt(kc->kc_tokenkey, tm, p - (uint8_t *) tm->m_data, 8, p + 8, 8); if (conf_req_flag) { /* * Encrypt the padded message with an IV of zero for * DES and DES3, or an IV of the sequence number in * big-endian format for ARCFOUR. */ if (seal_alg[0] == 0x10) { buf[0] = (seq >> 24); buf[1] = (seq >> 16); buf[2] = (seq >> 8); buf[3] = (seq >> 0); krb5_encrypt(kc->kc_encryptkey, m, 0, datalen, buf, 4); } else { krb5_encrypt(kc->kc_encryptkey, m, 0, datalen, NULL, 0); } } if (conf_state) *conf_state = conf_req_flag; *mp = tm; return (GSS_S_COMPLETE); } static OM_uint32 krb5_wrap_new(struct krb5_context *kc, int conf_req_flag, struct mbuf **mp, int *conf_state) { struct krb5_key_state *Ke = kc->kc_send_seal_Ke; struct krb5_key_state *Ki = kc->kc_send_seal_Ki; struct krb5_key_state *Kc = kc->kc_send_seal_Kc; const struct krb5_encryption_class *ec = Ke->ks_class; struct mbuf *m, *mlast, *tm; uint8_t *p; int flags, EC; size_t mlen, blen, mblen, cklen, ctlen; uint32_t seq; static char zpad[32]; m = *mp; mlen = m_length(m, &mlast); blen = ec->ec_blocklen; mblen = ec->ec_msgblocklen; cklen = ec->ec_checksumlen; if (conf_req_flag) { /* * For sealed messages, we need space for 16 bytes of * header, blen confounder, plaintext, padding, copy * of header and checksum. * * We pad to mblen (which may be different from * blen). If the encryption class is using CTS, mblen * will be one (i.e. no padding required). */ if (mblen > 1) EC = mlen % mblen; else EC = 0; ctlen = blen + mlen + EC + 16; /* * Put initial header and confounder before the * message. */ M_PREPEND(m, 16 + blen, M_WAITOK); /* * Append padding + copy of header and checksum. Try * to fit this into the end of the original message, * otherwise allocate a trailer. */ if (M_TRAILINGSPACE(mlast) >= EC + 16 + cklen) { tm = NULL; mlast->m_len += EC + 16 + cklen; } else { MGET(tm, M_WAITOK, MT_DATA); tm->m_len = EC + 16 + cklen; mlast->m_next = tm; } } else { /* * For unsealed messages, we need 16 bytes of header * plus space for the plaintext and a checksum. EC is * set to the checksum size. We leave space in tm for * a copy of the header - this will be trimmed later. */ M_PREPEND(m, 16, M_WAITOK); MGET(tm, M_WAITOK, MT_DATA); tm->m_len = cklen + 16; mlast->m_next = tm; ctlen = 0; EC = cklen; } p = m->m_data; /* TOK_ID */ p[0] = 0x05; p[1] = 0x04; /* Flags */ flags = 0; if (conf_req_flag) flags = GSS_TOKEN_SEALED; if (is_acceptor(kc)) flags |= GSS_TOKEN_SENT_BY_ACCEPTOR; if (kc->kc_more_flags & ACCEPTOR_SUBKEY) flags |= GSS_TOKEN_ACCEPTOR_SUBKEY; p[2] = flags; /* Filler */ p[3] = 0xff; /* EC + RRC - set to zero initially */ p[4] = 0; p[5] = 0; p[6] = 0; p[7] = 0; /* SND_SEQ */ p[8] = 0; p[9] = 0; p[10] = 0; p[11] = 0; seq = atomic_fetchadd_32(&kc->kc_local_seqnumber, 1); p[12] = (seq >> 24); p[13] = (seq >> 16); p[14] = (seq >> 8); p[15] = (seq >> 0); if (conf_req_flag) { /* * Encrypt according to RFC 4121 section 4.2 and RFC * 3961 section 5.3. Note: we don't generate tokens * with RRC values other than zero. If we did, we * should zero RRC in the copied header. */ arc4rand(p + 16, blen, 0); if (EC) { m_copyback(m, 16 + blen + mlen, EC, zpad); } m_copyback(m, 16 + blen + mlen + EC, 16, p); krb5_checksum(Ki, 0, m, 16, ctlen, cklen); krb5_encrypt(Ke, m, 16, ctlen, NULL, 0); } else { /* * The plaintext message is followed by a checksum of * the plaintext plus a version of the header where EC * and RRC are set to zero. Also, the original EC must * be our checksum size. */ bcopy(p, tm->m_data, 16); krb5_checksum(Kc, 0, m, 16, mlen + 16, cklen); tm->m_data += 16; tm->m_len -= 16; } /* * Finally set EC to its actual value */ p[4] = EC >> 8; p[5] = EC; *mp = m; return (GSS_S_COMPLETE); } static OM_uint32 krb5_wrap(gss_ctx_id_t ctx, OM_uint32 *minor_status, int conf_req_flag, gss_qop_t qop_req, struct mbuf **mp, int *conf_state) { struct krb5_context *kc = (struct krb5_context *)ctx; *minor_status = 0; if (conf_state) *conf_state = 0; if (qop_req != GSS_C_QOP_DEFAULT) return (GSS_S_BAD_QOP); if (time_uptime > kc->kc_lifetime) return (GSS_S_CONTEXT_EXPIRED); switch (kc->kc_tokenkey->ks_class->ec_type) { case ETYPE_DES_CBC_CRC: return (krb5_wrap_old(kc, conf_req_flag, mp, conf_state, sgn_alg_des_md5, seal_alg_des)); case ETYPE_ARCFOUR_HMAC_MD5: case ETYPE_ARCFOUR_HMAC_MD5_56: return (krb5_wrap_old(kc, conf_req_flag, mp, conf_state, sgn_alg_hmac_md5, seal_alg_rc4)); case ETYPE_DES3_CBC_SHA1: return (krb5_wrap_old(kc, conf_req_flag, mp, conf_state, sgn_alg_des3_sha1, seal_alg_des3)); default: return (krb5_wrap_new(kc, conf_req_flag, mp, conf_state)); } return (GSS_S_FAILURE); } static void m_trim(struct mbuf *m, int len) { struct mbuf *n; int off; if (m == NULL) return; n = m_getptr(m, len, &off); if (n) { n->m_len = off; if (n->m_next) { m_freem(n->m_next); n->m_next = NULL; } } } static OM_uint32 krb5_unwrap_old(struct krb5_context *kc, struct mbuf **mp, int *conf_state, uint8_t sgn_alg[2], uint8_t seal_alg[2]) { OM_uint32 res; struct mbuf *m, *mlast, *hm, *cm, *n; uint8_t *p, dir; size_t mlen, tlen, elen, datalen, padlen; size_t cklen; uint8_t buf[32]; uint32_t seq; int i, conf; m = *mp; mlen = m_length(m, &mlast); tlen = token_length(kc->kc_tokenkey); cklen = kc->kc_tokenkey->ks_class->ec_checksumlen; p = krb5_verify_token("\x02\x01", tlen, &m, &elen, TRUE); *mp = m; if (!p) return (GSS_S_DEFECTIVE_TOKEN); datalen = elen - tlen; /* * Trim the framing header first to make life a little easier * later. */ m_adj(m, p - (uint8_t *) m->m_data); /* TOK_ID */ p += 2; /* SGN_ALG */ if (p[0] != sgn_alg[0] || p[1] != sgn_alg[1]) return (GSS_S_DEFECTIVE_TOKEN); p += 2; /* SEAL_ALG */ if (p[0] == seal_alg[0] && p[1] == seal_alg[1]) conf = 1; else if (p[0] == 0xff && p[1] == 0xff) conf = 0; else return (GSS_S_DEFECTIVE_TOKEN); p += 2; if (p[0] != 0xff || p[1] != 0xff) return (GSS_S_DEFECTIVE_TOKEN); p += 2; /* * SND_SEQ: * * Take the four bytes of the sequence number least * significant first (most significant for ARCFOUR) followed * by four bytes of direction marker (zero for initiator and * 0xff for acceptor). Encrypt that data using the SGN_CKSUM * as IV. */ krb5_decrypt(kc->kc_tokenkey, m, 8, 8, p + 8, 8); if (sgn_alg[0] == 0x11) { seq = p[3] | (p[2] << 8) | (p[1] << 16) | (p[0] << 24); } else { seq = p[0] | (p[1] << 8) | (p[2] << 16) | (p[3] << 24); } if (is_initiator(kc)) { dir = 0xff; } else { dir = 0; } if (p[4] != dir || p[5] != dir || p[6] != dir || p[7] != dir) return (GSS_S_DEFECTIVE_TOKEN); if (kc->kc_msg_order.km_flags & (GSS_C_REPLAY_FLAG | GSS_C_SEQUENCE_FLAG)) { res = krb5_sequence_check(kc, seq); if (GSS_ERROR(res)) return (res); } else { res = GSS_S_COMPLETE; } /* * If the token was encrypted, decode it in-place. */ if (conf) { /* * Decrypt the padded message with an IV of zero for * DES and DES3 or an IV of the big-endian encoded * sequence number for ARCFOUR. */ if (seal_alg[0] == 0x10) { krb5_decrypt(kc->kc_encryptkey, m, 16 + cklen, datalen, p, 4); } else { krb5_decrypt(kc->kc_encryptkey, m, 16 + cklen, datalen, NULL, 0); } } if (conf_state) *conf_state = conf; /* * Check the trailing pad bytes. * RFC1964 specifies between 1<->8 bytes, each with a binary value * equal to the number of bytes. */ if (mlast->m_len > 0) padlen = mlast->m_data[mlast->m_len - 1]; else { n = m_getptr(m, tlen + datalen - 1, &i); /* * When the position is exactly equal to the # of data bytes * in the mbuf list, m_getptr() will return the last mbuf in * the list and an off == m_len for that mbuf, so that case * needs to be checked as well as a NULL return. */ if (n == NULL || n->m_len == i) return (GSS_S_DEFECTIVE_TOKEN); padlen = n->m_data[i]; } if (padlen < 1 || padlen > 8 || padlen > tlen + datalen) return (GSS_S_DEFECTIVE_TOKEN); m_copydata(m, tlen + datalen - padlen, padlen, buf); for (i = 0; i < padlen; i++) { if (buf[i] != padlen) { return (GSS_S_DEFECTIVE_TOKEN); } } /* * SGN_CKSUM: * * Calculate the keyed checksum of the token header plus the * padded message. We do a little mbuf surgery to trim out the * parts we don't want to checksum. */ hm = m; *mp = m = m_split(m, 16 + cklen, M_WAITOK); mlast = m_last(m); hm->m_len = 8; hm->m_next = m; MGET(cm, M_WAITOK, MT_DATA); cm->m_len = cklen; mlast->m_next = cm; krb5_checksum(kc->kc_checksumkey, 13, hm, 0, datalen + 8, cklen); hm->m_next = NULL; mlast->m_next = NULL; if (bcmp(cm->m_data, hm->m_data + 16, cklen)) { m_freem(hm); m_free(cm); return (GSS_S_BAD_SIG); } m_freem(hm); m_free(cm); /* * Trim off the confounder and padding. */ m_adj(m, 8); if (mlast->m_len >= padlen) { mlast->m_len -= padlen; } else { m_trim(m, datalen - 8 - padlen); } *mp = m; return (res); } static OM_uint32 krb5_unwrap_new(struct krb5_context *kc, struct mbuf **mp, int *conf_state) { OM_uint32 res; struct krb5_key_state *Ke = kc->kc_recv_seal_Ke; struct krb5_key_state *Ki = kc->kc_recv_seal_Ki; struct krb5_key_state *Kc = kc->kc_recv_seal_Kc; const struct krb5_encryption_class *ec = Ke->ks_class; struct mbuf *m, *mlast, *hm, *cm; uint8_t *p, *pp; int sealed, flags, EC, RRC; size_t blen, cklen, ctlen, mlen, plen, tlen; char buf[32], buf2[32]; m = *mp; mlen = m_length(m, &mlast); if (mlen <= 16) return (GSS_S_DEFECTIVE_TOKEN); if (m->m_len < 16) { m = m_pullup(m, 16); *mp = m; } p = m->m_data; /* TOK_ID */ if (p[0] != 0x05) return (GSS_S_DEFECTIVE_TOKEN); if (p[1] != 0x04) return (GSS_S_DEFECTIVE_TOKEN); /* Flags */ sealed = p[2] & GSS_TOKEN_SEALED; flags = sealed; if (is_initiator(kc)) flags |= GSS_TOKEN_SENT_BY_ACCEPTOR; if (kc->kc_more_flags & ACCEPTOR_SUBKEY) flags |= GSS_TOKEN_ACCEPTOR_SUBKEY; if (p[2] != flags) return (GSS_S_DEFECTIVE_TOKEN); /* Filler */ if (p[3] != 0xff) return (GSS_S_DEFECTIVE_TOKEN); /* EC + RRC */ EC = (p[4] << 8) + p[5]; RRC = (p[6] << 8) + p[7]; /* SND_SEQ */ if (kc->kc_msg_order.km_flags & (GSS_C_REPLAY_FLAG | GSS_C_SEQUENCE_FLAG)) { uint32_t seq; if (p[8] || p[9] || p[10] || p[11]) { res = GSS_S_UNSEQ_TOKEN; } else { seq = (p[12] << 24) | (p[13] << 16) | (p[14] << 8) | p[15]; res = krb5_sequence_check(kc, seq); } if (GSS_ERROR(res)) return (res); } else { res = GSS_S_COMPLETE; } /* * Separate the header before dealing with RRC. We only need * to keep the header if the message isn't encrypted. */ if (sealed) { hm = NULL; m_adj(m, 16); } else { hm = m; *mp = m = m_split(m, 16, M_WAITOK); mlast = m_last(m); } /* * Undo the effects of RRC by rotating left. */ if (RRC > 0) { struct mbuf *rm; size_t rlen; rlen = mlen - 16; if (RRC <= sizeof(buf) && m->m_len >= rlen) { /* * Simple case, just rearrange the bytes in m. */ bcopy(m->m_data, buf, RRC); bcopy(m->m_data + RRC, m->m_data, rlen - RRC); bcopy(buf, m->m_data + rlen - RRC, RRC); } else { /* * More complicated - rearrange the mbuf * chain. */ rm = m; *mp = m = m_split(m, RRC, M_WAITOK); m_cat(m, rm); mlast = rm; } } blen = ec->ec_blocklen; cklen = ec->ec_checksumlen; if (sealed) { /* * Decrypt according to RFC 4121 section 4.2 and RFC * 3961 section 5.3. The message must be large enough * for a blocksize confounder, at least one block of * cyphertext and a checksum. */ if (mlen < 16 + 2*blen + cklen) return (GSS_S_DEFECTIVE_TOKEN); ctlen = mlen - 16 - cklen; krb5_decrypt(Ke, m, 0, ctlen, NULL, 0); /* * The size of the plaintext is ctlen minus blocklen * (for the confounder), 16 (for the copy of the token * header) and EC (for the filler). The actual * plaintext starts after the confounder. */ plen = ctlen - blen - 16 - EC; pp = p + 16 + blen; /* * Checksum the padded plaintext. */ m_copydata(m, ctlen, cklen, buf); krb5_checksum(Ki, 0, m, 0, ctlen, cklen); m_copydata(m, ctlen, cklen, buf2); if (bcmp(buf, buf2, cklen)) return (GSS_S_BAD_SIG); /* * Trim the message back to just plaintext. */ m_adj(m, blen); tlen = 16 + EC + cklen; if (mlast->m_len >= tlen) { mlast->m_len -= tlen; } else { m_trim(m, plen); } } else { /* * The plaintext message is followed by a checksum of * the plaintext plus a version of the header where EC * and RRC are set to zero. Also, the original EC must * be our checksum size. */ if (mlen < 16 + cklen || EC != cklen) return (GSS_S_DEFECTIVE_TOKEN); /* * The size of the plaintext is simply the message * size less header and checksum. The plaintext starts * right after the header (which we have saved in hm). */ plen = mlen - 16 - cklen; /* * Insert a copy of the header (with EC and RRC set to * zero) between the plaintext message and the * checksum. */ p = hm->m_data; p[4] = p[5] = p[6] = p[7] = 0; cm = m_split(m, plen, M_WAITOK); mlast = m_last(m); m->m_next = hm; hm->m_next = cm; bcopy(cm->m_data, buf, cklen); krb5_checksum(Kc, 0, m, 0, plen + 16, cklen); if (bcmp(cm->m_data, buf, cklen)) return (GSS_S_BAD_SIG); /* * The checksum matches, discard all buf the plaintext. */ mlast->m_next = NULL; m_freem(hm); } if (conf_state) *conf_state = (sealed != 0); return (res); } static OM_uint32 krb5_unwrap(gss_ctx_id_t ctx, OM_uint32 *minor_status, struct mbuf **mp, int *conf_state, gss_qop_t *qop_state) { struct krb5_context *kc = (struct krb5_context *)ctx; OM_uint32 maj_stat; *minor_status = 0; if (qop_state) *qop_state = GSS_C_QOP_DEFAULT; if (conf_state) *conf_state = 0; if (time_uptime > kc->kc_lifetime) return (GSS_S_CONTEXT_EXPIRED); switch (kc->kc_tokenkey->ks_class->ec_type) { case ETYPE_DES_CBC_CRC: maj_stat = krb5_unwrap_old(kc, mp, conf_state, sgn_alg_des_md5, seal_alg_des); break; case ETYPE_ARCFOUR_HMAC_MD5: case ETYPE_ARCFOUR_HMAC_MD5_56: maj_stat = krb5_unwrap_old(kc, mp, conf_state, sgn_alg_hmac_md5, seal_alg_rc4); break; case ETYPE_DES3_CBC_SHA1: maj_stat = krb5_unwrap_old(kc, mp, conf_state, sgn_alg_des3_sha1, seal_alg_des3); break; default: maj_stat = krb5_unwrap_new(kc, mp, conf_state); break; } if (GSS_ERROR(maj_stat)) { m_freem(*mp); *mp = NULL; } return (maj_stat); } static OM_uint32 krb5_wrap_size_limit(gss_ctx_id_t ctx, OM_uint32 *minor_status, int conf_req_flag, gss_qop_t qop_req, OM_uint32 req_output_size, OM_uint32 *max_input_size) { struct krb5_context *kc = (struct krb5_context *)ctx; const struct krb5_encryption_class *ec; OM_uint32 overhead; *minor_status = 0; *max_input_size = 0; if (qop_req != GSS_C_QOP_DEFAULT) return (GSS_S_BAD_QOP); ec = kc->kc_tokenkey->ks_class; switch (ec->ec_type) { case ETYPE_DES_CBC_CRC: case ETYPE_DES3_CBC_SHA1: case ETYPE_ARCFOUR_HMAC_MD5: case ETYPE_ARCFOUR_HMAC_MD5_56: /* * up to 5 bytes for [APPLICATION 0] SEQUENCE * 2 + krb5 oid length * 8 bytes of header * 8 bytes of confounder * maximum of 8 bytes of padding * checksum */ overhead = 5 + 2 + krb5_mech_oid.length; overhead += 8 + 8 + ec->ec_msgblocklen; overhead += ec->ec_checksumlen; break; default: if (conf_req_flag) { /* * 16 byts of header * blocklen bytes of confounder * up to msgblocklen - 1 bytes of padding * 16 bytes for copy of header * checksum */ overhead = 16 + ec->ec_blocklen; overhead += ec->ec_msgblocklen - 1; overhead += 16; overhead += ec->ec_checksumlen; } else { /* * 16 bytes of header plus checksum. */ overhead = 16 + ec->ec_checksumlen; } } *max_input_size = req_output_size - overhead; return (GSS_S_COMPLETE); } static kobj_method_t krb5_methods[] = { KOBJMETHOD(kgss_init, krb5_init), KOBJMETHOD(kgss_import, krb5_import), KOBJMETHOD(kgss_delete, krb5_delete), KOBJMETHOD(kgss_mech_type, krb5_mech_type), KOBJMETHOD(kgss_get_mic, krb5_get_mic), KOBJMETHOD(kgss_verify_mic, krb5_verify_mic), KOBJMETHOD(kgss_wrap, krb5_wrap), KOBJMETHOD(kgss_unwrap, krb5_unwrap), KOBJMETHOD(kgss_wrap_size_limit, krb5_wrap_size_limit), { 0, 0 } }; static struct kobj_class krb5_class = { "kerberosv5", krb5_methods, sizeof(struct krb5_context) }; /* * Kernel module glue */ static int kgssapi_krb5_modevent(module_t mod, int type, void *data) { switch (type) { case MOD_LOAD: kgss_install_mech(&krb5_mech_oid, "kerberosv5", &krb5_class); break; case MOD_UNLOAD: kgss_uninstall_mech(&krb5_mech_oid); break; } - return (0); } static moduledata_t kgssapi_krb5_mod = { "kgssapi_krb5", kgssapi_krb5_modevent, NULL, }; DECLARE_MODULE(kgssapi_krb5, kgssapi_krb5_mod, SI_SUB_VFS, SI_ORDER_ANY); MODULE_DEPEND(kgssapi_krb5, kgssapi, 1, 1, 1); MODULE_DEPEND(kgssapi_krb5, crypto, 1, 1, 1); MODULE_DEPEND(kgssapi_krb5, rc4, 1, 1, 1); MODULE_VERSION(kgssapi_krb5, 1);