2015-01-22 03:40:55 +00:00
|
|
|
/*
|
2018-11-20 13:13:00 +00:00
|
|
|
* Copyright 2005-2018 The OpenSSL Project Authors. All Rights Reserved.
|
2005-04-26 16:02:40 +00:00
|
|
|
*
|
2018-12-06 12:08:51 +00:00
|
|
|
* Licensed under the Apache License 2.0 (the "License"). You may not use
|
2016-05-17 18:18:30 +00:00
|
|
|
* this file except in compliance with the License. You can obtain a copy
|
|
|
|
* in the file LICENSE in the source distribution or at
|
|
|
|
* https://www.openssl.org/source/license.html
|
2005-04-26 16:02:40 +00:00
|
|
|
*/
|
|
|
|
|
2017-08-23 23:05:07 +00:00
|
|
|
#include "e_os.h"
|
2005-04-26 16:02:40 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <openssl/objects.h>
|
2015-09-11 09:48:59 +00:00
|
|
|
#include <openssl/rand.h>
|
2005-04-26 16:02:40 +00:00
|
|
|
#include "ssl_locl.h"
|
|
|
|
|
2009-05-15 22:58:40 +00:00
|
|
|
static void get_current_time(struct timeval *t);
|
2013-03-11 15:34:28 +00:00
|
|
|
static int dtls1_handshake_write(SSL *s);
|
2016-09-07 10:34:39 +00:00
|
|
|
static size_t dtls1_link_min_mtu(void);
|
2005-04-26 16:02:40 +00:00
|
|
|
|
2015-09-11 09:48:59 +00:00
|
|
|
/* XDTLS: figure out the right values */
|
2016-09-07 10:34:39 +00:00
|
|
|
static const size_t g_probable_mtu[] = { 1500, 512, 256 };
|
2015-09-11 09:48:59 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
const SSL3_ENC_METHOD DTLSv1_enc_data = {
|
|
|
|
tls1_enc,
|
|
|
|
tls1_mac,
|
|
|
|
tls1_setup_key_block,
|
|
|
|
tls1_generate_master_secret,
|
|
|
|
tls1_change_cipher_state,
|
|
|
|
tls1_final_finish_mac,
|
|
|
|
TLS_MD_CLIENT_FINISH_CONST, TLS_MD_CLIENT_FINISH_CONST_SIZE,
|
|
|
|
TLS_MD_SERVER_FINISH_CONST, TLS_MD_SERVER_FINISH_CONST_SIZE,
|
|
|
|
tls1_alert_code,
|
|
|
|
tls1_export_keying_material,
|
|
|
|
SSL_ENC_FLAG_DTLS | SSL_ENC_FLAG_EXPLICIT_IV,
|
2016-09-29 21:40:15 +00:00
|
|
|
dtls1_set_handshake_header,
|
2016-08-03 19:57:52 +00:00
|
|
|
dtls1_close_construct_packet,
|
2015-01-22 03:40:55 +00:00
|
|
|
dtls1_handshake_write
|
|
|
|
};
|
|
|
|
|
|
|
|
const SSL3_ENC_METHOD DTLSv1_2_enc_data = {
|
|
|
|
tls1_enc,
|
|
|
|
tls1_mac,
|
|
|
|
tls1_setup_key_block,
|
|
|
|
tls1_generate_master_secret,
|
|
|
|
tls1_change_cipher_state,
|
|
|
|
tls1_final_finish_mac,
|
|
|
|
TLS_MD_CLIENT_FINISH_CONST, TLS_MD_CLIENT_FINISH_CONST_SIZE,
|
|
|
|
TLS_MD_SERVER_FINISH_CONST, TLS_MD_SERVER_FINISH_CONST_SIZE,
|
|
|
|
tls1_alert_code,
|
|
|
|
tls1_export_keying_material,
|
|
|
|
SSL_ENC_FLAG_DTLS | SSL_ENC_FLAG_EXPLICIT_IV | SSL_ENC_FLAG_SIGALGS
|
|
|
|
| SSL_ENC_FLAG_SHA256_PRF | SSL_ENC_FLAG_TLS1_2_CIPHERS,
|
2016-09-29 21:40:15 +00:00
|
|
|
dtls1_set_handshake_header,
|
2016-08-03 19:57:52 +00:00
|
|
|
dtls1_close_construct_packet,
|
2015-01-22 03:40:55 +00:00
|
|
|
dtls1_handshake_write
|
|
|
|
};
|
2013-03-20 15:49:14 +00:00
|
|
|
|
2005-08-05 23:56:11 +00:00
|
|
|
long dtls1_default_timeout(void)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
|
|
|
/*
|
|
|
|
* 2 hours, the 24 hours mentioned in the DTLSv1 spec is way too long for
|
|
|
|
* http, the cache would over fill
|
|
|
|
*/
|
|
|
|
return (60 * 60 * 2);
|
|
|
|
}
|
2005-04-26 16:02:40 +00:00
|
|
|
|
|
|
|
int dtls1_new(SSL *s)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
|
|
|
DTLS1_STATE *d1;
|
|
|
|
|
2015-04-16 05:50:03 +00:00
|
|
|
if (!DTLS_RECORD_LAYER_new(&s->rlayer)) {
|
2015-02-03 16:11:49 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2016-06-28 20:51:27 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
if (!ssl3_new(s))
|
2017-05-22 11:33:29 +00:00
|
|
|
return 0;
|
2015-08-25 17:25:58 +00:00
|
|
|
if ((d1 = OPENSSL_zalloc(sizeof(*d1))) == NULL) {
|
2015-01-22 03:40:55 +00:00
|
|
|
ssl3_free(s);
|
2017-05-22 11:33:29 +00:00
|
|
|
return 0;
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
d1->buffered_messages = pqueue_new();
|
|
|
|
d1->sent_messages = pqueue_new();
|
|
|
|
|
|
|
|
if (s->server) {
|
|
|
|
d1->cookie_len = sizeof(s->d1->cookie);
|
|
|
|
}
|
|
|
|
|
|
|
|
d1->link_mtu = 0;
|
|
|
|
d1->mtu = 0;
|
|
|
|
|
2015-10-30 10:05:53 +00:00
|
|
|
if (d1->buffered_messages == NULL || d1->sent_messages == NULL) {
|
2015-05-01 18:37:16 +00:00
|
|
|
pqueue_free(d1->buffered_messages);
|
|
|
|
pqueue_free(d1->sent_messages);
|
2015-01-22 03:40:55 +00:00
|
|
|
OPENSSL_free(d1);
|
|
|
|
ssl3_free(s);
|
2017-05-22 11:33:29 +00:00
|
|
|
return 0;
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
s->d1 = d1;
|
2017-05-22 11:33:42 +00:00
|
|
|
|
|
|
|
if (!s->method->ssl_clear(s))
|
|
|
|
return 0;
|
|
|
|
|
2017-05-22 11:33:29 +00:00
|
|
|
return 1;
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
2005-04-26 16:02:40 +00:00
|
|
|
|
2011-05-25 12:28:06 +00:00
|
|
|
static void dtls1_clear_queues(SSL *s)
|
Fix DTLS buffered message DoS attack
DTLS can handle out of order record delivery. Additionally since
handshake messages can be bigger than will fit into a single packet, the
messages can be fragmented across multiple records (as with normal TLS).
That means that the messages can arrive mixed up, and we have to
reassemble them. We keep a queue of buffered messages that are "from the
future", i.e. messages we're not ready to deal with yet but have arrived
early. The messages held there may not be full yet - they could be one
or more fragments that are still in the process of being reassembled.
The code assumes that we will eventually complete the reassembly and
when that occurs the complete message is removed from the queue at the
point that we need to use it.
However, DTLS is also tolerant of packet loss. To get around that DTLS
messages can be retransmitted. If we receive a full (non-fragmented)
message from the peer after previously having received a fragment of
that message, then we ignore the message in the queue and just use the
non-fragmented version. At that point the queued message will never get
removed.
Additionally the peer could send "future" messages that we never get to
in order to complete the handshake. Each message has a sequence number
(starting from 0). We will accept a message fragment for the current
message sequence number, or for any sequence up to 10 into the future.
However if the Finished message has a sequence number of 2, anything
greater than that in the queue is just left there.
So, in those two ways we can end up with "orphaned" data in the queue
that will never get removed - except when the connection is closed. At
that point all the queues are flushed.
An attacker could seek to exploit this by filling up the queues with
lots of large messages that are never going to be used in order to
attempt a DoS by memory exhaustion.
I will assume that we are only concerned with servers here. It does not
seem reasonable to be concerned about a memory exhaustion attack on a
client. They are unlikely to process enough connections for this to be
an issue.
A "long" handshake with many messages might be 5 messages long (in the
incoming direction), e.g. ClientHello, Certificate, ClientKeyExchange,
CertificateVerify, Finished. So this would be message sequence numbers 0
to 4. Additionally we can buffer up to 10 messages in the future.
Therefore the maximum number of messages that an attacker could send
that could get orphaned would typically be 15.
The maximum size that a DTLS message is allowed to be is defined by
max_cert_list, which by default is 100k. Therefore the maximum amount of
"orphaned" memory per connection is 1500k.
Message sequence numbers get reset after the Finished message, so
renegotiation will not extend the maximum number of messages that can be
orphaned per connection.
As noted above, the queues do get cleared when the connection is closed.
Therefore in order to mount an effective attack, an attacker would have
to open many simultaneous connections.
Issue reported by Quan Luo.
CVE-2016-2179
Reviewed-by: Richard Levitte <levitte@openssl.org>
2016-06-30 12:17:08 +00:00
|
|
|
{
|
|
|
|
dtls1_clear_received_buffer(s);
|
|
|
|
dtls1_clear_sent_buffer(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
void dtls1_clear_received_buffer(SSL *s)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
2005-04-26 16:02:40 +00:00
|
|
|
pitem *item = NULL;
|
|
|
|
hm_fragment *frag = NULL;
|
2015-01-22 03:40:55 +00:00
|
|
|
|
|
|
|
while ((item = pqueue_pop(s->d1->buffered_messages)) != NULL) {
|
2005-04-26 16:02:40 +00:00
|
|
|
frag = (hm_fragment *)item->data;
|
2014-11-25 13:36:00 +00:00
|
|
|
dtls1_hm_fragment_free(frag);
|
2005-04-26 16:02:40 +00:00
|
|
|
pitem_free(item);
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
Fix DTLS buffered message DoS attack
DTLS can handle out of order record delivery. Additionally since
handshake messages can be bigger than will fit into a single packet, the
messages can be fragmented across multiple records (as with normal TLS).
That means that the messages can arrive mixed up, and we have to
reassemble them. We keep a queue of buffered messages that are "from the
future", i.e. messages we're not ready to deal with yet but have arrived
early. The messages held there may not be full yet - they could be one
or more fragments that are still in the process of being reassembled.
The code assumes that we will eventually complete the reassembly and
when that occurs the complete message is removed from the queue at the
point that we need to use it.
However, DTLS is also tolerant of packet loss. To get around that DTLS
messages can be retransmitted. If we receive a full (non-fragmented)
message from the peer after previously having received a fragment of
that message, then we ignore the message in the queue and just use the
non-fragmented version. At that point the queued message will never get
removed.
Additionally the peer could send "future" messages that we never get to
in order to complete the handshake. Each message has a sequence number
(starting from 0). We will accept a message fragment for the current
message sequence number, or for any sequence up to 10 into the future.
However if the Finished message has a sequence number of 2, anything
greater than that in the queue is just left there.
So, in those two ways we can end up with "orphaned" data in the queue
that will never get removed - except when the connection is closed. At
that point all the queues are flushed.
An attacker could seek to exploit this by filling up the queues with
lots of large messages that are never going to be used in order to
attempt a DoS by memory exhaustion.
I will assume that we are only concerned with servers here. It does not
seem reasonable to be concerned about a memory exhaustion attack on a
client. They are unlikely to process enough connections for this to be
an issue.
A "long" handshake with many messages might be 5 messages long (in the
incoming direction), e.g. ClientHello, Certificate, ClientKeyExchange,
CertificateVerify, Finished. So this would be message sequence numbers 0
to 4. Additionally we can buffer up to 10 messages in the future.
Therefore the maximum number of messages that an attacker could send
that could get orphaned would typically be 15.
The maximum size that a DTLS message is allowed to be is defined by
max_cert_list, which by default is 100k. Therefore the maximum amount of
"orphaned" memory per connection is 1500k.
Message sequence numbers get reset after the Finished message, so
renegotiation will not extend the maximum number of messages that can be
orphaned per connection.
As noted above, the queues do get cleared when the connection is closed.
Therefore in order to mount an effective attack, an attacker would have
to open many simultaneous connections.
Issue reported by Quan Luo.
CVE-2016-2179
Reviewed-by: Richard Levitte <levitte@openssl.org>
2016-06-30 12:17:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void dtls1_clear_sent_buffer(SSL *s)
|
|
|
|
{
|
|
|
|
pitem *item = NULL;
|
|
|
|
hm_fragment *frag = NULL;
|
2005-04-26 16:02:40 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
while ((item = pqueue_pop(s->d1->sent_messages)) != NULL) {
|
2005-04-26 16:02:40 +00:00
|
|
|
frag = (hm_fragment *)item->data;
|
2014-11-25 13:36:00 +00:00
|
|
|
dtls1_hm_fragment_free(frag);
|
2005-04-26 16:02:40 +00:00
|
|
|
pitem_free(item);
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
|
|
|
}
|
2011-05-25 12:28:06 +00:00
|
|
|
|
Fix DTLS buffered message DoS attack
DTLS can handle out of order record delivery. Additionally since
handshake messages can be bigger than will fit into a single packet, the
messages can be fragmented across multiple records (as with normal TLS).
That means that the messages can arrive mixed up, and we have to
reassemble them. We keep a queue of buffered messages that are "from the
future", i.e. messages we're not ready to deal with yet but have arrived
early. The messages held there may not be full yet - they could be one
or more fragments that are still in the process of being reassembled.
The code assumes that we will eventually complete the reassembly and
when that occurs the complete message is removed from the queue at the
point that we need to use it.
However, DTLS is also tolerant of packet loss. To get around that DTLS
messages can be retransmitted. If we receive a full (non-fragmented)
message from the peer after previously having received a fragment of
that message, then we ignore the message in the queue and just use the
non-fragmented version. At that point the queued message will never get
removed.
Additionally the peer could send "future" messages that we never get to
in order to complete the handshake. Each message has a sequence number
(starting from 0). We will accept a message fragment for the current
message sequence number, or for any sequence up to 10 into the future.
However if the Finished message has a sequence number of 2, anything
greater than that in the queue is just left there.
So, in those two ways we can end up with "orphaned" data in the queue
that will never get removed - except when the connection is closed. At
that point all the queues are flushed.
An attacker could seek to exploit this by filling up the queues with
lots of large messages that are never going to be used in order to
attempt a DoS by memory exhaustion.
I will assume that we are only concerned with servers here. It does not
seem reasonable to be concerned about a memory exhaustion attack on a
client. They are unlikely to process enough connections for this to be
an issue.
A "long" handshake with many messages might be 5 messages long (in the
incoming direction), e.g. ClientHello, Certificate, ClientKeyExchange,
CertificateVerify, Finished. So this would be message sequence numbers 0
to 4. Additionally we can buffer up to 10 messages in the future.
Therefore the maximum number of messages that an attacker could send
that could get orphaned would typically be 15.
The maximum size that a DTLS message is allowed to be is defined by
max_cert_list, which by default is 100k. Therefore the maximum amount of
"orphaned" memory per connection is 1500k.
Message sequence numbers get reset after the Finished message, so
renegotiation will not extend the maximum number of messages that can be
orphaned per connection.
As noted above, the queues do get cleared when the connection is closed.
Therefore in order to mount an effective attack, an attacker would have
to open many simultaneous connections.
Issue reported by Quan Luo.
CVE-2016-2179
Reviewed-by: Richard Levitte <levitte@openssl.org>
2016-06-30 12:17:08 +00:00
|
|
|
|
2011-05-25 12:28:06 +00:00
|
|
|
void dtls1_free(SSL *s)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
2015-02-03 14:54:13 +00:00
|
|
|
DTLS_RECORD_LAYER_free(&s->rlayer);
|
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
ssl3_free(s);
|
2011-05-25 12:28:06 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
dtls1_clear_queues(s);
|
2011-05-25 12:28:06 +00:00
|
|
|
|
|
|
|
pqueue_free(s->d1->buffered_messages);
|
2015-01-22 03:40:55 +00:00
|
|
|
pqueue_free(s->d1->sent_messages);
|
2009-04-15 15:27:03 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
OPENSSL_free(s->d1);
|
|
|
|
s->d1 = NULL;
|
|
|
|
}
|
2005-04-26 16:02:40 +00:00
|
|
|
|
2017-05-22 11:33:42 +00:00
|
|
|
int dtls1_clear(SSL *s)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
2016-01-22 19:54:01 +00:00
|
|
|
pqueue *buffered_messages;
|
|
|
|
pqueue *sent_messages;
|
2016-09-07 10:34:39 +00:00
|
|
|
size_t mtu;
|
|
|
|
size_t link_mtu;
|
2015-01-22 03:40:55 +00:00
|
|
|
|
2015-02-03 14:54:13 +00:00
|
|
|
DTLS_RECORD_LAYER_clear(&s->rlayer);
|
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
if (s->d1) {
|
2017-09-06 06:30:00 +00:00
|
|
|
DTLS_timer_cb timer_cb = s->d1->timer_cb;
|
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
buffered_messages = s->d1->buffered_messages;
|
|
|
|
sent_messages = s->d1->sent_messages;
|
|
|
|
mtu = s->d1->mtu;
|
|
|
|
link_mtu = s->d1->link_mtu;
|
|
|
|
|
|
|
|
dtls1_clear_queues(s);
|
|
|
|
|
2015-05-04 22:00:15 +00:00
|
|
|
memset(s->d1, 0, sizeof(*s->d1));
|
2015-01-22 03:40:55 +00:00
|
|
|
|
2017-09-06 06:30:00 +00:00
|
|
|
/* Restore the timer callback from previous state */
|
|
|
|
s->d1->timer_cb = timer_cb;
|
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
if (s->server) {
|
|
|
|
s->d1->cookie_len = sizeof(s->d1->cookie);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (SSL_get_options(s) & SSL_OP_NO_QUERY_MTU) {
|
|
|
|
s->d1->mtu = mtu;
|
|
|
|
s->d1->link_mtu = link_mtu;
|
|
|
|
}
|
|
|
|
|
|
|
|
s->d1->buffered_messages = buffered_messages;
|
|
|
|
s->d1->sent_messages = sent_messages;
|
|
|
|
}
|
|
|
|
|
2017-05-22 11:33:42 +00:00
|
|
|
if (!ssl3_clear(s))
|
|
|
|
return 0;
|
2016-07-25 17:03:27 +00:00
|
|
|
|
|
|
|
if (s->method->version == DTLS_ANY_VERSION)
|
2018-12-09 19:53:05 +00:00
|
|
|
s->version = DTLS_MAX_VERSION_INTERNAL;
|
2016-07-25 17:03:27 +00:00
|
|
|
#ifndef OPENSSL_NO_DTLS1_METHOD
|
|
|
|
else if (s->options & SSL_OP_CISCO_ANYCONNECT)
|
|
|
|
s->client_version = s->version = DTLS1_BAD_VER;
|
|
|
|
#endif
|
2015-01-22 03:40:55 +00:00
|
|
|
else
|
|
|
|
s->version = s->method->version;
|
2017-05-22 11:33:42 +00:00
|
|
|
|
|
|
|
return 1;
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
2007-10-05 21:04:56 +00:00
|
|
|
|
2009-08-12 13:19:54 +00:00
|
|
|
long dtls1_ctrl(SSL *s, int cmd, long larg, void *parg)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
switch (cmd) {
|
|
|
|
case DTLS_CTRL_GET_TIMEOUT:
|
|
|
|
if (dtls1_get_timeout(s, (struct timeval *)parg) != NULL) {
|
|
|
|
ret = 1;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case DTLS_CTRL_HANDLE_TIMEOUT:
|
|
|
|
ret = dtls1_handle_timeout(s);
|
|
|
|
break;
|
|
|
|
case DTLS_CTRL_SET_LINK_MTU:
|
|
|
|
if (larg < (long)dtls1_link_min_mtu())
|
|
|
|
return 0;
|
|
|
|
s->d1->link_mtu = larg;
|
|
|
|
return 1;
|
|
|
|
case DTLS_CTRL_GET_LINK_MIN_MTU:
|
|
|
|
return (long)dtls1_link_min_mtu();
|
|
|
|
case SSL_CTRL_SET_MTU:
|
|
|
|
/*
|
|
|
|
* We may not have a BIO set yet so can't call dtls1_min_mtu()
|
|
|
|
* We'll have to make do with dtls1_link_min_mtu() and max overhead
|
|
|
|
*/
|
|
|
|
if (larg < (long)dtls1_link_min_mtu() - DTLS1_MAX_MTU_OVERHEAD)
|
|
|
|
return 0;
|
|
|
|
s->d1->mtu = larg;
|
|
|
|
return larg;
|
|
|
|
default:
|
|
|
|
ret = ssl3_ctrl(s, cmd, larg, parg);
|
|
|
|
break;
|
|
|
|
}
|
2017-10-17 14:04:09 +00:00
|
|
|
return ret;
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
2009-08-12 13:19:54 +00:00
|
|
|
|
2009-05-15 22:58:40 +00:00
|
|
|
void dtls1_start_timer(SSL *s)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
2017-09-06 06:30:00 +00:00
|
|
|
unsigned int sec, usec;
|
|
|
|
|
2011-12-25 14:45:15 +00:00
|
|
|
#ifndef OPENSSL_NO_SCTP
|
2015-01-22 03:40:55 +00:00
|
|
|
/* Disable timer for SCTP */
|
|
|
|
if (BIO_dgram_is_sctp(SSL_get_wbio(s))) {
|
2015-05-04 22:00:15 +00:00
|
|
|
memset(&s->d1->next_timeout, 0, sizeof(s->d1->next_timeout));
|
2015-01-22 03:40:55 +00:00
|
|
|
return;
|
|
|
|
}
|
2011-12-25 14:45:15 +00:00
|
|
|
#endif
|
|
|
|
|
2017-09-06 06:30:00 +00:00
|
|
|
/*
|
|
|
|
* If timer is not set, initialize duration with 1 second or
|
|
|
|
* a user-specified value if the timer callback is installed.
|
|
|
|
*/
|
2015-01-22 03:40:55 +00:00
|
|
|
if (s->d1->next_timeout.tv_sec == 0 && s->d1->next_timeout.tv_usec == 0) {
|
2017-09-06 06:30:00 +00:00
|
|
|
|
|
|
|
if (s->d1->timer_cb != NULL)
|
|
|
|
s->d1->timeout_duration_us = s->d1->timer_cb(s, 0);
|
|
|
|
else
|
|
|
|
s->d1->timeout_duration_us = 1000000;
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Set timeout to current time */
|
|
|
|
get_current_time(&(s->d1->next_timeout));
|
|
|
|
|
|
|
|
/* Add duration to current time */
|
2017-09-06 06:30:00 +00:00
|
|
|
|
|
|
|
sec = s->d1->timeout_duration_us / 1000000;
|
|
|
|
usec = s->d1->timeout_duration_us - (sec * 1000000);
|
|
|
|
|
|
|
|
s->d1->next_timeout.tv_sec += sec;
|
|
|
|
s->d1->next_timeout.tv_usec += usec;
|
|
|
|
|
|
|
|
if (s->d1->next_timeout.tv_usec >= 1000000) {
|
|
|
|
s->d1->next_timeout.tv_sec++;
|
|
|
|
s->d1->next_timeout.tv_usec -= 1000000;
|
|
|
|
}
|
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
BIO_ctrl(SSL_get_rbio(s), BIO_CTRL_DGRAM_SET_NEXT_TIMEOUT, 0,
|
|
|
|
&(s->d1->next_timeout));
|
|
|
|
}
|
|
|
|
|
|
|
|
struct timeval *dtls1_get_timeout(SSL *s, struct timeval *timeleft)
|
|
|
|
{
|
|
|
|
struct timeval timenow;
|
|
|
|
|
|
|
|
/* If no timeout is set, just return NULL */
|
|
|
|
if (s->d1->next_timeout.tv_sec == 0 && s->d1->next_timeout.tv_usec == 0) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Get current time */
|
|
|
|
get_current_time(&timenow);
|
|
|
|
|
|
|
|
/* If timer already expired, set remaining time to 0 */
|
|
|
|
if (s->d1->next_timeout.tv_sec < timenow.tv_sec ||
|
|
|
|
(s->d1->next_timeout.tv_sec == timenow.tv_sec &&
|
|
|
|
s->d1->next_timeout.tv_usec <= timenow.tv_usec)) {
|
2015-05-04 22:00:15 +00:00
|
|
|
memset(timeleft, 0, sizeof(*timeleft));
|
2015-01-22 03:40:55 +00:00
|
|
|
return timeleft;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Calculate time left until timer expires */
|
|
|
|
memcpy(timeleft, &(s->d1->next_timeout), sizeof(struct timeval));
|
|
|
|
timeleft->tv_sec -= timenow.tv_sec;
|
|
|
|
timeleft->tv_usec -= timenow.tv_usec;
|
|
|
|
if (timeleft->tv_usec < 0) {
|
|
|
|
timeleft->tv_sec--;
|
|
|
|
timeleft->tv_usec += 1000000;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If remaining time is less than 15 ms, set it to 0 to prevent issues
|
2016-06-19 17:39:01 +00:00
|
|
|
* because of small divergences with socket timeouts.
|
2015-01-22 03:40:55 +00:00
|
|
|
*/
|
|
|
|
if (timeleft->tv_sec == 0 && timeleft->tv_usec < 15000) {
|
2015-05-04 22:00:15 +00:00
|
|
|
memset(timeleft, 0, sizeof(*timeleft));
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return timeleft;
|
|
|
|
}
|
2009-05-15 22:58:40 +00:00
|
|
|
|
|
|
|
int dtls1_is_timer_expired(SSL *s)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
|
|
|
struct timeval timeleft;
|
2009-05-15 22:58:40 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
/* Get time left until timeout, return false if no timer running */
|
|
|
|
if (dtls1_get_timeout(s, &timeleft) == NULL) {
|
|
|
|
return 0;
|
|
|
|
}
|
2009-05-15 22:58:40 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
/* Return false if timer is not expired yet */
|
|
|
|
if (timeleft.tv_sec > 0 || timeleft.tv_usec > 0) {
|
|
|
|
return 0;
|
|
|
|
}
|
2009-05-15 22:58:40 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
/* Timer expired, so return true */
|
|
|
|
return 1;
|
|
|
|
}
|
2009-05-15 22:58:40 +00:00
|
|
|
|
|
|
|
void dtls1_double_timeout(SSL *s)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
2017-09-06 06:30:00 +00:00
|
|
|
s->d1->timeout_duration_us *= 2;
|
|
|
|
if (s->d1->timeout_duration_us > 60000000)
|
|
|
|
s->d1->timeout_duration_us = 60000000;
|
2015-01-22 03:40:55 +00:00
|
|
|
dtls1_start_timer(s);
|
|
|
|
}
|
2009-05-15 22:58:40 +00:00
|
|
|
|
|
|
|
void dtls1_stop_timer(SSL *s)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
|
|
|
/* Reset everything */
|
2015-05-04 22:00:15 +00:00
|
|
|
memset(&s->d1->timeout, 0, sizeof(s->d1->timeout));
|
|
|
|
memset(&s->d1->next_timeout, 0, sizeof(s->d1->next_timeout));
|
2017-09-06 06:30:00 +00:00
|
|
|
s->d1->timeout_duration_us = 1000000;
|
2015-01-22 03:40:55 +00:00
|
|
|
BIO_ctrl(SSL_get_rbio(s), BIO_CTRL_DGRAM_SET_NEXT_TIMEOUT, 0,
|
|
|
|
&(s->d1->next_timeout));
|
|
|
|
/* Clear retransmission buffer */
|
Fix DTLS buffered message DoS attack
DTLS can handle out of order record delivery. Additionally since
handshake messages can be bigger than will fit into a single packet, the
messages can be fragmented across multiple records (as with normal TLS).
That means that the messages can arrive mixed up, and we have to
reassemble them. We keep a queue of buffered messages that are "from the
future", i.e. messages we're not ready to deal with yet but have arrived
early. The messages held there may not be full yet - they could be one
or more fragments that are still in the process of being reassembled.
The code assumes that we will eventually complete the reassembly and
when that occurs the complete message is removed from the queue at the
point that we need to use it.
However, DTLS is also tolerant of packet loss. To get around that DTLS
messages can be retransmitted. If we receive a full (non-fragmented)
message from the peer after previously having received a fragment of
that message, then we ignore the message in the queue and just use the
non-fragmented version. At that point the queued message will never get
removed.
Additionally the peer could send "future" messages that we never get to
in order to complete the handshake. Each message has a sequence number
(starting from 0). We will accept a message fragment for the current
message sequence number, or for any sequence up to 10 into the future.
However if the Finished message has a sequence number of 2, anything
greater than that in the queue is just left there.
So, in those two ways we can end up with "orphaned" data in the queue
that will never get removed - except when the connection is closed. At
that point all the queues are flushed.
An attacker could seek to exploit this by filling up the queues with
lots of large messages that are never going to be used in order to
attempt a DoS by memory exhaustion.
I will assume that we are only concerned with servers here. It does not
seem reasonable to be concerned about a memory exhaustion attack on a
client. They are unlikely to process enough connections for this to be
an issue.
A "long" handshake with many messages might be 5 messages long (in the
incoming direction), e.g. ClientHello, Certificate, ClientKeyExchange,
CertificateVerify, Finished. So this would be message sequence numbers 0
to 4. Additionally we can buffer up to 10 messages in the future.
Therefore the maximum number of messages that an attacker could send
that could get orphaned would typically be 15.
The maximum size that a DTLS message is allowed to be is defined by
max_cert_list, which by default is 100k. Therefore the maximum amount of
"orphaned" memory per connection is 1500k.
Message sequence numbers get reset after the Finished message, so
renegotiation will not extend the maximum number of messages that can be
orphaned per connection.
As noted above, the queues do get cleared when the connection is closed.
Therefore in order to mount an effective attack, an attacker would have
to open many simultaneous connections.
Issue reported by Quan Luo.
CVE-2016-2179
Reviewed-by: Richard Levitte <levitte@openssl.org>
2016-06-30 12:17:08 +00:00
|
|
|
dtls1_clear_sent_buffer(s);
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
2009-05-15 22:58:40 +00:00
|
|
|
|
2012-03-09 15:52:33 +00:00
|
|
|
int dtls1_check_timeout_num(SSL *s)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
2016-09-07 10:34:39 +00:00
|
|
|
size_t mtu;
|
2015-01-22 03:40:55 +00:00
|
|
|
|
|
|
|
s->d1->timeout.num_alerts++;
|
|
|
|
|
|
|
|
/* Reduce MTU after 2 unsuccessful retransmissions */
|
|
|
|
if (s->d1->timeout.num_alerts > 2
|
|
|
|
&& !(SSL_get_options(s) & SSL_OP_NO_QUERY_MTU)) {
|
|
|
|
mtu =
|
2016-08-05 17:03:17 +00:00
|
|
|
BIO_ctrl(SSL_get_wbio(s), BIO_CTRL_DGRAM_GET_FALLBACK_MTU, 0, NULL);
|
2015-01-22 03:40:55 +00:00
|
|
|
if (mtu < s->d1->mtu)
|
|
|
|
s->d1->mtu = mtu;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (s->d1->timeout.num_alerts > DTLS1_TMO_ALERT_COUNT) {
|
|
|
|
/* fail the connection, enough alerts have been sent */
|
2019-05-31 17:52:45 +00:00
|
|
|
SSLfatal(s, SSL_AD_NO_ALERT, 0,
|
2017-12-04 16:16:37 +00:00
|
|
|
SSL_R_READ_TIMEOUT_EXPIRED);
|
2015-01-22 03:40:55 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2012-03-09 15:52:33 +00:00
|
|
|
|
|
|
|
int dtls1_handle_timeout(SSL *s)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
|
|
|
/* if no timer is expired, don't do anything */
|
|
|
|
if (!dtls1_is_timer_expired(s)) {
|
|
|
|
return 0;
|
|
|
|
}
|
2012-03-09 15:52:33 +00:00
|
|
|
|
2017-09-06 06:30:00 +00:00
|
|
|
if (s->d1->timer_cb != NULL)
|
|
|
|
s->d1->timeout_duration_us = s->d1->timer_cb(s, s->d1->timeout_duration_us);
|
|
|
|
else
|
|
|
|
dtls1_double_timeout(s);
|
2012-03-09 15:52:33 +00:00
|
|
|
|
2017-12-04 16:16:37 +00:00
|
|
|
if (dtls1_check_timeout_num(s) < 0) {
|
|
|
|
/* SSLfatal() already called */
|
2015-01-22 03:40:55 +00:00
|
|
|
return -1;
|
2017-12-04 16:16:37 +00:00
|
|
|
}
|
2012-03-06 13:47:43 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
s->d1->timeout.read_timeouts++;
|
|
|
|
if (s->d1->timeout.read_timeouts > DTLS1_TMO_READ_COUNT) {
|
|
|
|
s->d1->timeout.read_timeouts = 1;
|
|
|
|
}
|
2011-12-31 22:59:57 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
dtls1_start_timer(s);
|
2017-12-04 16:16:37 +00:00
|
|
|
/* Calls SSLfatal() if required */
|
2015-01-22 03:40:55 +00:00
|
|
|
return dtls1_retransmit_buffered_messages(s);
|
|
|
|
}
|
2009-08-12 13:19:54 +00:00
|
|
|
|
2009-05-15 22:58:40 +00:00
|
|
|
static void get_current_time(struct timeval *t)
|
|
|
|
{
|
2013-01-19 20:23:13 +00:00
|
|
|
#if defined(_WIN32)
|
2015-01-22 03:40:55 +00:00
|
|
|
SYSTEMTIME st;
|
|
|
|
union {
|
|
|
|
unsigned __int64 ul;
|
|
|
|
FILETIME ft;
|
|
|
|
} now;
|
|
|
|
|
|
|
|
GetSystemTime(&st);
|
|
|
|
SystemTimeToFileTime(&st, &now.ft);
|
2016-08-05 17:03:17 +00:00
|
|
|
/* re-bias to 1/1/1970 */
|
2015-01-22 03:40:55 +00:00
|
|
|
# ifdef __MINGW32__
|
|
|
|
now.ul -= 116444736000000000ULL;
|
|
|
|
# else
|
2016-08-05 17:03:17 +00:00
|
|
|
/* *INDENT-OFF* */
|
|
|
|
now.ul -= 116444736000000000UI64;
|
|
|
|
/* *INDENT-ON* */
|
2015-01-22 03:40:55 +00:00
|
|
|
# endif
|
|
|
|
t->tv_sec = (long)(now.ul / 10000000);
|
|
|
|
t->tv_usec = ((int)(now.ul % 10000000)) / 10;
|
2009-05-15 22:58:40 +00:00
|
|
|
#else
|
2015-01-22 03:40:55 +00:00
|
|
|
gettimeofday(t, NULL);
|
2009-05-15 22:58:40 +00:00
|
|
|
#endif
|
|
|
|
}
|
2009-09-09 17:05:18 +00:00
|
|
|
|
2015-09-14 21:49:35 +00:00
|
|
|
#define LISTEN_SUCCESS 2
|
|
|
|
#define LISTEN_SEND_VERIFY_REQUEST 1
|
|
|
|
|
2016-03-21 15:32:40 +00:00
|
|
|
#ifndef OPENSSL_NO_SOCK
|
2016-02-05 10:59:42 +00:00
|
|
|
int DTLSv1_listen(SSL *s, BIO_ADDR *client)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
2018-10-09 09:22:06 +00:00
|
|
|
int next, n, ret = 0;
|
2015-09-14 21:49:35 +00:00
|
|
|
unsigned char cookie[DTLS1_COOKIE_LENGTH];
|
|
|
|
unsigned char seq[SEQ_NUM_SIZE];
|
2016-02-01 14:26:18 +00:00
|
|
|
const unsigned char *data;
|
2018-10-08 14:46:51 +00:00
|
|
|
unsigned char *buf, *wbuf;
|
2018-10-09 09:22:06 +00:00
|
|
|
size_t fragoff, fraglen, msglen, reclen, align = 0;
|
2015-09-14 21:49:35 +00:00
|
|
|
unsigned int rectype, versmajor, msgseq, msgtype, clientvers, cookielen;
|
|
|
|
BIO *rbio, *wbio;
|
2016-02-02 23:27:44 +00:00
|
|
|
BIO_ADDR *tmpclient = NULL;
|
2015-09-14 21:49:35 +00:00
|
|
|
PACKET pkt, msgpkt, msgpayload, session, cookiepkt;
|
2015-01-22 03:40:55 +00:00
|
|
|
|
2016-11-23 23:03:13 +00:00
|
|
|
if (s->handshake_func == NULL) {
|
|
|
|
/* Not properly initialized yet */
|
|
|
|
SSL_set_accept_state(s);
|
|
|
|
}
|
|
|
|
|
2015-03-09 16:09:04 +00:00
|
|
|
/* Ensure there is no state left over from a previous invocation */
|
2015-04-16 05:50:03 +00:00
|
|
|
if (!SSL_clear(s))
|
2015-03-23 15:27:40 +00:00
|
|
|
return -1;
|
2015-03-09 16:09:04 +00:00
|
|
|
|
2015-09-14 21:49:35 +00:00
|
|
|
ERR_clear_error();
|
|
|
|
|
|
|
|
rbio = SSL_get_rbio(s);
|
|
|
|
wbio = SSL_get_wbio(s);
|
|
|
|
|
2016-06-28 22:18:50 +00:00
|
|
|
if (!rbio || !wbio) {
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, SSL_R_BIO_NOT_SET);
|
2015-09-14 21:49:35 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Note: This check deliberately excludes DTLS1_BAD_VER because that version
|
|
|
|
* requires the MAC to be calculated *including* the first ClientHello
|
|
|
|
* (without the cookie). Since DTLSv1_listen is stateless that cannot be
|
|
|
|
* supported. DTLS1_BAD_VER must use cookies in a stateful manner (e.g. via
|
|
|
|
* SSL_accept)
|
|
|
|
*/
|
|
|
|
if ((s->version & 0xff00) != (DTLS1_VERSION & 0xff00)) {
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, SSL_R_UNSUPPORTED_SSL_VERSION);
|
2015-09-14 21:49:35 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2018-10-08 14:46:51 +00:00
|
|
|
if (!ssl3_setup_buffers(s)) {
|
|
|
|
/* SSLerr already called */
|
|
|
|
return -1;
|
2015-09-14 21:49:35 +00:00
|
|
|
}
|
2018-10-08 14:46:51 +00:00
|
|
|
buf = RECORD_LAYER_get_rbuf(&s->rlayer)->buf;
|
|
|
|
wbuf = RECORD_LAYER_get_wbuf(&s->rlayer)[0].buf;
|
2018-10-09 09:22:06 +00:00
|
|
|
#if defined(SSL3_ALIGN_PAYLOAD)
|
|
|
|
# if SSL3_ALIGN_PAYLOAD != 0
|
|
|
|
/*
|
|
|
|
* Using SSL3_RT_HEADER_LENGTH here instead of DTLS1_RT_HEADER_LENGTH for
|
|
|
|
* consistency with ssl3_read_n. In practice it should make no difference
|
|
|
|
* for sensible values of SSL3_ALIGN_PAYLOAD because the difference between
|
|
|
|
* SSL3_RT_HEADER_LENGTH and DTLS1_RT_HEADER_LENGTH is exactly 8
|
|
|
|
*/
|
|
|
|
align = (size_t)buf + SSL3_RT_HEADER_LENGTH;
|
|
|
|
align = SSL3_ALIGN_PAYLOAD - 1 - ((align - 1) % SSL3_ALIGN_PAYLOAD);
|
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
buf += align;
|
2015-09-14 21:49:35 +00:00
|
|
|
|
|
|
|
do {
|
|
|
|
/* Get a packet */
|
|
|
|
|
|
|
|
clear_sys_error();
|
2018-10-08 14:46:51 +00:00
|
|
|
n = BIO_read(rbio, buf, SSL3_RT_MAX_PLAIN_LENGTH
|
|
|
|
+ DTLS1_RT_HEADER_LENGTH);
|
2015-09-14 21:49:35 +00:00
|
|
|
if (n <= 0) {
|
2016-06-28 22:18:50 +00:00
|
|
|
if (BIO_should_retry(rbio)) {
|
2015-09-14 21:49:35 +00:00
|
|
|
/* Non-blocking IO */
|
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!PACKET_buf_init(&pkt, buf, n)) {
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, ERR_R_INTERNAL_ERROR);
|
2015-09-14 21:49:35 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Parse the received record. If there are any problems with it we just
|
|
|
|
* dump it - with no alert. RFC6347 says this "Unlike TLS, DTLS is
|
|
|
|
* resilient in the face of invalid records (e.g., invalid formatting,
|
|
|
|
* length, MAC, etc.). In general, invalid records SHOULD be silently
|
|
|
|
* discarded, thus preserving the association; however, an error MAY be
|
|
|
|
* logged for diagnostic purposes."
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* this packet contained a partial record, dump it */
|
|
|
|
if (n < DTLS1_RT_HEADER_LENGTH) {
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, SSL_R_RECORD_TOO_SMALL);
|
2015-09-14 21:49:35 +00:00
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (s->msg_callback)
|
|
|
|
s->msg_callback(0, 0, SSL3_RT_HEADER, buf,
|
|
|
|
DTLS1_RT_HEADER_LENGTH, s, s->msg_callback_arg);
|
|
|
|
|
|
|
|
/* Get the record header */
|
|
|
|
if (!PACKET_get_1(&pkt, &rectype)
|
|
|
|
|| !PACKET_get_1(&pkt, &versmajor)) {
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, SSL_R_LENGTH_MISMATCH);
|
2015-09-14 21:49:35 +00:00
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
|
2016-08-05 17:03:17 +00:00
|
|
|
if (rectype != SSL3_RT_HANDSHAKE) {
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, SSL_R_UNEXPECTED_MESSAGE);
|
2015-09-14 21:49:35 +00:00
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check record version number. We only check that the major version is
|
|
|
|
* the same.
|
|
|
|
*/
|
|
|
|
if (versmajor != DTLS1_VERSION_MAJOR) {
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, SSL_R_BAD_PROTOCOL_VERSION_NUMBER);
|
2015-09-14 21:49:35 +00:00
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!PACKET_forward(&pkt, 1)
|
|
|
|
/* Save the sequence number: 64 bits, with top 2 bytes = epoch */
|
|
|
|
|| !PACKET_copy_bytes(&pkt, seq, SEQ_NUM_SIZE)
|
2015-11-04 13:53:57 +00:00
|
|
|
|| !PACKET_get_length_prefixed_2(&pkt, &msgpkt)) {
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, SSL_R_LENGTH_MISMATCH);
|
2015-09-14 21:49:35 +00:00
|
|
|
goto end;
|
|
|
|
}
|
2018-10-09 09:22:06 +00:00
|
|
|
reclen = PACKET_remaining(&msgpkt);
|
2015-11-04 13:53:57 +00:00
|
|
|
/*
|
|
|
|
* We allow data remaining at the end of the packet because there could
|
|
|
|
* be a second record (but we ignore it)
|
|
|
|
*/
|
2015-09-14 21:49:35 +00:00
|
|
|
|
|
|
|
/* This is an initial ClientHello so the epoch has to be 0 */
|
|
|
|
if (seq[0] != 0 || seq[1] != 0) {
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, SSL_R_UNEXPECTED_MESSAGE);
|
2015-09-14 21:49:35 +00:00
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Get a pointer to the raw message for the later callback */
|
|
|
|
data = PACKET_data(&msgpkt);
|
|
|
|
|
|
|
|
/* Finished processing the record header, now process the message */
|
|
|
|
if (!PACKET_get_1(&msgpkt, &msgtype)
|
2016-10-19 13:39:39 +00:00
|
|
|
|| !PACKET_get_net_3_len(&msgpkt, &msglen)
|
2015-09-14 21:49:35 +00:00
|
|
|
|| !PACKET_get_net_2(&msgpkt, &msgseq)
|
2016-10-19 13:39:39 +00:00
|
|
|
|| !PACKET_get_net_3_len(&msgpkt, &fragoff)
|
|
|
|
|| !PACKET_get_net_3_len(&msgpkt, &fraglen)
|
2015-11-04 13:53:57 +00:00
|
|
|
|| !PACKET_get_sub_packet(&msgpkt, &msgpayload, fraglen)
|
2015-09-14 21:49:35 +00:00
|
|
|
|| PACKET_remaining(&msgpkt) != 0) {
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, SSL_R_LENGTH_MISMATCH);
|
2015-09-14 21:49:35 +00:00
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (msgtype != SSL3_MT_CLIENT_HELLO) {
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, SSL_R_UNEXPECTED_MESSAGE);
|
2015-09-14 21:49:35 +00:00
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Message sequence number can only be 0 or 1 */
|
2016-06-28 22:18:50 +00:00
|
|
|
if (msgseq > 2) {
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, SSL_R_INVALID_SEQUENCE_NUMBER);
|
2015-09-14 21:49:35 +00:00
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
|
2015-11-04 13:53:57 +00:00
|
|
|
/*
|
|
|
|
* We don't support fragment reassembly for ClientHellos whilst
|
|
|
|
* listening because that would require server side state (which is
|
|
|
|
* against the whole point of the ClientHello/HelloVerifyRequest
|
|
|
|
* mechanism). Instead we only look at the first ClientHello fragment
|
|
|
|
* and require that the cookie must be contained within it.
|
|
|
|
*/
|
|
|
|
if (fragoff != 0 || fraglen > msglen) {
|
|
|
|
/* Non initial ClientHello fragment (or bad fragment) */
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, SSL_R_FRAGMENTED_CLIENT_HELLO);
|
2015-09-14 21:49:35 +00:00
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (s->msg_callback)
|
|
|
|
s->msg_callback(0, s->version, SSL3_RT_HANDSHAKE, data,
|
2015-11-04 13:53:57 +00:00
|
|
|
fraglen + DTLS1_HM_HEADER_LENGTH, s,
|
2015-09-14 21:49:35 +00:00
|
|
|
s->msg_callback_arg);
|
|
|
|
|
|
|
|
if (!PACKET_get_net_2(&msgpayload, &clientvers)) {
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, SSL_R_LENGTH_MISMATCH);
|
2015-09-14 21:49:35 +00:00
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Verify client version is supported
|
|
|
|
*/
|
2015-12-29 08:24:17 +00:00
|
|
|
if (DTLS_VERSION_LT(clientvers, (unsigned int)s->method->version) &&
|
|
|
|
s->method->version != DTLS_ANY_VERSION) {
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, SSL_R_WRONG_VERSION_NUMBER);
|
2015-09-14 21:49:35 +00:00
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!PACKET_forward(&msgpayload, SSL3_RANDOM_SIZE)
|
|
|
|
|| !PACKET_get_length_prefixed_1(&msgpayload, &session)
|
|
|
|
|| !PACKET_get_length_prefixed_1(&msgpayload, &cookiepkt)) {
|
2015-11-04 13:53:57 +00:00
|
|
|
/*
|
|
|
|
* Could be malformed or the cookie does not fit within the initial
|
|
|
|
* ClientHello fragment. Either way we can't handle it.
|
|
|
|
*/
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, SSL_R_LENGTH_MISMATCH);
|
2015-09-14 21:49:35 +00:00
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check if we have a cookie or not. If not we need to send a
|
|
|
|
* HelloVerifyRequest.
|
|
|
|
*/
|
|
|
|
if (PACKET_remaining(&cookiepkt) == 0) {
|
|
|
|
next = LISTEN_SEND_VERIFY_REQUEST;
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* We have a cookie, so lets check it.
|
|
|
|
*/
|
|
|
|
if (s->ctx->app_verify_cookie_cb == NULL) {
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, SSL_R_NO_VERIFY_COOKIE_CALLBACK);
|
2015-09-14 21:49:35 +00:00
|
|
|
/* This is fatal */
|
|
|
|
return -1;
|
|
|
|
}
|
2015-10-06 15:20:32 +00:00
|
|
|
if (s->ctx->app_verify_cookie_cb(s, PACKET_data(&cookiepkt),
|
2016-10-06 18:17:54 +00:00
|
|
|
(unsigned int)PACKET_remaining(&cookiepkt)) == 0) {
|
2015-09-14 21:49:35 +00:00
|
|
|
/*
|
|
|
|
* We treat invalid cookies in the same was as no cookie as
|
|
|
|
* per RFC6347
|
|
|
|
*/
|
|
|
|
next = LISTEN_SEND_VERIFY_REQUEST;
|
|
|
|
} else {
|
|
|
|
/* Cookie verification succeeded */
|
|
|
|
next = LISTEN_SUCCESS;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (next == LISTEN_SEND_VERIFY_REQUEST) {
|
2016-09-21 10:26:47 +00:00
|
|
|
WPACKET wpkt;
|
|
|
|
unsigned int version;
|
|
|
|
size_t wreclen;
|
|
|
|
|
2015-09-14 21:49:35 +00:00
|
|
|
/*
|
|
|
|
* There was no cookie in the ClientHello so we need to send a
|
|
|
|
* HelloVerifyRequest. If this fails we do not worry about trying
|
|
|
|
* to resend, we just drop it.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* Generate the cookie */
|
|
|
|
if (s->ctx->app_gen_cookie_cb == NULL ||
|
2015-09-23 11:57:34 +00:00
|
|
|
s->ctx->app_gen_cookie_cb(s, cookie, &cookielen) == 0 ||
|
|
|
|
cookielen > 255) {
|
2016-02-05 10:59:42 +00:00
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, SSL_R_COOKIE_GEN_CALLBACK_FAILURE);
|
2015-09-14 21:49:35 +00:00
|
|
|
/* This is fatal */
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Special case: for hello verify request, client version 1.0 and we
|
|
|
|
* haven't decided which version to use yet send back using version
|
|
|
|
* 1.0 header: otherwise some clients will ignore it.
|
|
|
|
*/
|
2016-09-21 10:26:47 +00:00
|
|
|
version = (s->method->version == DTLS_ANY_VERSION) ? DTLS1_VERSION
|
|
|
|
: s->version;
|
|
|
|
|
|
|
|
/* Construct the record and message headers */
|
2018-10-08 14:46:51 +00:00
|
|
|
if (!WPACKET_init_static_len(&wpkt,
|
|
|
|
wbuf,
|
2018-10-09 09:22:06 +00:00
|
|
|
ssl_get_max_send_fragment(s)
|
2018-10-08 14:46:51 +00:00
|
|
|
+ DTLS1_RT_HEADER_LENGTH,
|
|
|
|
0)
|
2016-09-21 10:26:47 +00:00
|
|
|
|| !WPACKET_put_bytes_u8(&wpkt, SSL3_RT_HANDSHAKE)
|
|
|
|
|| !WPACKET_put_bytes_u16(&wpkt, version)
|
|
|
|
/*
|
|
|
|
* Record sequence number is always the same as in the
|
|
|
|
* received ClientHello
|
|
|
|
*/
|
|
|
|
|| !WPACKET_memcpy(&wpkt, seq, SEQ_NUM_SIZE)
|
|
|
|
/* End of record, start sub packet for message */
|
|
|
|
|| !WPACKET_start_sub_packet_u16(&wpkt)
|
|
|
|
/* Message type */
|
|
|
|
|| !WPACKET_put_bytes_u8(&wpkt,
|
|
|
|
DTLS1_MT_HELLO_VERIFY_REQUEST)
|
|
|
|
/*
|
|
|
|
* Message length - doesn't follow normal TLS convention:
|
|
|
|
* the length isn't the last thing in the message header.
|
|
|
|
* We'll need to fill this in later when we know the
|
|
|
|
* length. Set it to zero for now
|
|
|
|
*/
|
|
|
|
|| !WPACKET_put_bytes_u24(&wpkt, 0)
|
|
|
|
/*
|
|
|
|
* Message sequence number is always 0 for a
|
|
|
|
* HelloVerifyRequest
|
|
|
|
*/
|
|
|
|
|| !WPACKET_put_bytes_u16(&wpkt, 0)
|
|
|
|
/*
|
|
|
|
* We never fragment a HelloVerifyRequest, so fragment
|
|
|
|
* offset is 0
|
|
|
|
*/
|
|
|
|
|| !WPACKET_put_bytes_u24(&wpkt, 0)
|
|
|
|
/*
|
|
|
|
* Fragment length is the same as message length, but
|
|
|
|
* this *is* the last thing in the message header so we
|
|
|
|
* can just start a sub-packet. No need to come back
|
|
|
|
* later for this one.
|
|
|
|
*/
|
|
|
|
|| !WPACKET_start_sub_packet_u24(&wpkt)
|
|
|
|
/* Create the actual HelloVerifyRequest body */
|
|
|
|
|| !dtls_raw_hello_verify_request(&wpkt, cookie, cookielen)
|
|
|
|
/* Close message body */
|
|
|
|
|| !WPACKET_close(&wpkt)
|
|
|
|
/* Close record body */
|
|
|
|
|| !WPACKET_close(&wpkt)
|
|
|
|
|| !WPACKET_get_total_written(&wpkt, &wreclen)
|
|
|
|
|| !WPACKET_finish(&wpkt)) {
|
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, ERR_R_INTERNAL_ERROR);
|
|
|
|
WPACKET_cleanup(&wpkt);
|
|
|
|
/* This is fatal */
|
|
|
|
return -1;
|
2015-09-14 21:49:35 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2016-09-21 10:26:47 +00:00
|
|
|
* Fix up the message len in the message header. Its the same as the
|
|
|
|
* fragment len which has been filled in by WPACKET, so just copy
|
|
|
|
* that. Destination for the message len is after the record header
|
|
|
|
* plus one byte for the message content type. The source is the
|
|
|
|
* last 3 bytes of the message header
|
2015-09-14 21:49:35 +00:00
|
|
|
*/
|
2018-10-08 14:46:51 +00:00
|
|
|
memcpy(&wbuf[DTLS1_RT_HEADER_LENGTH + 1],
|
|
|
|
&wbuf[DTLS1_RT_HEADER_LENGTH + DTLS1_HM_HEADER_LENGTH - 3],
|
2016-09-21 10:26:47 +00:00
|
|
|
3);
|
2015-09-14 21:49:35 +00:00
|
|
|
|
|
|
|
if (s->msg_callback)
|
|
|
|
s->msg_callback(1, 0, SSL3_RT_HEADER, buf,
|
|
|
|
DTLS1_RT_HEADER_LENGTH, s, s->msg_callback_arg);
|
|
|
|
|
2016-01-21 12:22:58 +00:00
|
|
|
if ((tmpclient = BIO_ADDR_new()) == NULL) {
|
|
|
|
SSLerr(SSL_F_DTLSV1_LISTEN, ERR_R_MALLOC_FAILURE);
|
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
|
2015-09-14 21:49:35 +00:00
|
|
|
/*
|
2016-03-10 20:34:48 +00:00
|
|
|
* This is unnecessary if rbio and wbio are one and the same - but
|
2016-01-21 12:22:58 +00:00
|
|
|
* maybe they're not. We ignore errors here - some BIOs do not
|
|
|
|
* support this.
|
2015-09-14 21:49:35 +00:00
|
|
|
*/
|
2016-06-28 22:18:50 +00:00
|
|
|
if (BIO_dgram_get_peer(rbio, tmpclient) > 0) {
|
2016-01-21 12:22:58 +00:00
|
|
|
(void)BIO_dgram_set_peer(wbio, tmpclient);
|
2015-09-14 21:49:35 +00:00
|
|
|
}
|
2016-02-02 23:27:44 +00:00
|
|
|
BIO_ADDR_free(tmpclient);
|
|
|
|
tmpclient = NULL;
|
2015-09-14 21:49:35 +00:00
|
|
|
|
2016-10-06 18:17:54 +00:00
|
|
|
/* TODO(size_t): convert this call */
|
2018-10-08 14:46:51 +00:00
|
|
|
if (BIO_write(wbio, wbuf, wreclen) < (int)wreclen) {
|
2016-06-28 22:18:50 +00:00
|
|
|
if (BIO_should_retry(wbio)) {
|
2015-09-14 21:49:35 +00:00
|
|
|
/*
|
|
|
|
* Non-blocking IO...but we're stateless, so we're just
|
|
|
|
* going to drop this packet.
|
|
|
|
*/
|
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (BIO_flush(wbio) <= 0) {
|
2016-06-28 22:18:50 +00:00
|
|
|
if (BIO_should_retry(wbio)) {
|
2015-09-14 21:49:35 +00:00
|
|
|
/*
|
|
|
|
* Non-blocking IO...but we're stateless, so we're just
|
|
|
|
* going to drop this packet.
|
|
|
|
*/
|
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} while (next != LISTEN_SUCCESS);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set expected sequence numbers to continue the handshake.
|
|
|
|
*/
|
|
|
|
s->d1->handshake_read_seq = 1;
|
|
|
|
s->d1->handshake_write_seq = 1;
|
|
|
|
s->d1->next_handshake_write_seq = 1;
|
|
|
|
DTLS_RECORD_LAYER_set_write_sequence(&s->rlayer, seq);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We are doing cookie exchange, so make sure we set that option in the
|
|
|
|
* SSL object
|
|
|
|
*/
|
2015-01-22 03:40:55 +00:00
|
|
|
SSL_set_options(s, SSL_OP_COOKIE_EXCHANGE);
|
2009-09-09 17:05:18 +00:00
|
|
|
|
2015-10-22 11:18:45 +00:00
|
|
|
/*
|
|
|
|
* Tell the state machine that we've done the initial hello verify
|
|
|
|
* exchange
|
|
|
|
*/
|
|
|
|
ossl_statem_set_hello_verify_done(s);
|
2015-09-14 21:49:35 +00:00
|
|
|
|
2016-08-05 17:03:17 +00:00
|
|
|
/*
|
|
|
|
* Some BIOs may not support this. If we fail we clear the client address
|
|
|
|
*/
|
2016-01-21 12:22:58 +00:00
|
|
|
if (BIO_dgram_get_peer(rbio, client) <= 0)
|
|
|
|
BIO_ADDR_clear(client);
|
2009-09-09 17:05:18 +00:00
|
|
|
|
2018-10-09 09:22:06 +00:00
|
|
|
/* Buffer the record in the processed_rcds queue */
|
|
|
|
if (!dtls_buffer_listen_record(s, reclen, seq, align))
|
|
|
|
return -1;
|
2018-10-08 14:46:51 +00:00
|
|
|
|
2015-09-14 21:49:35 +00:00
|
|
|
ret = 1;
|
2016-08-05 17:03:17 +00:00
|
|
|
end:
|
2016-02-02 23:27:44 +00:00
|
|
|
BIO_ADDR_free(tmpclient);
|
2015-09-14 21:49:35 +00:00
|
|
|
return ret;
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
2016-03-21 15:32:40 +00:00
|
|
|
#endif
|
2013-03-11 15:34:28 +00:00
|
|
|
|
|
|
|
static int dtls1_handshake_write(SSL *s)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
|
|
|
return dtls1_do_write(s, SSL3_RT_HANDSHAKE);
|
|
|
|
}
|
2015-09-11 09:48:59 +00:00
|
|
|
|
|
|
|
int dtls1_shutdown(SSL *s)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
#ifndef OPENSSL_NO_SCTP
|
|
|
|
BIO *wbio;
|
|
|
|
|
|
|
|
wbio = SSL_get_wbio(s);
|
|
|
|
if (wbio != NULL && BIO_dgram_is_sctp(wbio) &&
|
|
|
|
!(s->shutdown & SSL_SENT_SHUTDOWN)) {
|
|
|
|
ret = BIO_dgram_sctp_wait_for_dry(wbio);
|
|
|
|
if (ret < 0)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
if (ret == 0)
|
|
|
|
BIO_ctrl(SSL_get_wbio(s), BIO_CTRL_DGRAM_SCTP_SAVE_SHUTDOWN, 1,
|
|
|
|
NULL);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
ret = ssl3_shutdown(s);
|
|
|
|
#ifndef OPENSSL_NO_SCTP
|
|
|
|
BIO_ctrl(SSL_get_wbio(s), BIO_CTRL_DGRAM_SCTP_SAVE_SHUTDOWN, 0, NULL);
|
|
|
|
#endif
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
int dtls1_query_mtu(SSL *s)
|
|
|
|
{
|
|
|
|
if (s->d1->link_mtu) {
|
|
|
|
s->d1->mtu =
|
|
|
|
s->d1->link_mtu - BIO_dgram_get_mtu_overhead(SSL_get_wbio(s));
|
|
|
|
s->d1->link_mtu = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* AHA! Figure out the MTU, and stick to the right size */
|
|
|
|
if (s->d1->mtu < dtls1_min_mtu(s)) {
|
|
|
|
if (!(SSL_get_options(s) & SSL_OP_NO_QUERY_MTU)) {
|
|
|
|
s->d1->mtu =
|
|
|
|
BIO_ctrl(SSL_get_wbio(s), BIO_CTRL_DGRAM_QUERY_MTU, 0, NULL);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* I've seen the kernel return bogus numbers when it doesn't know
|
|
|
|
* (initial write), so just make sure we have a reasonable number
|
|
|
|
*/
|
|
|
|
if (s->d1->mtu < dtls1_min_mtu(s)) {
|
|
|
|
/* Set to min mtu */
|
|
|
|
s->d1->mtu = dtls1_min_mtu(s);
|
|
|
|
BIO_ctrl(SSL_get_wbio(s), BIO_CTRL_DGRAM_SET_MTU,
|
2016-10-06 18:17:54 +00:00
|
|
|
(long)s->d1->mtu, NULL);
|
2015-09-11 09:48:59 +00:00
|
|
|
}
|
|
|
|
} else
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2016-09-07 10:34:39 +00:00
|
|
|
static size_t dtls1_link_min_mtu(void)
|
2015-09-11 09:48:59 +00:00
|
|
|
{
|
|
|
|
return (g_probable_mtu[(sizeof(g_probable_mtu) /
|
|
|
|
sizeof(g_probable_mtu[0])) - 1]);
|
|
|
|
}
|
|
|
|
|
2016-09-07 10:34:39 +00:00
|
|
|
size_t dtls1_min_mtu(SSL *s)
|
2015-09-11 09:48:59 +00:00
|
|
|
{
|
|
|
|
return dtls1_link_min_mtu() - BIO_dgram_get_mtu_overhead(SSL_get_wbio(s));
|
|
|
|
}
|
2016-10-05 23:44:59 +00:00
|
|
|
|
|
|
|
size_t DTLS_get_data_mtu(const SSL *s)
|
|
|
|
{
|
|
|
|
size_t mac_overhead, int_overhead, blocksize, ext_overhead;
|
|
|
|
const SSL_CIPHER *ciph = SSL_get_current_cipher(s);
|
|
|
|
size_t mtu = s->d1->mtu;
|
|
|
|
|
|
|
|
if (ciph == NULL)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (!ssl_cipher_get_overhead(ciph, &mac_overhead, &int_overhead,
|
|
|
|
&blocksize, &ext_overhead))
|
|
|
|
return 0;
|
|
|
|
|
2017-02-03 14:06:20 +00:00
|
|
|
if (SSL_READ_ETM(s))
|
2016-10-05 23:44:59 +00:00
|
|
|
ext_overhead += mac_overhead;
|
|
|
|
else
|
|
|
|
int_overhead += mac_overhead;
|
|
|
|
|
|
|
|
/* Subtract external overhead (e.g. IV/nonce, separate MAC) */
|
|
|
|
if (ext_overhead + DTLS1_RT_HEADER_LENGTH >= mtu)
|
|
|
|
return 0;
|
|
|
|
mtu -= ext_overhead + DTLS1_RT_HEADER_LENGTH;
|
|
|
|
|
|
|
|
/* Round encrypted payload down to cipher block size (for CBC etc.)
|
|
|
|
* No check for overflow since 'mtu % blocksize' cannot exceed mtu. */
|
|
|
|
if (blocksize)
|
|
|
|
mtu -= (mtu % blocksize);
|
|
|
|
|
|
|
|
/* Subtract internal overhead (e.g. CBC padding len byte) */
|
|
|
|
if (int_overhead >= mtu)
|
|
|
|
return 0;
|
|
|
|
mtu -= int_overhead;
|
|
|
|
|
|
|
|
return mtu;
|
|
|
|
}
|
2017-09-06 06:30:00 +00:00
|
|
|
|
|
|
|
void DTLS_set_timer_cb(SSL *s, DTLS_timer_cb cb)
|
|
|
|
{
|
|
|
|
s->d1->timer_cb = cb;
|
|
|
|
}
|