
Works for krb5 and SPNEGO mechanisms. Kerberos credentials are passed as credential cache names, or if there are memory based credentials, inband in the protocol. This means that the credentials buffers must be keep secret. As documented by IBM (they have the wrong prototype though) and GGF (GSS-API Extensions) back in 2001
223 lines
5.3 KiB
C
223 lines
5.3 KiB
C
/*
|
|
* Copyright (c) 2009 Kungliga Tekniska Högskolan
|
|
* (Royal Institute of Technology, Stockholm, Sweden).
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* 3. Neither the name of KTH nor the names of its contributors may be
|
|
* used to endorse or promote products derived from this software without
|
|
* specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY KTH AND ITS 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 KTH OR ITS 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 "mech_locl.h"
|
|
#include <krb5.h>
|
|
|
|
/*
|
|
* format: any number of:
|
|
* mech-len: int32
|
|
* mech-data: char * (not alligned)
|
|
* cred-len: int32
|
|
* cred-data char * (not alligned)
|
|
*/
|
|
|
|
OM_uint32 GSSAPI_LIB_FUNCTION
|
|
gss_export_cred(OM_uint32 * minor_status,
|
|
gss_cred_id_t cred_handle,
|
|
gss_buffer_t token)
|
|
{
|
|
struct _gss_cred *cred = (struct _gss_cred *)cred_handle;
|
|
struct _gss_mechanism_cred *mc;
|
|
gss_buffer_desc buffer;
|
|
krb5_error_code ret;
|
|
krb5_storage *sp;
|
|
OM_uint32 major;
|
|
krb5_data data;
|
|
|
|
_mg_buffer_zero(token);
|
|
|
|
if (cred == NULL) {
|
|
*minor_status = 0;
|
|
return GSS_S_NO_CRED;
|
|
}
|
|
|
|
SLIST_FOREACH(mc, &cred->gc_mc, gmc_link) {
|
|
if (mc->gmc_mech->gm_export_cred == NULL) {
|
|
*minor_status = 0;
|
|
return GSS_S_NO_CRED;
|
|
}
|
|
}
|
|
|
|
sp = krb5_storage_emem();
|
|
if (sp == NULL) {
|
|
*minor_status = ENOMEM;
|
|
return GSS_S_FAILURE;
|
|
}
|
|
|
|
SLIST_FOREACH(mc, &cred->gc_mc, gmc_link) {
|
|
|
|
major = mc->gmc_mech->gm_export_cred(minor_status,
|
|
mc->gmc_cred, &buffer);
|
|
if (major) {
|
|
krb5_storage_free(sp);
|
|
return major;
|
|
}
|
|
|
|
ret = krb5_storage_write(sp, buffer.value, buffer.length);
|
|
if (ret != buffer.length) {
|
|
gss_release_buffer(minor_status, &buffer);
|
|
krb5_storage_free(sp);
|
|
*minor_status = EINVAL;
|
|
return GSS_S_FAILURE;
|
|
}
|
|
gss_release_buffer(minor_status, &buffer);
|
|
}
|
|
|
|
ret = krb5_storage_to_data(sp, &data);
|
|
krb5_storage_free(sp);
|
|
if (ret) {
|
|
*minor_status = ret;
|
|
return GSS_S_FAILURE;
|
|
}
|
|
|
|
token->value = data.data;
|
|
token->length = data.length;
|
|
|
|
return GSS_S_COMPLETE;
|
|
}
|
|
|
|
OM_uint32 GSSAPI_LIB_FUNCTION
|
|
gss_import_cred(OM_uint32 * minor_status,
|
|
gss_buffer_t token,
|
|
gss_cred_id_t * cred_handle)
|
|
{
|
|
gssapi_mech_interface m;
|
|
krb5_error_code ret;
|
|
struct _gss_cred *cred;
|
|
krb5_storage *sp;
|
|
OM_uint32 major, junk;
|
|
krb5_data data;
|
|
|
|
*cred_handle = GSS_C_NO_CREDENTIAL;
|
|
|
|
if (token->length == 0) {
|
|
*minor_status = ENOMEM;
|
|
return GSS_S_FAILURE;
|
|
}
|
|
|
|
sp = krb5_storage_from_readonly_mem(token->value, token->length);
|
|
if (sp == NULL) {
|
|
*minor_status = ENOMEM;
|
|
return GSS_S_FAILURE;
|
|
}
|
|
|
|
cred = calloc(1, sizeof(struct _gss_cred));
|
|
if (cred == NULL) {
|
|
krb5_storage_free(sp);
|
|
*minor_status = ENOMEM;
|
|
return GSS_S_FAILURE;
|
|
}
|
|
SLIST_INIT(&cred->gc_mc);
|
|
|
|
*cred_handle = (gss_cred_id_t)cred;
|
|
|
|
while(1) {
|
|
struct _gss_mechanism_cred *mc;
|
|
gss_buffer_desc buffer;
|
|
gss_cred_id_t mcred;
|
|
gss_OID_desc oid;
|
|
|
|
ret = krb5_ret_data(sp, &data);
|
|
if (ret == HEIM_ERR_EOF) {
|
|
break;
|
|
} else if (ret) {
|
|
*minor_status = ret;
|
|
major = GSS_S_FAILURE;
|
|
goto out;
|
|
}
|
|
oid.elements = data.data;
|
|
oid.length = data.length;
|
|
|
|
m = __gss_get_mechanism(&oid);
|
|
krb5_data_free(&data);
|
|
if (!m) {
|
|
*minor_status = 0;
|
|
major = GSS_S_BAD_MECH;
|
|
goto out;
|
|
}
|
|
|
|
if (m->gm_import_cred == NULL) {
|
|
*minor_status = 0;
|
|
major = GSS_S_BAD_MECH;
|
|
goto out;
|
|
}
|
|
|
|
ret = krb5_ret_data(sp, &data);
|
|
if (ret) {
|
|
*minor_status = ret;
|
|
major = GSS_S_FAILURE;
|
|
goto out;
|
|
}
|
|
|
|
buffer.value = data.data;
|
|
buffer.length = data.length;
|
|
|
|
major = m->gm_import_cred(minor_status,
|
|
&buffer, &mcred);
|
|
krb5_data_free(&data);
|
|
if (major) {
|
|
goto out;
|
|
}
|
|
|
|
mc = malloc(sizeof(struct _gss_mechanism_cred));
|
|
if (mc == NULL) {
|
|
*minor_status = EINVAL;
|
|
major = GSS_S_FAILURE;
|
|
goto out;
|
|
}
|
|
|
|
mc->gmc_mech = m;
|
|
mc->gmc_mech_oid = &m->gm_mech_oid;
|
|
mc->gmc_cred = mcred;
|
|
|
|
SLIST_INSERT_HEAD(&cred->gc_mc, mc, gmc_link);
|
|
}
|
|
krb5_storage_free(sp);
|
|
|
|
if (SLIST_EMPTY(&cred->gc_mc)) {
|
|
major = GSS_S_NO_CRED;
|
|
goto out;
|
|
}
|
|
|
|
return GSS_S_COMPLETE;
|
|
|
|
out:
|
|
krb5_storage_free(sp);
|
|
|
|
gss_release_cred(&junk, cred_handle);
|
|
|
|
return major;
|
|
|
|
}
|