GNUnet  0.11.x
Data Structures | Macros | Functions
gnunet-service-cadet_tunnels.c File Reference

Information we track per tunnel. More...

#include "platform.h"
#include "gnunet_util_lib.h"
#include "gnunet_statistics_service.h"
#include "gnunet_signatures.h"
#include "cadet_protocol.h"
#include "gnunet-service-cadet_channel.h"
#include "gnunet-service-cadet_connection.h"
#include "gnunet-service-cadet_tunnels.h"
#include "gnunet-service-cadet_peer.h"
#include "gnunet-service-cadet_paths.h"
Include dependency graph for gnunet-service-cadet_tunnels.c:

Go to the source code of this file.

Data Structures

struct  CadetTunnelSkippedKey
 Struct to old keys for skipped messages while advancing the Axolotl ratchet. More...
 
struct  CadetTunnelAxolotl
 Axolotl data, according to https://github.com/trevp/axolotl/wiki . More...
 
struct  CadetTunnelQueueEntry
 Struct used to save messages in a non-ready tunnel to send once connected. More...
 
struct  CadetTunnel
 Struct containing all information regarding a tunnel to a peer. More...
 
struct  EvaluationSummary
 Closure for evaluate_connection. More...
 
struct  ChanIterCls
 Closure for iterate_channels_cb. More...
 

Macros

#define LOG(level, ...)   GNUNET_log_from (level, "cadet-tun", __VA_ARGS__)
 
#define MAX_UNVERIFIED_ATTEMPTS   16
 How often do we try to decrypt payload with unverified key material? Used to limit CPU increase upon receiving bogus KX. More...
 
#define IDLE_DESTROY_DELAY
 How long do we wait until tearing down an idle tunnel? More...
 
#define INITIAL_KX_RETRY_DELAY
 How long do we wait initially before retransmitting the KX? TODO: replace by 2 RTT if/once we have connection-level RTT data! More...
 
#define MAX_SKIPPED_KEYS   64
 Maximum number of skipped keys we keep in memory per tunnel. More...
 
#define MAX_KEY_GAP   256
 Maximum number of keys (and thus ratchet steps) we are willing to skip before we decide this is either a bogus packet or a DoS-attempt. More...
 
#define HIGH_BIT   0x8000000
 
#define LOG2(level, ...)
 

Functions

static int alice_or_betty (const struct GNUNET_PeerIdentity *other)
 Am I Alice or Betty (some call her Bob), or talking to myself? More...
 
static void mark_connection_unready (struct CadetTConnection *ct)
 Connection ct is now unready, clear it's ready flag and move it from the ready DLL to the busy DLL. More...
 
const char * GCT_2s (const struct CadetTunnel *t)
 Get the static string for the peer this tunnel is directed. More...
 
static const char * estate2s (enum CadetTunnelEState es)
 Get string description for tunnel encryption state. More...
 
struct CadetPeerGCT_get_destination (struct CadetTunnel *t)
 Return the peer to which this tunnel goes. More...
 
unsigned int GCT_count_channels (struct CadetTunnel *t)
 Count channels of a tunnel. More...
 
struct CadetChannellookup_channel (struct CadetTunnel *t, struct GNUNET_CADET_ChannelTunnelNumber ctn)
 Lookup a channel by its ctn. More...
 
unsigned int GCT_count_any_connections (const struct CadetTunnel *t)
 Count all created connections of a tunnel. More...
 
static struct CadetTConnectionget_ready_connection (struct CadetTunnel *t)
 Find first connection that is ready in the list of our connections. More...
 
enum CadetTunnelEState GCT_get_estate (struct CadetTunnel *t)
 Get the encryption state of a tunnel. More...
 
static void trigger_transmissions (void *cls)
 Called when either we have a new connection, or a new message in the queue, or some existing connection has transmission capacity. More...
 
static void new_ephemeral (struct CadetTunnelAxolotl *ax)
 Create a new Axolotl ephemeral (ratchet) key. More...
 
static void t_hmac (const void *plaintext, size_t size, uint32_t iv, const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_ShortHashCode *hmac)
 Calculate HMAC. More...
 
static void t_ax_hmac_hash (const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_HashCode *hash, const void *source, unsigned int len)
 Perform a HMAC. More...
 
static void t_hmac_derive_key (const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_CRYPTO_SymmetricSessionKey *out, const void *source, unsigned int len)
 Derive a symmetric encryption key from an HMAC-HASH. More...
 
static void t_ax_encrypt (struct CadetTunnelAxolotl *ax, void *dst, const void *src, size_t size)
 Encrypt data with the axolotl tunnel key. More...
 
static void t_ax_decrypt (struct CadetTunnelAxolotl *ax, void *dst, const void *src, size_t size)
 Decrypt data with the axolotl tunnel key. More...
 
static void t_h_encrypt (struct CadetTunnelAxolotl *ax, struct GNUNET_CADET_TunnelEncryptedMessage *msg)
 Encrypt header with the axolotl header key. More...
 
static void t_h_decrypt (struct CadetTunnelAxolotl *ax, const struct GNUNET_CADET_TunnelEncryptedMessage *src, struct GNUNET_CADET_TunnelEncryptedMessage *dst)
 Decrypt header with the current axolotl header key. More...
 
static void delete_skipped_key (struct CadetTunnelAxolotl *ax, struct CadetTunnelSkippedKey *key)
 Delete a key from the list of skipped keys. More...
 
static ssize_t try_old_ax_keys (struct CadetTunnelAxolotl *ax, void *dst, const struct GNUNET_CADET_TunnelEncryptedMessage *src, size_t size)
 Decrypt and verify data with the appropriate tunnel key and verify that the data has not been altered since it was sent by the remote peer. More...
 
static void store_skipped_key (struct CadetTunnelAxolotl *ax, const struct GNUNET_CRYPTO_SymmetricSessionKey *HKr)
 Delete a key from the list of skipped keys. More...
 
static int store_ax_keys (struct CadetTunnelAxolotl *ax, const struct GNUNET_CRYPTO_SymmetricSessionKey *HKr, uint32_t Np)
 Stage skipped AX keys and calculate the message key. More...
 
static ssize_t t_ax_decrypt_and_validate (struct CadetTunnelAxolotl *ax, void *dst, const struct GNUNET_CADET_TunnelEncryptedMessage *src, size_t size)
 Decrypt and verify data with the appropriate tunnel key and verify that the data has not been altered since it was sent by the remote peer. More...
 
static int notify_tunnel_up_cb (void *cls, uint32_t key, void *value)
 Our tunnel became ready for the first time, notify channels that have been waiting. More...
 
void GCT_change_estate (struct CadetTunnel *t, enum CadetTunnelEState state)
 Change the tunnel encryption state. More...
 
static void send_kx (struct CadetTunnel *t, struct CadetTConnection *ct, struct CadetTunnelAxolotl *ax)
 Send a KX message. More...
 
static void send_kx_auth (struct CadetTunnel *t, struct CadetTConnection *ct, struct CadetTunnelAxolotl *ax, int force_reply)
 Send a KX_AUTH message. More...
 
static void cleanup_ax (struct CadetTunnelAxolotl *ax)
 Cleanup state used by ax. More...
 
static int update_ax_by_kx (struct CadetTunnelAxolotl *ax, const struct GNUNET_PeerIdentity *pid, const struct GNUNET_CRYPTO_EcdhePublicKey *ephemeral_key, const struct GNUNET_CRYPTO_EcdhePublicKey *ratchet_key)
 Update our Axolotl key state based on the KX data we received. More...
 
static void retry_kx (void *cls)
 Try to redo the KX or KX_AUTH handshake, if we can. More...
 
void GCT_handle_kx (struct CadetTConnection *ct, const struct GNUNET_CADET_TunnelKeyExchangeMessage *msg)
 Handle KX message that lacks authentication (and which will thus only be considered authenticated after we respond with our own KX_AUTH and finally successfully decrypt payload). More...
 
void GCT_handle_kx_auth (struct CadetTConnection *ct, const struct GNUNET_CADET_TunnelKeyExchangeAuthMessage *msg)
 Handle KX_AUTH message. More...
 
static struct GNUNET_CADET_ChannelTunnelNumber get_next_free_ctn (struct CadetTunnel *t)
 Compute the next free channel tunnel number for this tunnel. More...
 
struct GNUNET_CADET_ChannelTunnelNumber GCT_add_channel (struct CadetTunnel *t, struct CadetChannel *ch)
 Add a channel to a tunnel, and notify channel that we are ready for transmission if we are already up. More...
 
void GCT_connection_lost (struct CadetTConnection *ct)
 We lost a connection, remove it from our list and clean up the connection object itself. More...
 
static void destroy_t_connection (void *cls, struct CadetTConnection *ct)
 Clean up connection ct of a tunnel. More...
 
static void destroy_tunnel (void *cls)
 This tunnel is no longer used, destroy it. More...
 
void GCT_remove_channel (struct CadetTunnel *t, struct CadetChannel *ch, struct GNUNET_CADET_ChannelTunnelNumber ctn)
 Remove a channel from a tunnel. More...
 
static int destroy_remaining_channels (void *cls, uint32_t key, void *value)
 Destroy remaining channels during shutdown. More...
 
void GCT_destroy_tunnel_now (struct CadetTunnel *t)
 Destroys the tunnel t now, without delay. More...
 
static void try_send_normal_payload (struct CadetTunnel *t, struct CadetTConnection *ct)
 Send normal payload from queue in t via connection ct. More...
 
static void connection_ready_cb (void *cls, int is_ready)
 A connection is is_ready for transmission. More...
 
static void evaluate_connection (void *cls, struct CadetTConnection *ct)
 Evaluate a connection, updating our summary information in cls about what kinds of connections we have. More...
 
static int consider_path_cb (void *cls, struct CadetPeerPath *path, unsigned int off)
 Consider using the path p for the tunnel t. More...
 
static void maintain_connections_cb (void *cls)
 Function called to maintain the connections underlying our tunnel. More...
 
void GCT_consider_path (struct CadetTunnel *t, struct CadetPeerPath *p, unsigned int off)
 Consider using the path p for the tunnel t. More...
 
static void handle_plaintext_keepalive (void *cls, const struct GNUNET_MessageHeader *msg)
 We got a keepalive. More...
 
static int check_plaintext_data (void *cls, const struct GNUNET_CADET_ChannelAppDataMessage *msg)
 Check that msg is well-formed. More...
 
static void handle_plaintext_data (void *cls, const struct GNUNET_CADET_ChannelAppDataMessage *msg)
 We received payload data for a channel. More...
 
static void handle_plaintext_data_ack (void *cls, const struct GNUNET_CADET_ChannelDataAckMessage *ack)
 We received an acknowledgement for data we sent on a channel. More...
 
static void handle_plaintext_channel_open (void *cls, const struct GNUNET_CADET_ChannelOpenMessage *copen)
 We have received a request to open a channel to a port from another peer. More...
 
void GCT_send_channel_destroy (struct CadetTunnel *t, struct GNUNET_CADET_ChannelTunnelNumber ctn)
 Send a DESTROY message via the tunnel. More...
 
static void handle_plaintext_channel_open_ack (void *cls, const struct GNUNET_CADET_ChannelOpenAckMessage *cm)
 We have received confirmation from the target peer that the given channel could be established (the port is open). More...
 
static void handle_plaintext_channel_destroy (void *cls, const struct GNUNET_CADET_ChannelDestroyMessage *cm)
 We received a message saying that a channel should be destroyed. More...
 
static int handle_decrypted (void *cls, const struct GNUNET_MessageHeader *msg)
 Handles a message we decrypted, by injecting it into our message queue (which will do the dispatching). More...
 
static void decrypted_error_cb (void *cls, enum GNUNET_MQ_Error error)
 Function called if we had an error processing an incoming decrypted message. More...
 
struct CadetTunnelGCT_create_tunnel (struct CadetPeer *destination)
 Create a tunnel to destionation. More...
 
int GCT_add_inbound_connection (struct CadetTunnel *t, const struct GNUNET_CADET_ConnectionTunnelIdentifier *cid, struct CadetPeerPath *path)
 Add a connection to the tunnel. More...
 
void GCT_handle_encrypted (struct CadetTConnection *ct, const struct GNUNET_CADET_TunnelEncryptedMessage *msg)
 Handle encrypted message. More...
 
struct CadetTunnelQueueEntryGCT_send (struct CadetTunnel *t, const struct GNUNET_MessageHeader *message, GCT_SendContinuation cont, void *cont_cls)
 Sends an already built message on a tunnel, encrypting it and choosing the best connection if not provided. More...
 
void GCT_send_cancel (struct CadetTunnelQueueEntry *tq)
 Cancel a previously sent message while it's in the queue. More...
 
void GCT_iterate_connections (struct CadetTunnel *t, GCT_ConnectionIterator iter, void *iter_cls)
 Iterate over all connections of a tunnel. More...
 
static int iterate_channels_cb (void *cls, uint32_t key, void *value)
 Helper function for GCT_iterate_channels. More...
 
void GCT_iterate_channels (struct CadetTunnel *t, GCT_ChannelIterator iter, void *iter_cls)
 Iterate over all channels of a tunnel. More...
 
static int debug_channel (void *cls, uint32_t key, void *value)
 Call GCCH_debug() on a channel. More...
 
void GCT_debug (const struct CadetTunnel *t, enum GNUNET_ErrorType level)
 Log all possible info about the tunnel state. More...
 

Detailed Description

Information we track per tunnel.

Author
Bartlomiej Polot
Christian Grothoff

FIXME:

Definition in file gnunet-service-cadet_tunnels.c.

Macro Definition Documentation

◆ LOG

#define LOG (   level,
  ... 
)    GNUNET_log_from (level, "cadet-tun", __VA_ARGS__)

◆ MAX_UNVERIFIED_ATTEMPTS

#define MAX_UNVERIFIED_ATTEMPTS   16

How often do we try to decrypt payload with unverified key material? Used to limit CPU increase upon receiving bogus KX.

Definition at line 52 of file gnunet-service-cadet_tunnels.c.

Referenced by GCT_handle_encrypted().

◆ IDLE_DESTROY_DELAY

#define IDLE_DESTROY_DELAY
Value:
#define GNUNET_TIME_UNIT_SECONDS
One second.
struct GNUNET_TIME_Relative GNUNET_TIME_relative_multiply(struct GNUNET_TIME_Relative rel, unsigned long long factor)
Multiply relative time by a given factor.
Definition: time.c:442

How long do we wait until tearing down an idle tunnel?

Definition at line 57 of file gnunet-service-cadet_tunnels.c.

Referenced by connection_ready_cb(), and GCT_remove_channel().

◆ INITIAL_KX_RETRY_DELAY

#define INITIAL_KX_RETRY_DELAY
Value:
struct GNUNET_TIME_Relative GNUNET_TIME_relative_multiply(struct GNUNET_TIME_Relative rel, unsigned long long factor)
Multiply relative time by a given factor.
Definition: time.c:442
#define GNUNET_TIME_UNIT_MILLISECONDS
One millisecond.

How long do we wait initially before retransmitting the KX? TODO: replace by 2 RTT if/once we have connection-level RTT data!

Definition at line 64 of file gnunet-service-cadet_tunnels.c.

Referenced by GCT_create_tunnel().

◆ MAX_SKIPPED_KEYS

#define MAX_SKIPPED_KEYS   64

Maximum number of skipped keys we keep in memory per tunnel.

Definition at line 70 of file gnunet-service-cadet_tunnels.c.

Referenced by store_ax_keys().

◆ MAX_KEY_GAP

#define MAX_KEY_GAP   256

Maximum number of keys (and thus ratchet steps) we are willing to skip before we decide this is either a bogus packet or a DoS-attempt.

Definition at line 76 of file gnunet-service-cadet_tunnels.c.

Referenced by store_ax_keys().

◆ HIGH_BIT

#define HIGH_BIT   0x8000000

Referenced by get_next_free_ctn().

◆ LOG2

#define LOG2 (   level,
  ... 
)
Value:
GNUNET_log_from_nocheck (level, "cadet-tun", \
__VA_ARGS__)
void GNUNET_log_from_nocheck(enum GNUNET_ErrorType kind, const char *comp, const char *message,...)
Log function that specifies an alternative component.

Definition at line 3661 of file gnunet-service-cadet_tunnels.c.

Referenced by GCT_debug().

Function Documentation

◆ alice_or_betty()

static int alice_or_betty ( const struct GNUNET_PeerIdentity other)
static

Am I Alice or Betty (some call her Bob), or talking to myself?

Parameters
otherthe other peer
Returns
GNUNET_YES for Alice, GNUNET_NO for Betty, GNUNET_SYSERR if talking to myself

Definition at line 468 of file gnunet-service-cadet_tunnels.c.

References GNUNET_break_op, GNUNET_memcmp, GNUNET_NO, GNUNET_SYSERR, GNUNET_YES, and my_full_id.

Referenced by GCT_handle_kx(), send_kx(), and update_ax_by_kx().

469 {
470  if (0 > GNUNET_memcmp (&my_full_id,
471  other))
472  return GNUNET_YES;
473  else if (0 < GNUNET_memcmp (&my_full_id,
474  other))
475  return GNUNET_NO;
476  else
477  {
478  GNUNET_break_op (0);
479  return GNUNET_SYSERR;
480  }
481 }
struct GNUNET_PeerIdentity my_full_id
Local peer own ID.
#define GNUNET_NO
Definition: gnunet_common.h:78
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
#define GNUNET_SYSERR
Definition: gnunet_common.h:76
#define GNUNET_memcmp(a, b)
Compare memory in a and b, where both must be of the same pointer type.
#define GNUNET_YES
Definition: gnunet_common.h:77
Here is the caller graph for this function:

◆ mark_connection_unready()

static void mark_connection_unready ( struct CadetTConnection ct)
static

Connection ct is now unready, clear it's ready flag and move it from the ready DLL to the busy DLL.

Parameters
ctconnection to move to unready status

Definition at line 491 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::connection_busy_head, CadetTunnel::connection_busy_tail, CadetTunnel::connection_ready_head, CadetTunnel::connection_ready_tail, GNUNET_assert, GNUNET_CONTAINER_DLL_insert, GNUNET_CONTAINER_DLL_remove, GNUNET_NO, GNUNET_YES, CadetTConnection::is_ready, CadetTunnel::num_busy_connections, CadetTunnel::num_ready_connections, t, and CadetTConnection::t.

Referenced by connection_ready_cb(), send_kx(), send_kx_auth(), and try_send_normal_payload().

492 {
493  struct CadetTunnel *t = ct->t;
494 
498  ct);
501  ct->is_ready = GNUNET_NO;
504  ct);
506 }
#define GNUNET_CONTAINER_DLL_remove(head, tail, element)
Remove an element from a DLL.
struct CadetTConnection * connection_ready_tail
DLL of ready connections that are actively used to reach the destination peer.
#define GNUNET_CONTAINER_DLL_insert(head, tail, element)
Insert an element at the head of a DLL.
int is_ready
Is the connection currently ready for transmission?
unsigned int num_ready_connections
Number of connections in the connection_ready_head DLL.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct CadetTConnection * connection_ready_head
DLL of ready connections that are actively used to reach the destination peer.
#define GNUNET_NO
Definition: gnunet_common.h:78
static struct GNUNET_SCHEDULER_Task * t
Main task.
struct CadetTConnection * connection_busy_head
DLL of connections that we maintain that might be used to reach the destination peer.
struct CadetTunnel * t
Tunnel this connection belongs to.
Struct containing all information regarding a tunnel to a peer.
#define GNUNET_YES
Definition: gnunet_common.h:77
unsigned int num_busy_connections
Number of connections in the connection_busy_head DLL.
struct CadetTConnection * connection_busy_tail
DLL of connections that we maintain that might be used to reach the destination peer.
Here is the caller graph for this function:

◆ GCT_2s()

const char* GCT_2s ( const struct CadetTunnel t)

Get the static string for the peer this tunnel is directed.

Parameters
tTunnel.
Returns
Static string the destination peer's ID.

Definition at line 517 of file gnunet-service-cadet_tunnels.c.

References buf, CadetTunnel::destination, GCP_get_id(), GNUNET_i2s(), and GNUNET_snprintf().

Referenced by connection_ready_cb(), consider_path_cb(), destroy_tunnel(), GCC_2s(), GCCH_bind(), GCCH_channel_local_new(), GCCH_debug(), GCP_drop_tunnel(), GCT_add_channel(), GCT_add_inbound_connection(), GCT_change_estate(), GCT_consider_path(), GCT_debug(), GCT_handle_encrypted(), GCT_handle_kx(), GCT_handle_kx_auth(), GCT_remove_channel(), GCT_send(), handle_plaintext_channel_destroy(), handle_plaintext_channel_open(), handle_plaintext_channel_open_ack(), handle_plaintext_keepalive(), maintain_connections_cb(), retry_kx(), send_keepalive(), send_kx(), send_kx_auth(), and try_send_normal_payload().

518 {
519  static char buf[64];
520 
521  if (NULL == t)
522  return "Tunnel(NULL)";
523  GNUNET_snprintf (buf,
524  sizeof(buf),
525  "Tunnel %s",
527  return buf;
528 }
int GNUNET_snprintf(char *buf, size_t size, const char *format,...)
Like snprintf, just aborts if the buffer is of insufficient size.
static char buf[2048]
struct CadetPeer * destination
Destination of the tunnel.
const char * GNUNET_i2s(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
const struct GNUNET_PeerIdentity * GCP_get_id(struct CadetPeer *cp)
Obtain the peer identity for a struct CadetPeer.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ estate2s()

static const char* estate2s ( enum CadetTunnelEState  es)
static

Get string description for tunnel encryption state.

Parameters
esTunnel state.
Returns
String representation.

Definition at line 539 of file gnunet-service-cadet_tunnels.c.

References buf, CADET_TUNNEL_KEY_AX_AUTH_SENT, CADET_TUNNEL_KEY_AX_RECV, CADET_TUNNEL_KEY_AX_SENT, CADET_TUNNEL_KEY_AX_SENT_AND_RECV, CADET_TUNNEL_KEY_OK, CADET_TUNNEL_KEY_UNINITIALIZED, and GNUNET_snprintf().

Referenced by connection_ready_cb(), GCT_change_estate(), GCT_debug(), retry_kx(), and send_kx().

540 {
541  static char buf[32];
542 
543  switch (es)
544  {
546  return "CADET_TUNNEL_KEY_UNINITIALIZED";
547 
549  return "CADET_TUNNEL_KEY_AX_RECV";
550 
552  return "CADET_TUNNEL_KEY_AX_SENT";
553 
555  return "CADET_TUNNEL_KEY_AX_SENT_AND_RECV";
556 
558  return "CADET_TUNNEL_KEY_AX_AUTH_SENT";
559 
560  case CADET_TUNNEL_KEY_OK:
561  return "CADET_TUNNEL_KEY_OK";
562 
563  default:
564  GNUNET_snprintf (buf,
565  sizeof(buf),
566  "%u (UNKNOWN STATE)",
567  es);
568  return buf;
569  }
570 }
int GNUNET_snprintf(char *buf, size_t size, const char *format,...)
Like snprintf, just aborts if the buffer is of insufficient size.
KX received and we sent KX_AUTH back, but we got no traffic yet, so we&#39;re waiting for either KX_AUTH ...
KX message sent, waiting for other peer&#39;s KX_AUTH.
static char buf[2048]
Handshake completed: session key available.
KX message sent and received, trying to send back KX_AUTH.
Uninitialized status, we need to send KX.
KX message received, trying to send back KX_AUTH.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_get_destination()

struct CadetPeer* GCT_get_destination ( struct CadetTunnel t)

Return the peer to which this tunnel goes.

Parameters
ta tunnel
Returns
the destination of the tunnel

Definition at line 580 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::destination.

Referenced by GCCH_2s(), GCCH_bind(), GCCH_channel_incoming_new(), get_next_free_ctn(), and timeout_closed_cb().

581 {
582  return t->destination;
583 }
struct CadetPeer * destination
Destination of the tunnel.
Here is the caller graph for this function:

◆ GCT_count_channels()

unsigned int GCT_count_channels ( struct CadetTunnel t)

Count channels of a tunnel.

Return the number of channels using a tunnel.

Parameters
tTunnel on which to count.
Returns
Number of channels.

Definition at line 594 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::channels, and GNUNET_CONTAINER_multihashmap32_size().

Referenced by connection_ready_cb(), destroy_tunnel(), GCT_destroy_tunnel_now(), GCT_remove_channel(), get_all_tunnels_iterator(), and retry_kx().

595 {
597 }
struct GNUNET_CONTAINER_MultiHashMap32 * channels
Channels inside this tunnel.
unsigned int GNUNET_CONTAINER_multihashmap32_size(const struct GNUNET_CONTAINER_MultiHashMap32 *map)
Get the number of key-value pairs in the map.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ lookup_channel()

struct CadetChannel* lookup_channel ( struct CadetTunnel t,
struct GNUNET_CADET_ChannelTunnelNumber  ctn 
)

Lookup a channel by its ctn.

Parameters
ttunnel to look in
ctnnumber of channel to find
Returns
NULL if channel does not exist

Definition at line 608 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::channels, GNUNET_CADET_ChannelTunnelNumber::cn, and GNUNET_CONTAINER_multihashmap32_get().

Referenced by handle_plaintext_channel_destroy(), handle_plaintext_channel_open_ack(), handle_plaintext_data(), and handle_plaintext_data_ack().

610 {
612  ntohl (ctn.cn));
613 }
struct GNUNET_CONTAINER_MultiHashMap32 * channels
Channels inside this tunnel.
uint32_t cn
Which number does this channel have that uniquely identfies it within its tunnel, in network byte ord...
void * GNUNET_CONTAINER_multihashmap32_get(const struct GNUNET_CONTAINER_MultiHashMap32 *map, uint32_t key)
Given a key find a value in the map matching the key.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_count_any_connections()

unsigned int GCT_count_any_connections ( const struct CadetTunnel t)

Count all created connections of a tunnel.

Return the number of connections available for a tunnel.

Not necessarily ready connections!

Parameters
tTunnel on which to count.
Returns
Number of connections created, either being established or ready.

Definition at line 624 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::num_busy_connections, and CadetTunnel::num_ready_connections.

Referenced by consider_path_cb(), GCT_debug(), get_all_tunnels_iterator(), and maintain_connections_cb().

625 {
627 }
unsigned int num_ready_connections
Number of connections in the connection_ready_head DLL.
unsigned int num_busy_connections
Number of connections in the connection_busy_head DLL.
Here is the caller graph for this function:

◆ get_ready_connection()

static struct CadetTConnection* get_ready_connection ( struct CadetTunnel t)
static

Find first connection that is ready in the list of our connections.

Picks ready connections round-robin.

Parameters
ttunnel to search
Returns
NULL if we have no connection that is ready

Definition at line 638 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::connection_ready_head, GNUNET_assert, GNUNET_YES, and CadetTConnection::is_ready.

Referenced by send_kx(), send_kx_auth(), and trigger_transmissions().

639 {
640  struct CadetTConnection *hd = t->connection_ready_head;
641 
642  GNUNET_assert ((NULL == hd) ||
643  (GNUNET_YES == hd->is_ready));
644  return hd;
645 }
int is_ready
Is the connection currently ready for transmission?
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct CadetTConnection * connection_ready_head
DLL of ready connections that are actively used to reach the destination peer.
Entry in list of connections used by tunnel, with metadata.
#define GNUNET_YES
Definition: gnunet_common.h:77
Here is the caller graph for this function:

◆ GCT_get_estate()

enum CadetTunnelEState GCT_get_estate ( struct CadetTunnel t)

Get the encryption state of a tunnel.

Parameters
tTunnel.
Returns
Tunnel's encryption state.

Definition at line 656 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::estate, and trigger_transmissions().

Referenced by get_all_tunnels_iterator(), and send_keepalive().

657 {
658  return t->estate;
659 }
enum CadetTunnelEState estate
State of the tunnel encryption.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ trigger_transmissions()

static void trigger_transmissions ( void *  cls)
static

Called when either we have a new connection, or a new message in the queue, or some existing connection has transmission capacity.

Looks at our message queue and if there is a message, picks a connection to send it on.

Parameters
clsthe struct CadetTunnel to process messages on

Definition at line 2510 of file gnunet-service-cadet_tunnels.c.

References get_ready_connection(), CadetTunnel::send_task, CadetTunnel::tq_head, and try_send_normal_payload().

Referenced by GCT_change_estate(), GCT_get_estate(), GCT_handle_encrypted(), and GCT_send().

2511 {
2512  struct CadetTunnel *t = cls;
2513  struct CadetTConnection *ct;
2514 
2515  t->send_task = NULL;
2516  if (NULL == t->tq_head)
2517  return; /* no messages pending right now */
2518  ct = get_ready_connection (t);
2519  if (NULL == ct)
2520  return; /* no connections ready */
2522  ct);
2523 }
static struct CadetTConnection * get_ready_connection(struct CadetTunnel *t)
Find first connection that is ready in the list of our connections.
static struct GNUNET_SCHEDULER_Task * t
Main task.
Struct containing all information regarding a tunnel to a peer.
struct CadetTunnelQueueEntry * tq_head
Queued messages, to transmit once tunnel gets connected.
Entry in list of connections used by tunnel, with metadata.
struct GNUNET_SCHEDULER_Task * send_task
Task to send messages from queue (if possible).
static void try_send_normal_payload(struct CadetTunnel *t, struct CadetTConnection *ct)
Send normal payload from queue in t via connection ct.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ new_ephemeral()

static void new_ephemeral ( struct CadetTunnelAxolotl ax)
static

Create a new Axolotl ephemeral (ratchet) key.

Parameters
axkey material to update

Definition at line 683 of file gnunet-service-cadet_tunnels.c.

References CadetTunnelAxolotl::DHRs, GNUNET_assert, GNUNET_CRYPTO_ecdhe_key_create2(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_OK, and LOG.

Referenced by GCT_create_tunnel(), and t_ax_encrypt().

684 {
686  "Creating new ephemeral ratchet key (DHRs)\n");
689 }
int GNUNET_CRYPTO_ecdhe_key_create2(struct GNUNET_CRYPTO_EcdhePrivateKey *pk)
Create a new private key.
Definition: crypto_ecc.c:630
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
struct GNUNET_CRYPTO_EcdhePrivateKey DHRs
ECDH Ratchet key (our private key in the current DH).
#define LOG(level,...)
Here is the call graph for this function:
Here is the caller graph for this function:

◆ t_hmac()

static void t_hmac ( const void *  plaintext,
size_t  size,
uint32_t  iv,
const struct GNUNET_CRYPTO_SymmetricSessionKey key,
struct GNUNET_ShortHashCode hmac 
)
static

Calculate HMAC.

Parameters
plaintextContent to HMAC.
sizeSize of plaintext.
ivInitialization vector for the message.
keyKey to use.
hmac[out]Destination to store the HMAC.

Definition at line 702 of file gnunet-service-cadet_tunnels.c.

References ctx, GNUNET_CRYPTO_hmac(), GNUNET_CRYPTO_hmac_derive_key(), and GNUNET_memcpy.

Referenced by GCT_send(), t_ax_decrypt_and_validate(), and try_old_ax_keys().

707 {
708  static const char ctx[] = "cadet authentication key";
709  struct GNUNET_CRYPTO_AuthKey auth_key;
710  struct GNUNET_HashCode hash;
711 
713  key,
714  &iv, sizeof(iv),
715  key, sizeof(*key),
716  ctx, sizeof(ctx),
717  NULL);
718  /* Two step: GNUNET_ShortHash is only 256 bits,
719  GNUNET_HashCode is 512, so we truncate. */
720  GNUNET_CRYPTO_hmac (&auth_key,
721  plaintext,
722  size,
723  &hash);
724  GNUNET_memcpy (hmac,
725  &hash,
726  sizeof(*hmac));
727 }
#define GNUNET_memcpy(dst, src, n)
Call memcpy() but check for n being 0 first.
void GNUNET_CRYPTO_hmac(const struct GNUNET_CRYPTO_AuthKey *key, const void *plaintext, size_t plaintext_len, struct GNUNET_HashCode *hmac)
Calculate HMAC of a message (RFC 2104)
Definition: crypto_hash.c:438
static struct GNUNET_DNSSTUB_Context * ctx
Context for DNS resolution.
A 512-bit hashcode.
static unsigned int size
Size of the "table".
Definition: peer.c:67
void GNUNET_CRYPTO_hmac_derive_key(struct GNUNET_CRYPTO_AuthKey *key, const struct GNUNET_CRYPTO_SymmetricSessionKey *rkey, const void *salt, size_t salt_len,...)
Derive an authentication key.
Definition: crypto_hash.c:356
type for (message) authentication keys
Here is the call graph for this function:
Here is the caller graph for this function:

◆ t_ax_hmac_hash()

static void t_ax_hmac_hash ( const struct GNUNET_CRYPTO_SymmetricSessionKey key,
struct GNUNET_HashCode hash,
const void *  source,
unsigned int  len 
)
static

Perform a HMAC.

Parameters
keyKey to use.
[out]hashResulting HMAC.
sourceSource key material (data to HMAC).
lenLength of source.

Definition at line 739 of file gnunet-service-cadet_tunnels.c.

References ctx, GNUNET_CRYPTO_hmac(), and GNUNET_CRYPTO_hmac_derive_key().

Referenced by t_ax_decrypt_and_validate(), t_ax_encrypt(), and t_hmac_derive_key().

743 {
744  static const char ctx[] = "axolotl HMAC-HASH";
745  struct GNUNET_CRYPTO_AuthKey auth_key;
746 
748  key,
749  ctx, sizeof(ctx),
750  NULL);
751  GNUNET_CRYPTO_hmac (&auth_key,
752  source,
753  len,
754  hash);
755 }
void GNUNET_CRYPTO_hmac(const struct GNUNET_CRYPTO_AuthKey *key, const void *plaintext, size_t plaintext_len, struct GNUNET_HashCode *hmac)
Calculate HMAC of a message (RFC 2104)
Definition: crypto_hash.c:438
static struct GNUNET_DNSSTUB_Context * ctx
Context for DNS resolution.
static GstElement * source
Appsrc instance into which we write data for the pipeline.
void GNUNET_CRYPTO_hmac_derive_key(struct GNUNET_CRYPTO_AuthKey *key, const struct GNUNET_CRYPTO_SymmetricSessionKey *rkey, const void *salt, size_t salt_len,...)
Derive an authentication key.
Definition: crypto_hash.c:356
type for (message) authentication keys
uint16_t len
length of data (which is always a uint32_t, but presumably this can be used to specify that fewer byt...
Here is the call graph for this function:
Here is the caller graph for this function:

◆ t_hmac_derive_key()

static void t_hmac_derive_key ( const struct GNUNET_CRYPTO_SymmetricSessionKey key,
struct GNUNET_CRYPTO_SymmetricSessionKey out,
const void *  source,
unsigned int  len 
)
static

Derive a symmetric encryption key from an HMAC-HASH.

Parameters
keyKey to use for the HMAC.
[out]outKey to generate.
sourceSource key material (data to HMAC).
lenLength of source.

Definition at line 767 of file gnunet-service-cadet_tunnels.c.

References ctx, GNUNET_CRYPTO_kdf(), and t_ax_hmac_hash().

Referenced by store_skipped_key(), t_ax_decrypt(), and t_ax_encrypt().

771 {
772  static const char ctx[] = "axolotl derive key";
773  struct GNUNET_HashCode h;
774 
775  t_ax_hmac_hash (key,
776  &h,
777  source,
778  len);
779  GNUNET_CRYPTO_kdf (out, sizeof(*out),
780  ctx, sizeof(ctx),
781  &h, sizeof(h),
782  NULL);
783 }
static struct GNUNET_ARM_Handle * h
Connection with ARM.
Definition: gnunet-arm.c:99
static struct GNUNET_DNSSTUB_Context * ctx
Context for DNS resolution.
static void t_ax_hmac_hash(const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_HashCode *hash, const void *source, unsigned int len)
Perform a HMAC.
A 512-bit hashcode.
static GstElement * source
Appsrc instance into which we write data for the pipeline.
int GNUNET_CRYPTO_kdf(void *result, size_t out_len, const void *xts, size_t xts_len, const void *skm, size_t skm_len,...)
Derive key.
Definition: crypto_kdf.c:89
uint16_t len
length of data (which is always a uint32_t, but presumably this can be used to specify that fewer byt...
Here is the call graph for this function:
Here is the caller graph for this function:

◆ t_ax_encrypt()

static void t_ax_encrypt ( struct CadetTunnelAxolotl ax,
void *  dst,
const void *  src,
size_t  size 
)
static

Encrypt data with the axolotl tunnel key.

Parameters
axkey material to use.
dstDestination with size bytes for the encrypted data.
srcSource of the plaintext. Can overlap with dst, must contain size bytes
sizeSize of the buffers at src and dst

Definition at line 795 of file gnunet-service-cadet_tunnels.c.

References CadetTunnelAxolotl::CKs, ctx, CadetTunnelAxolotl::DHRr, CadetTunnelAxolotl::DHRs, GNUNET_assert, GNUNET_CRYPTO_ecc_ecdh(), GNUNET_CRYPTO_kdf(), GNUNET_CRYPTO_symmetric_derive_iv(), GNUNET_CRYPTO_symmetric_encrypt(), GNUNET_NO, GNUNET_TIME_absolute_add(), GNUNET_TIME_absolute_get(), GNUNET_TIME_absolute_get_remaining(), GNUNET_YES, CadetTunnelAxolotl::HKs, new_ephemeral(), CadetTunnelAxolotl::NHKs, CadetTunnelAxolotl::Ns, CadetTunnelAxolotl::PNs, CadetTunnelAxolotl::ratchet_allowed, CadetTunnelAxolotl::ratchet_counter, CadetTunnelAxolotl::ratchet_expiration, CadetTunnelAxolotl::ratchet_flag, ratchet_time, GNUNET_TIME_Relative::rel_value_us, CadetTunnelAxolotl::RK, t_ax_hmac_hash(), and t_hmac_derive_key().

Referenced by GCT_send().

799 {
802  size_t out_size;
803 
804  ax->ratchet_counter++;
805  if ((GNUNET_YES == ax->ratchet_allowed) &&
806  ((ratchet_messages <= ax->ratchet_counter) ||
809  {
810  ax->ratchet_flag = GNUNET_YES;
811  }
812  if (GNUNET_YES == ax->ratchet_flag)
813  {
814  /* Advance ratchet */
815  struct GNUNET_CRYPTO_SymmetricSessionKey keys[3];
816  struct GNUNET_HashCode dh;
817  struct GNUNET_HashCode hmac;
818  static const char ctx[] = "axolotl ratchet";
819 
820  new_ephemeral (ax);
821  ax->HKs = ax->NHKs;
822 
823  /* RK, NHKs, CKs = KDF( HMAC-HASH(RK, DH(DHRs, DHRr)) ) */
825  &ax->DHRr,
826  &dh);
827  t_ax_hmac_hash (&ax->RK,
828  &hmac,
829  &dh,
830  sizeof(dh));
831  GNUNET_CRYPTO_kdf (keys, sizeof(keys),
832  ctx, sizeof(ctx),
833  &hmac, sizeof(hmac),
834  NULL);
835  ax->RK = keys[0];
836  ax->NHKs = keys[1];
837  ax->CKs = keys[2];
838 
839  ax->PNs = ax->Ns;
840  ax->Ns = 0;
841  ax->ratchet_flag = GNUNET_NO;
843  ax->ratchet_counter = 0;
846  ratchet_time);
847  }
848 
849  t_hmac_derive_key (&ax->CKs,
850  &MK,
851  "0",
852  1);
854  &MK,
855  NULL, 0,
856  NULL);
857 
858  out_size = GNUNET_CRYPTO_symmetric_encrypt (src,
859  size,
860  &MK,
861  &iv,
862  dst);
863  GNUNET_assert (size == out_size);
864  t_hmac_derive_key (&ax->CKs,
865  &ax->CKs,
866  "1",
867  1);
868 }
uint64_t rel_value_us
The actual value.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct GNUNET_TIME_Absolute ratchet_expiration
Time when the current ratchet expires and a new one is triggered (if ratchet_allowed is GNUNET_YES)...
uint32_t PNs
Previous message numbers (# of msgs sent under prev ratchet)
int GNUNET_CRYPTO_ecc_ecdh(const struct GNUNET_CRYPTO_EcdhePrivateKey *priv, const struct GNUNET_CRYPTO_EcdhePublicKey *pub, struct GNUNET_HashCode *key_material)
Derive key material from a public and a private ECC key.
Definition: crypto_ecc.c:1182
#define GNUNET_NO
Definition: gnunet_common.h:78
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_add(struct GNUNET_TIME_Absolute start, struct GNUNET_TIME_Relative duration)
Add a given relative duration to the given start time.
Definition: time.c:395
static struct GNUNET_DNSSTUB_Context * ctx
Context for DNS resolution.
static void t_ax_hmac_hash(const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_HashCode *hash, const void *source, unsigned int len)
Perform a HMAC.
struct GNUNET_TIME_Relative ratchet_time
How long until we trigger a ratched advance due to time.
ssize_t GNUNET_CRYPTO_symmetric_encrypt(const void *block, size_t size, const struct GNUNET_CRYPTO_SymmetricSessionKey *sessionkey, const struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, void *result)
Encrypt a block using a symmetric sessionkey.
static void t_hmac_derive_key(const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_CRYPTO_SymmetricSessionKey *out, const void *source, unsigned int len)
Derive a symmetric encryption key from an HMAC-HASH.
void GNUNET_CRYPTO_symmetric_derive_iv(struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, const struct GNUNET_CRYPTO_SymmetricSessionKey *skey, const void *salt, size_t salt_len,...)
Derive an IV.
A 512-bit hashcode.
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_get(void)
Get the current time.
Definition: time.c:118
int ratchet_allowed
True (GNUNET_YES) if we have received a message from the other peer that uses the keys from our last ...
static unsigned int size
Size of the "table".
Definition: peer.c:67
struct GNUNET_CRYPTO_SymmetricSessionKey RK
32-byte root key which gets updated by DH ratchet.
struct GNUNET_CRYPTO_EcdhePublicKey DHRr
ECDH Ratchet key (other peer&#39;s public key in the current DH).
struct GNUNET_CRYPTO_EcdhePrivateKey DHRs
ECDH Ratchet key (our private key in the current DH).
struct GNUNET_CRYPTO_SymmetricSessionKey HKs
32-byte header key (currently used for sending).
struct GNUNET_TIME_Relative GNUNET_TIME_absolute_get_remaining(struct GNUNET_TIME_Absolute future)
Given a timestamp in the future, how much time remains until then?
Definition: time.c:331
#define GNUNET_YES
Definition: gnunet_common.h:77
unsigned int ratchet_counter
Number of messages recieved since our last ratchet advance.
struct GNUNET_CRYPTO_SymmetricSessionKey CKs
32-byte chain keys (used for forward-secrecy) for sending messages.
static void new_ephemeral(struct CadetTunnelAxolotl *ax)
Create a new Axolotl ephemeral (ratchet) key.
int ratchet_flag
True (GNUNET_YES) if we have to send a new ratchet key in next msg.
int GNUNET_CRYPTO_kdf(void *result, size_t out_len, const void *xts, size_t xts_len, const void *skm, size_t skm_len,...)
Derive key.
Definition: crypto_kdf.c:89
struct GNUNET_CRYPTO_SymmetricSessionKey NHKs
32-byte next header key (for sending), used once the ratchet advances.
uint32_t Ns
Message number (reset to 0 with each new ratchet, next message to send).
Here is the call graph for this function:
Here is the caller graph for this function:

◆ t_ax_decrypt()

static void t_ax_decrypt ( struct CadetTunnelAxolotl ax,
void *  dst,
const void *  src,
size_t  size 
)
static

Decrypt data with the axolotl tunnel key.

Parameters
axkey material to use.
dstDestination for the decrypted data, must contain size bytes.
srcSource of the ciphertext. Can overlap with dst, must contain size bytes.
sizeSize of the src and dst buffers

Definition at line 880 of file gnunet-service-cadet_tunnels.c.

References CadetTunnelAxolotl::CKr, GNUNET_assert, GNUNET_CRYPTO_symmetric_decrypt(), GNUNET_CRYPTO_symmetric_derive_iv(), and t_hmac_derive_key().

Referenced by t_ax_decrypt_and_validate().

884 {
887  size_t out_size;
888 
889  t_hmac_derive_key (&ax->CKr,
890  &MK,
891  "0",
892  1);
894  &MK,
895  NULL, 0,
896  NULL);
897  GNUNET_assert (size >= sizeof(struct GNUNET_MessageHeader));
898  out_size = GNUNET_CRYPTO_symmetric_decrypt (src,
899  size,
900  &MK,
901  &iv,
902  dst);
903  GNUNET_assert (out_size == size);
904  t_hmac_derive_key (&ax->CKr,
905  &ax->CKr,
906  "1",
907  1);
908 }
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct GNUNET_CRYPTO_SymmetricSessionKey CKr
32-byte chain keys (used for forward-secrecy) for receiving messages.
static void t_hmac_derive_key(const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_CRYPTO_SymmetricSessionKey *out, const void *source, unsigned int len)
Derive a symmetric encryption key from an HMAC-HASH.
void GNUNET_CRYPTO_symmetric_derive_iv(struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, const struct GNUNET_CRYPTO_SymmetricSessionKey *skey, const void *salt, size_t salt_len,...)
Derive an IV.
static unsigned int size
Size of the "table".
Definition: peer.c:67
Header for all communications.
ssize_t GNUNET_CRYPTO_symmetric_decrypt(const void *block, size_t size, const struct GNUNET_CRYPTO_SymmetricSessionKey *sessionkey, const struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, void *result)
Decrypt a given block using a symmetric sessionkey.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ t_h_encrypt()

static void t_h_encrypt ( struct CadetTunnelAxolotl ax,
struct GNUNET_CADET_TunnelEncryptedMessage msg 
)
static

Encrypt header with the axolotl header key.

Parameters
axkey material to use.

Definition at line 918 of file gnunet-service-cadet_tunnels.c.

References GNUNET_CADET_TunnelEncryptedMessage::ax_header, GNUNET_assert, GNUNET_CRYPTO_symmetric_derive_iv(), GNUNET_CRYPTO_symmetric_encrypt(), and CadetTunnelAxolotl::HKs.

Referenced by GCT_send().

920 {
922  size_t out_size;
923 
925  &ax->HKs,
926  NULL, 0,
927  NULL);
928  out_size = GNUNET_CRYPTO_symmetric_encrypt (&msg->ax_header,
929  sizeof(struct
931  &ax->HKs,
932  &iv,
933  &msg->ax_header);
934  GNUNET_assert (sizeof(struct GNUNET_CADET_AxHeader) == out_size);
935 }
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct GNUNET_CADET_AxHeader ax_header
Axolotl-header that specifies which keys to use in which ratchet to decrypt the body that follows...
Encrypted axolotl header with numbers that identify which keys in which ratchet are to be used to dec...
ssize_t GNUNET_CRYPTO_symmetric_encrypt(const void *block, size_t size, const struct GNUNET_CRYPTO_SymmetricSessionKey *sessionkey, const struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, void *result)
Encrypt a block using a symmetric sessionkey.
void GNUNET_CRYPTO_symmetric_derive_iv(struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, const struct GNUNET_CRYPTO_SymmetricSessionKey *skey, const void *salt, size_t salt_len,...)
Derive an IV.
struct GNUNET_CRYPTO_SymmetricSessionKey HKs
32-byte header key (currently used for sending).
Here is the call graph for this function:
Here is the caller graph for this function:

◆ t_h_decrypt()

static void t_h_decrypt ( struct CadetTunnelAxolotl ax,
const struct GNUNET_CADET_TunnelEncryptedMessage src,
struct GNUNET_CADET_TunnelEncryptedMessage dst 
)
static

Decrypt header with the current axolotl header key.

Parameters
axkey material to use.
srcMessage whose header to decrypt.
dstWhere to decrypt header to.

Definition at line 946 of file gnunet-service-cadet_tunnels.c.

References GNUNET_CADET_TunnelEncryptedMessage::ax_header, GNUNET_assert, GNUNET_CRYPTO_symmetric_decrypt(), GNUNET_CRYPTO_symmetric_derive_iv(), CadetTunnelAxolotl::HKr, and GNUNET_CADET_AxHeader::Ns.

Referenced by t_ax_decrypt_and_validate().

949 {
951  size_t out_size;
952 
954  &ax->HKr,
955  NULL, 0,
956  NULL);
957  out_size = GNUNET_CRYPTO_symmetric_decrypt (&src->ax_header.Ns,
958  sizeof(struct
960  &ax->HKr,
961  &iv,
962  &dst->ax_header.Ns);
963  GNUNET_assert (sizeof(struct GNUNET_CADET_AxHeader) == out_size);
964 }
uint32_t Ns
Number of messages sent with the current ratchet key.
struct GNUNET_CRYPTO_SymmetricSessionKey HKr
32-byte header key (currently used for receiving)
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct GNUNET_CADET_AxHeader ax_header
Axolotl-header that specifies which keys to use in which ratchet to decrypt the body that follows...
Encrypted axolotl header with numbers that identify which keys in which ratchet are to be used to dec...
void GNUNET_CRYPTO_symmetric_derive_iv(struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, const struct GNUNET_CRYPTO_SymmetricSessionKey *skey, const void *salt, size_t salt_len,...)
Derive an IV.
ssize_t GNUNET_CRYPTO_symmetric_decrypt(const void *block, size_t size, const struct GNUNET_CRYPTO_SymmetricSessionKey *sessionkey, const struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, void *result)
Decrypt a given block using a symmetric sessionkey.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ delete_skipped_key()

static void delete_skipped_key ( struct CadetTunnelAxolotl ax,
struct CadetTunnelSkippedKey key 
)
static

Delete a key from the list of skipped keys.

Parameters
axkey material to delete key from.
keyKey to delete.

Definition at line 974 of file gnunet-service-cadet_tunnels.c.

References GNUNET_CONTAINER_DLL_remove, GNUNET_free, CadetTunnelAxolotl::skipped, CadetTunnelAxolotl::skipped_head, and CadetTunnelAxolotl::skipped_tail.

Referenced by cleanup_ax(), store_ax_keys(), and try_old_ax_keys().

976 {
978  ax->skipped_tail,
979  key);
980  GNUNET_free (key);
981  ax->skipped--;
982 }
#define GNUNET_CONTAINER_DLL_remove(head, tail, element)
Remove an element from a DLL.
struct CadetTunnelSkippedKey * skipped_tail
Skipped messages&#39; keys DLL, tail.
struct CadetTunnelSkippedKey * skipped_head
A (double linked) list of stored message keys and associated header keys for "skipped" messages...
unsigned int skipped
Number of elements in skipped_head <-> skipped_tail.
#define GNUNET_free(ptr)
Wrapper around free.
Here is the caller graph for this function:

◆ try_old_ax_keys()

static ssize_t try_old_ax_keys ( struct CadetTunnelAxolotl ax,
void *  dst,
const struct GNUNET_CADET_TunnelEncryptedMessage src,
size_t  size 
)
static

Decrypt and verify data with the appropriate tunnel key and verify that the data has not been altered since it was sent by the remote peer.

Parameters
axkey material to use.
dstDestination for the plaintext.
srcSource of the message. Can overlap with dst.
sizeSize of the message.
Returns
Size of the decrypted data, -1 if an error was encountered.

Definition at line 996 of file gnunet-service-cadet_tunnels.c.

References GNUNET_CADET_TunnelEncryptedMessage::ax_header, delete_skipped_key(), GNUNET_assert, GNUNET_CRYPTO_symmetric_decrypt(), GNUNET_CRYPTO_symmetric_derive_iv(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_memcmp, CadetTunnelSkippedKey::HK, GNUNET_CADET_TunnelEncryptedMessage::hmac, key, CadetTunnelSkippedKey::Kn, len, LOG, CadetTunnelSkippedKey::MK, N, CadetTunnelSkippedKey::next, GNUNET_CADET_AxHeader::Ns, res, CadetTunnelAxolotl::skipped_head, and t_hmac().

Referenced by t_ax_decrypt_and_validate().

1000 {
1001  struct CadetTunnelSkippedKey *key;
1002  struct GNUNET_ShortHashCode *hmac;
1004  struct GNUNET_CADET_TunnelEncryptedMessage plaintext_header;
1005  struct GNUNET_CRYPTO_SymmetricSessionKey *valid_HK;
1006  size_t esize;
1007  size_t res;
1008  size_t len;
1009  unsigned int N;
1010 
1012  "Trying skipped keys\n");
1013  hmac = &plaintext_header.hmac;
1014  esize = size - sizeof(struct GNUNET_CADET_TunnelEncryptedMessage);
1015 
1016  /* Find a correct Header Key */
1017  valid_HK = NULL;
1018  for (key = ax->skipped_head; NULL != key; key = key->next)
1019  {
1020  t_hmac (&src->ax_header,
1021  sizeof(struct GNUNET_CADET_AxHeader) + esize,
1022  0,
1023  &key->HK,
1024  hmac);
1025  if (0 == GNUNET_memcmp (hmac,
1026  &src->hmac))
1027  {
1028  valid_HK = &key->HK;
1029  break;
1030  }
1031  }
1032  if (NULL == key)
1033  return -1;
1034 
1035  /* Should've been checked in -cadet_connection.c handle_cadet_encrypted. */
1037  len = size - sizeof(struct GNUNET_CADET_TunnelEncryptedMessage);
1038  GNUNET_assert (len >= sizeof(struct GNUNET_MessageHeader));
1039 
1040  /* Decrypt header */
1042  &key->HK,
1043  NULL, 0,
1044  NULL);
1046  sizeof(struct GNUNET_CADET_AxHeader),
1047  &key->HK,
1048  &iv,
1049  &plaintext_header.ax_header.Ns);
1050  GNUNET_assert (sizeof(struct GNUNET_CADET_AxHeader) == res);
1051 
1052  /* Find the correct message key */
1053  N = ntohl (plaintext_header.ax_header.Ns);
1054  while ((NULL != key) &&
1055  (N != key->Kn))
1056  key = key->next;
1057  if ((NULL == key) ||
1058  (0 != GNUNET_memcmp (&key->HK,
1059  valid_HK)))
1060  return -1;
1061 
1062  /* Decrypt payload */
1064  &key->MK,
1065  NULL,
1066  0,
1067  NULL);
1068  res = GNUNET_CRYPTO_symmetric_decrypt (&src[1],
1069  len,
1070  &key->MK,
1071  &iv,
1072  dst);
1073  delete_skipped_key (ax,
1074  key);
1075  return res;
1076 }
Axolotl-encrypted tunnel message with application payload.
Struct to old keys for skipped messages while advancing the Axolotl ratchet.
uint32_t Ns
Number of messages sent with the current ratchet key.
static void t_hmac(const void *plaintext, size_t size, uint32_t iv, const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_ShortHashCode *hmac)
Calculate HMAC.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct GNUNET_CADET_AxHeader ax_header
Axolotl-header that specifies which keys to use in which ratchet to decrypt the body that follows...
Encrypted axolotl header with numbers that identify which keys in which ratchet are to be used to dec...
A 256-bit hashcode.
struct GNUNET_CRYPTO_SymmetricSessionKey HK
Header key.
static void delete_skipped_key(struct CadetTunnelAxolotl *ax, struct CadetTunnelSkippedKey *key)
Delete a key from the list of skipped keys.
void GNUNET_CRYPTO_symmetric_derive_iv(struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, const struct GNUNET_CRYPTO_SymmetricSessionKey *skey, const void *salt, size_t salt_len,...)
Derive an IV.
static int res
struct GNUNET_HashCode key
The key used in the DHT.
static unsigned int size
Size of the "table".
Definition: peer.c:67
struct GNUNET_ShortHashCode hmac
MAC of the encrypted message, used to verify message integrity.
#define GNUNET_memcmp(a, b)
Compare memory in a and b, where both must be of the same pointer type.
unsigned int Kn
Key number for a given HK.
#define N
struct CadetTunnelSkippedKey * skipped_head
A (double linked) list of stored message keys and associated header keys for "skipped" messages...
#define LOG(level,...)
Header for all communications.
struct CadetTunnelSkippedKey * next
DLL next.
ssize_t GNUNET_CRYPTO_symmetric_decrypt(const void *block, size_t size, const struct GNUNET_CRYPTO_SymmetricSessionKey *sessionkey, const struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, void *result)
Decrypt a given block using a symmetric sessionkey.
uint16_t len
length of data (which is always a uint32_t, but presumably this can be used to specify that fewer byt...
struct GNUNET_CRYPTO_SymmetricSessionKey MK
Message key.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ store_skipped_key()

static void store_skipped_key ( struct CadetTunnelAxolotl ax,
const struct GNUNET_CRYPTO_SymmetricSessionKey HKr 
)
static

Delete a key from the list of skipped keys.

Parameters
axkey material to delete from.
HKrHeader Key to use.

Definition at line 1086 of file gnunet-service-cadet_tunnels.c.

References CadetTunnelAxolotl::CKr, GNUNET_CONTAINER_DLL_insert, GNUNET_new, GNUNET_TIME_absolute_get(), CadetTunnelSkippedKey::HK, CadetTunnelAxolotl::HKr, key, CadetTunnelSkippedKey::Kn, CadetTunnelSkippedKey::MK, CadetTunnelAxolotl::Nr, CadetTunnelAxolotl::skipped, CadetTunnelAxolotl::skipped_head, CadetTunnelAxolotl::skipped_tail, t_hmac_derive_key(), and CadetTunnelSkippedKey::timestamp.

Referenced by store_ax_keys().

1088 {
1089  struct CadetTunnelSkippedKey *key;
1090 
1091  key = GNUNET_new (struct CadetTunnelSkippedKey);
1093  key->Kn = ax->Nr;
1094  key->HK = ax->HKr;
1095  t_hmac_derive_key (&ax->CKr,
1096  &key->MK,
1097  "0",
1098  1);
1099  t_hmac_derive_key (&ax->CKr,
1100  &ax->CKr,
1101  "1",
1102  1);
1104  ax->skipped_tail,
1105  key);
1106  ax->skipped++;
1107  ax->Nr++;
1108 }
Struct to old keys for skipped messages while advancing the Axolotl ratchet.
#define GNUNET_CONTAINER_DLL_insert(head, tail, element)
Insert an element at the head of a DLL.
struct CadetTunnelSkippedKey * skipped_tail
Skipped messages&#39; keys DLL, tail.
struct GNUNET_TIME_Absolute timestamp
When was this key stored (for timeout).
struct GNUNET_CRYPTO_SymmetricSessionKey HKr
32-byte header key (currently used for receiving)
#define GNUNET_new(type)
Allocate a struct or union of the given type.
struct GNUNET_CRYPTO_SymmetricSessionKey HK
Header key.
struct GNUNET_CRYPTO_SymmetricSessionKey CKr
32-byte chain keys (used for forward-secrecy) for receiving messages.
static void t_hmac_derive_key(const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_CRYPTO_SymmetricSessionKey *out, const void *source, unsigned int len)
Derive a symmetric encryption key from an HMAC-HASH.
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_get(void)
Get the current time.
Definition: time.c:118
struct GNUNET_HashCode key
The key used in the DHT.
uint32_t Nr
Message number (reset to 0 with each new ratchet, next message to recv).
unsigned int Kn
Key number for a given HK.
struct CadetTunnelSkippedKey * skipped_head
A (double linked) list of stored message keys and associated header keys for "skipped" messages...
unsigned int skipped
Number of elements in skipped_head <-> skipped_tail.
struct GNUNET_CRYPTO_SymmetricSessionKey MK
Message key.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ store_ax_keys()

static int store_ax_keys ( struct CadetTunnelAxolotl ax,
const struct GNUNET_CRYPTO_SymmetricSessionKey HKr,
uint32_t  Np 
)
static

Stage skipped AX keys and calculate the message key.

Stores each HK and MK for skipped messages.

Parameters
axkey material to use
HKrHeader key.
NpReceived meesage number.
Returns
GNUNET_OK if keys were stored. GNUNET_SYSERR if an error ocurred (Np not expected).

Definition at line 1122 of file gnunet-service-cadet_tunnels.c.

References delete_skipped_key(), GNUNET_break_op, GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_WARNING, GNUNET_OK, GNUNET_SYSERR, LOG, MAX_KEY_GAP, MAX_SKIPPED_KEYS, CadetTunnelAxolotl::Nr, CadetTunnelAxolotl::skipped, CadetTunnelAxolotl::skipped_tail, and store_skipped_key().

Referenced by t_ax_decrypt_and_validate().

1125 {
1126  int gap;
1127 
1128  gap = Np - ax->Nr;
1130  "Storing skipped keys [%u, %u)\n",
1131  ax->Nr,
1132  Np);
1133  if (MAX_KEY_GAP < gap)
1134  {
1135  /* Avoid DoS (forcing peer to do more than #MAX_KEY_GAP HMAC operations) */
1136  /* TODO: start new key exchange on return */
1137  GNUNET_break_op (0);
1139  "Got message %u, expected %u+\n",
1140  Np,
1141  ax->Nr);
1142  return GNUNET_SYSERR;
1143  }
1144  if (0 > gap)
1145  {
1146  /* Delayed message: don't store keys, flag to try old keys. */
1147  return GNUNET_SYSERR;
1148  }
1149 
1150  while (ax->Nr < Np)
1151  store_skipped_key (ax,
1152  HKr);
1153 
1154  while (ax->skipped > MAX_SKIPPED_KEYS)
1155  delete_skipped_key (ax,
1156  ax->skipped_tail);
1157  return GNUNET_OK;
1158 }
struct CadetTunnelSkippedKey * skipped_tail
Skipped messages&#39; keys DLL, tail.
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
static void store_skipped_key(struct CadetTunnelAxolotl *ax, const struct GNUNET_CRYPTO_SymmetricSessionKey *HKr)
Delete a key from the list of skipped keys.
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
static void delete_skipped_key(struct CadetTunnelAxolotl *ax, struct CadetTunnelSkippedKey *key)
Delete a key from the list of skipped keys.
#define GNUNET_SYSERR
Definition: gnunet_common.h:76
uint32_t Nr
Message number (reset to 0 with each new ratchet, next message to recv).
#define MAX_SKIPPED_KEYS
Maximum number of skipped keys we keep in memory per tunnel.
#define LOG(level,...)
#define MAX_KEY_GAP
Maximum number of keys (and thus ratchet steps) we are willing to skip before we decide this is eithe...
unsigned int skipped
Number of elements in skipped_head <-> skipped_tail.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ t_ax_decrypt_and_validate()

static ssize_t t_ax_decrypt_and_validate ( struct CadetTunnelAxolotl ax,
void *  dst,
const struct GNUNET_CADET_TunnelEncryptedMessage src,
size_t  size 
)
static

Decrypt and verify data with the appropriate tunnel key and verify that the data has not been altered since it was sent by the remote peer.

Parameters
axkey material to use
dstDestination for the plaintext.
srcSource of the message. Can overlap with dst.
sizeSize of the message.
Returns
Size of the decrypted data, -1 if an error was encountered.

Definition at line 1172 of file gnunet-service-cadet_tunnels.c.

References GNUNET_CADET_TunnelEncryptedMessage::ax_header, CadetTunnelAxolotl::CKr, ctx, CadetTunnelAxolotl::DHRr, CadetTunnelAxolotl::DHRs, GNUNET_CADET_AxHeader::DHRs, GNUNET_CRYPTO_ecc_ecdh(), GNUNET_CRYPTO_kdf(), GNUNET_memcmp, GNUNET_OK, GNUNET_YES, CadetTunnelAxolotl::HKr, GNUNET_CADET_TunnelEncryptedMessage::hmac, CadetTunnelAxolotl::NHKr, CadetTunnelAxolotl::Nr, GNUNET_CADET_AxHeader::Ns, GNUNET_CADET_AxHeader::PNs, CadetTunnelAxolotl::ratchet_allowed, CadetTunnelAxolotl::RK, store_ax_keys(), t_ax_decrypt(), t_ax_hmac_hash(), t_h_decrypt(), t_hmac(), and try_old_ax_keys().

Referenced by GCT_handle_encrypted().

1177 {
1178  struct GNUNET_ShortHashCode msg_hmac;
1179  struct GNUNET_HashCode hmac;
1180  struct GNUNET_CADET_TunnelEncryptedMessage plaintext_header;
1181  uint32_t Np;
1182  uint32_t PNp;
1183  size_t esize; /* Size of encryped payload */
1184 
1185  esize = size - sizeof(struct GNUNET_CADET_TunnelEncryptedMessage);
1186 
1187  /* Try current HK */
1188  t_hmac (&src->ax_header,
1189  sizeof(struct GNUNET_CADET_AxHeader) + esize,
1190  0, &ax->HKr,
1191  &msg_hmac);
1192  if (0 != GNUNET_memcmp (&msg_hmac,
1193  &src->hmac))
1194  {
1195  static const char ctx[] = "axolotl ratchet";
1196  struct GNUNET_CRYPTO_SymmetricSessionKey keys[3]; /* RKp, NHKp, CKp */
1198  struct GNUNET_HashCode dh;
1199  struct GNUNET_CRYPTO_EcdhePublicKey *DHRp;
1200 
1201  /* Try Next HK */
1202  t_hmac (&src->ax_header,
1203  sizeof(struct GNUNET_CADET_AxHeader) + esize,
1204  0,
1205  &ax->NHKr,
1206  &msg_hmac);
1207  if (0 != GNUNET_memcmp (&msg_hmac,
1208  &src->hmac))
1209  {
1210  /* Try the skipped keys, if that fails, we're out of luck. */
1211  return try_old_ax_keys (ax,
1212  dst,
1213  src,
1214  size);
1215  }
1216  HK = ax->HKr;
1217  ax->HKr = ax->NHKr;
1218  t_h_decrypt (ax,
1219  src,
1220  &plaintext_header);
1221  Np = ntohl (plaintext_header.ax_header.Ns);
1222  PNp = ntohl (plaintext_header.ax_header.PNs);
1223  DHRp = &plaintext_header.ax_header.DHRs;
1224  store_ax_keys (ax,
1225  &HK,
1226  PNp);
1227 
1228  /* RKp, NHKp, CKp = KDF (HMAC-HASH (RK, DH (DHRp, DHRs))) */
1230  DHRp,
1231  &dh);
1232  t_ax_hmac_hash (&ax->RK,
1233  &hmac,
1234  &dh, sizeof(dh));
1235  GNUNET_CRYPTO_kdf (keys, sizeof(keys),
1236  ctx, sizeof(ctx),
1237  &hmac, sizeof(hmac),
1238  NULL);
1239 
1240  /* Commit "purported" keys */
1241  ax->RK = keys[0];
1242  ax->NHKr = keys[1];
1243  ax->CKr = keys[2];
1244  ax->DHRr = *DHRp;
1245  ax->Nr = 0;
1247  }
1248  else
1249  {
1250  t_h_decrypt (ax,
1251  src,
1252  &plaintext_header);
1253  Np = ntohl (plaintext_header.ax_header.Ns);
1254  PNp = ntohl (plaintext_header.ax_header.PNs);
1255  }
1256  if ((Np != ax->Nr) &&
1257  (GNUNET_OK != store_ax_keys (ax,
1258  &ax->HKr,
1259  Np)))
1260  {
1261  /* Try the skipped keys, if that fails, we're out of luck. */
1262  return try_old_ax_keys (ax,
1263  dst,
1264  src,
1265  size);
1266  }
1267 
1268  t_ax_decrypt (ax,
1269  dst,
1270  &src[1],
1271  esize);
1272  ax->Nr = Np + 1;
1273  return esize;
1274 }
Axolotl-encrypted tunnel message with application payload.
static void t_hmac(const void *plaintext, size_t size, uint32_t iv, const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_ShortHashCode *hmac)
Calculate HMAC.
struct GNUNET_CRYPTO_SymmetricSessionKey HKr
32-byte header key (currently used for receiving)
int GNUNET_CRYPTO_ecc_ecdh(const struct GNUNET_CRYPTO_EcdhePrivateKey *priv, const struct GNUNET_CRYPTO_EcdhePublicKey *pub, struct GNUNET_HashCode *key_material)
Derive key material from a public and a private ECC key.
Definition: crypto_ecc.c:1182
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
struct GNUNET_CRYPTO_SymmetricSessionKey NHKr
32-byte next header key (for receiving).
struct GNUNET_CADET_AxHeader ax_header
Axolotl-header that specifies which keys to use in which ratchet to decrypt the body that follows...
Encrypted axolotl header with numbers that identify which keys in which ratchet are to be used to dec...
static struct GNUNET_DNSSTUB_Context * ctx
Context for DNS resolution.
static int store_ax_keys(struct CadetTunnelAxolotl *ax, const struct GNUNET_CRYPTO_SymmetricSessionKey *HKr, uint32_t Np)
Stage skipped AX keys and calculate the message key.
A 256-bit hashcode.
static void t_ax_hmac_hash(const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_HashCode *hash, const void *source, unsigned int len)
Perform a HMAC.
struct GNUNET_CRYPTO_SymmetricSessionKey CKr
32-byte chain keys (used for forward-secrecy) for receiving messages.
static ssize_t try_old_ax_keys(struct CadetTunnelAxolotl *ax, void *dst, const struct GNUNET_CADET_TunnelEncryptedMessage *src, size_t size)
Decrypt and verify data with the appropriate tunnel key and verify that the data has not been altered...
A 512-bit hashcode.
int ratchet_allowed
True (GNUNET_YES) if we have received a message from the other peer that uses the keys from our last ...
static unsigned int size
Size of the "table".
Definition: peer.c:67
uint32_t Nr
Message number (reset to 0 with each new ratchet, next message to recv).
struct GNUNET_ShortHashCode hmac
MAC of the encrypted message, used to verify message integrity.
#define GNUNET_memcmp(a, b)
Compare memory in a and b, where both must be of the same pointer type.
struct GNUNET_CRYPTO_SymmetricSessionKey RK
32-byte root key which gets updated by DH ratchet.
struct GNUNET_CRYPTO_EcdhePublicKey DHRr
ECDH Ratchet key (other peer&#39;s public key in the current DH).
struct GNUNET_CRYPTO_EcdhePrivateKey DHRs
ECDH Ratchet key (our private key in the current DH).
Public ECC key (always for Curve25519) encoded in a format suitable for network transmission and encr...
static void t_h_decrypt(struct CadetTunnelAxolotl *ax, const struct GNUNET_CADET_TunnelEncryptedMessage *src, struct GNUNET_CADET_TunnelEncryptedMessage *dst)
Decrypt header with the current axolotl header key.
#define GNUNET_YES
Definition: gnunet_common.h:77
static void t_ax_decrypt(struct CadetTunnelAxolotl *ax, void *dst, const void *src, size_t size)
Decrypt data with the axolotl tunnel key.
int GNUNET_CRYPTO_kdf(void *result, size_t out_len, const void *xts, size_t xts_len, const void *skm, size_t skm_len,...)
Derive key.
Definition: crypto_kdf.c:89
Here is the call graph for this function:
Here is the caller graph for this function:

◆ notify_tunnel_up_cb()

static int notify_tunnel_up_cb ( void *  cls,
uint32_t  key,
void *  value 
)
static

Our tunnel became ready for the first time, notify channels that have been waiting.

Parameters
clsour tunnel, not used
keyunique ID of the channel, not used
valuethe struct CadetChannel to notify
Returns
GNUNET_OK (continue to iterate)

Definition at line 1287 of file gnunet-service-cadet_tunnels.c.

References ch, GCCH_tunnel_up(), GNUNET_OK, and value.

Referenced by GCT_change_estate().

1290 {
1291  struct CadetChannel *ch = value;
1292 
1293  GCCH_tunnel_up (ch);
1294  return GNUNET_OK;
1295 }
static struct GNUNET_CADET_Channel * ch
Channel handle.
Definition: gnunet-cadet.c:117
void GCCH_tunnel_up(struct CadetChannel *ch)
Function called once and only once after a channel was bound to its tunnel via GCT_add_channel() is r...
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
static char * value
Value of the record to add/remove.
Struct containing all information regarding a channel to a remote client.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_change_estate()

void GCT_change_estate ( struct CadetTunnel t,
enum CadetTunnelEState  state 
)

Change the tunnel encryption state.

If the encryption state changes to OK, stop the rekey task.

Parameters
tTunnel whose encryption state to change, or NULL.
stateNew encryption state.

Definition at line 1306 of file gnunet-service-cadet_tunnels.c.

References CADET_TUNNEL_KEY_OK, CadetTunnel::channels, CadetTunnel::estate, estate2s(), GCT_2s(), GNUNET_CONTAINER_multihashmap32_iterate(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_SCHEDULER_add_now(), GNUNET_SCHEDULER_cancel(), CadetTunnel::kx_task, LOG, notify_tunnel_up_cb(), CadetTunnel::send_task, state, and trigger_transmissions().

Referenced by GCT_handle_encrypted(), GCT_handle_kx(), GCT_handle_kx_auth(), send_kx(), and send_kx_auth().

1308 {
1309  enum CadetTunnelEState old = t->estate;
1310 
1311  t->estate = state;
1313  "%s estate changed from %s to %s\n",
1314  GCT_2s (t),
1315  estate2s (old),
1316  estate2s (state));
1317 
1318  if ((CADET_TUNNEL_KEY_OK != old) &&
1319  (CADET_TUNNEL_KEY_OK == t->estate))
1320  {
1321  if (NULL != t->kx_task)
1322  {
1324  t->kx_task = NULL;
1325  }
1326  /* notify all channels that have been waiting */
1329  t);
1330  if (NULL != t->send_task)
1333  t);
1334  }
1335 }
struct GNUNET_CONTAINER_MultiHashMap32 * channels
Channels inside this tunnel.
static const char * estate2s(enum CadetTunnelEState es)
Get string description for tunnel encryption state.
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
int GNUNET_CONTAINER_multihashmap32_iterate(struct GNUNET_CONTAINER_MultiHashMap32 *map, GNUNET_CONTAINER_MulitHashMapIterator32Callback it, void *it_cls)
Iterate over all entries in the map.
struct GNUNET_SCHEDULER_Task * kx_task
Task to trigger KX.
static void trigger_transmissions(void *cls)
Called when either we have a new connection, or a new message in the queue, or some existing connecti...
enum State state
current state of profiling
CadetTunnelEState
All the encryption states a tunnel can be in.
struct GNUNET_SCHEDULER_Task * GNUNET_SCHEDULER_add_now(GNUNET_SCHEDULER_TaskCallback task, void *task_cls)
Schedule a new task to be run as soon as possible.
Definition: scheduler.c:1280
Handshake completed: session key available.
static int notify_tunnel_up_cb(void *cls, uint32_t key, void *value)
Our tunnel became ready for the first time, notify channels that have been waiting.
#define LOG(level,...)
struct GNUNET_SCHEDULER_Task * send_task
Task to send messages from queue (if possible).
enum CadetTunnelEState estate
State of the tunnel encryption.
void * GNUNET_SCHEDULER_cancel(struct GNUNET_SCHEDULER_Task *task)
Cancel the task with the specified identifier.
Definition: scheduler.c:966
Here is the call graph for this function:
Here is the caller graph for this function:

◆ send_kx()

static void send_kx ( struct CadetTunnel t,
struct CadetTConnection ct,
struct CadetTunnelAxolotl ax 
)
static

Send a KX message.

Parameters
ttunnel on which to send the KX_AUTH
ctTunnel and connection on which to send the KX_AUTH, NULL if we are to find one that is ready.
axaxolotl key context to use

Definition at line 1347 of file gnunet-service-cadet_tunnels.c.

References alice_or_betty(), CADET_TUNNEL_KEY_AX_RECV, CADET_TUNNEL_KEY_AX_SENT, CADET_TUNNEL_KEY_AX_SENT_AND_RECV, CADET_TUNNEL_KEY_UNINITIALIZED, CadetTConnection::cc, GNUNET_CADET_TunnelKeyExchangeMessage::cid, GNUNET_CADET_ConnectionTunnelIdentifier::connection_of_tunnel, CadetTunnel::destination, CadetTunnelAxolotl::DHRs, env, GNUNET_CADET_TunnelKeyExchangeMessage::ephemeral_key, CadetTunnel::estate, estate2s(), GNUNET_CADET_TunnelKeyExchangeMessage::flags, GCC_get_id(), GCC_transmit(), GCP_get_id(), GCT_2s(), GCT_change_estate(), get_ready_connection(), GNUNET_CADET_KX_FLAG_FORCE_REPLY, GNUNET_CRYPTO_ecdhe_key_get_public(), GNUNET_e2s(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_MESSAGE_TYPE_CADET_TUNNEL_KX, GNUNET_MQ_msg, GNUNET_NO, GNUNET_sh2s(), GNUNET_STATISTICS_update(), GNUNET_TIME_absolute_get(), GNUNET_TIME_relative_to_absolute(), GNUNET_TIME_STD_BACKOFF, GNUNET_YES, CadetTConnection::is_ready, CadetTunnelAxolotl::kx_0, CadetTunnel::kx_retry_delay, LOG, mark_connection_unready(), msg, my_private_key, CadetTunnel::next_kx_attempt, GNUNET_CADET_TunnelKeyExchangeMessage::ratchet_key, and stats.

Referenced by connection_ready_cb(), GCT_handle_encrypted(), and retry_kx().

1350 {
1351  struct CadetConnection *cc;
1352  struct GNUNET_MQ_Envelope *env;
1355 
1357  return; /* only Alice may send KX */
1358  if ((NULL == ct) ||
1359  (GNUNET_NO == ct->is_ready))
1360  ct = get_ready_connection (t);
1361  if (NULL == ct)
1362  {
1364  "Wanted to send %s in state %s, but no connection is ready, deferring\n",
1365  GCT_2s (t),
1366  estate2s (t->estate));
1368  return;
1369  }
1370  cc = ct->cc;
1371  env = GNUNET_MQ_msg (msg,
1373  flags = GNUNET_CADET_KX_FLAG_FORCE_REPLY; /* always for KX */
1374  msg->flags = htonl (flags);
1375  msg->cid = *GCC_get_id (cc);
1377  &msg->ephemeral_key);
1378 #if DEBUG_KX
1379  msg->ephemeral_key_XXX = ax->kx_0;
1380  msg->private_key_XXX = *my_private_key;
1381 #endif
1383  "Sending KX message to %s with ephemeral %s on CID %s\n",
1384  GCT_2s (t),
1385  GNUNET_e2s (&msg->ephemeral_key),
1388  &msg->ratchet_key);
1393  GCT_change_estate (t,
1395  else if (CADET_TUNNEL_KEY_AX_RECV == t->estate)
1396  GCT_change_estate (t,
1398  GCC_transmit (cc,
1399  env);
1401  "# KX transmitted",
1402  1,
1403  GNUNET_NO);
1404 }
const char * GNUNET_sh2s(const struct GNUNET_ShortHashCode *shc)
Convert a short hash value to a string (for printing debug messages).
struct GNUNET_MessageHeader * msg
Definition: 005.c:2
static const char * estate2s(enum CadetTunnelEState es)
Get string description for tunnel encryption state.
Low-level connection to a destination.
int is_ready
Is the connection currently ready for transmission?
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
static int alice_or_betty(const struct GNUNET_PeerIdentity *other)
Am I Alice or Betty (some call her Bob), or talking to myself?
uint32_t flags
Flags for the key exchange in NBO, based on enum GNUNET_CADET_KX_Flags.
struct GNUNET_TIME_Absolute GNUNET_TIME_relative_to_absolute(struct GNUNET_TIME_Relative rel)
Convert relative time to an absolute time in the future.
Definition: time.c:246
const struct GNUNET_CADET_ConnectionTunnelIdentifier * GCC_get_id(struct CadetConnection *cc)
Obtain unique ID for the connection.
static void mark_connection_unready(struct CadetTConnection *ct)
Connection ct is now unready, clear it&#39;s ready flag and move it from the ready DLL to the busy DLL...
#define GNUNET_MQ_msg(mvar, type)
Allocate a GNUNET_MQ_Envelope.
Definition: gnunet_mq_lib.h:67
#define GNUNET_NO
Definition: gnunet_common.h:78
KX message sent, waiting for other peer&#39;s KX_AUTH.
static struct CadetTConnection * get_ready_connection(struct CadetTunnel *t)
Find first connection that is ready in the list of our connections.
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
GNUNET_CADET_KX_Flags
Flags to be used in GNUNET_CADET_KX.
struct GNUNET_STATISTICS_Handle * stats
Handle to the statistics service.
struct GNUNET_CADET_ConnectionTunnelIdentifier cid
ID of the connection.
struct GNUNET_CRYPTO_EcdhePublicKey ratchet_key
Sender&#39;s next ephemeral public ECC key encoded in a format suitable for network transmission, as created using &#39;gcry_sexp_sprint&#39;.
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_get(void)
Get the current time.
Definition: time.c:118
struct CadetConnection * cc
Connection handle.
void GNUNET_CRYPTO_ecdhe_key_get_public(const struct GNUNET_CRYPTO_EcdhePrivateKey *priv, struct GNUNET_CRYPTO_EcdhePublicKey *pub)
Extract the public key for the given private key.
Definition: crypto_ecc.c:301
struct GNUNET_TIME_Absolute next_kx_attempt
When do we try the next KX?
struct GNUNET_MQ_Envelope * env
Definition: 005.c:1
#define GNUNET_TIME_STD_BACKOFF(r)
Perform our standard exponential back-off calculation, starting at 1 ms and then going by a factor of...
struct GNUNET_CRYPTO_EddsaPrivateKey * my_private_key
Own private key.
void GCT_change_estate(struct CadetTunnel *t, enum CadetTunnelEState state)
Change the tunnel encryption state.
void GCC_transmit(struct CadetConnection *cc, struct GNUNET_MQ_Envelope *env)
Transmit message msg via connection cc.
KX message sent and received, trying to send back KX_AUTH.
struct CadetPeer * destination
Destination of the tunnel.
The peer should reply with its KX details?
struct GNUNET_CRYPTO_EcdhePrivateKey DHRs
ECDH Ratchet key (our private key in the current DH).
Message for a Key eXchange for a tunnel.
Uninitialized status, we need to send KX.
#define LOG(level,...)
KX message received, trying to send back KX_AUTH.
struct GNUNET_TIME_Relative kx_retry_delay
How long do we wait until we retry the KX?
#define GNUNET_YES
Definition: gnunet_common.h:77
struct GNUNET_CRYPTO_EcdhePublicKey ephemeral_key
Sender&#39;s ephemeral public ECC key encoded in a format suitable for network transmission, as created using &#39;gcry_sexp_sprint&#39;.
const char * GNUNET_e2s(const struct GNUNET_CRYPTO_EcdhePublicKey *p)
Convert a public key value to a string (for printing debug messages).
struct GNUNET_ShortHashCode connection_of_tunnel
enum CadetTunnelEState estate
State of the tunnel encryption.
#define GNUNET_MESSAGE_TYPE_CADET_TUNNEL_KX
Axolotl key exchange.
const struct GNUNET_PeerIdentity * GCP_get_id(struct CadetPeer *cp)
Obtain the peer identity for a struct CadetPeer.
struct GNUNET_CRYPTO_EcdhePrivateKey kx_0
ECDH for key exchange (A0 / B0).
Here is the call graph for this function:
Here is the caller graph for this function:

◆ send_kx_auth()

static void send_kx_auth ( struct CadetTunnel t,
struct CadetTConnection ct,
struct CadetTunnelAxolotl ax,
int  force_reply 
)
static

Send a KX_AUTH message.

Parameters
ttunnel on which to send the KX_AUTH
ctTunnel and connection on which to send the KX_AUTH, NULL if we are to find one that is ready.
axaxolotl key context to use
force_replyForce the other peer to reply with a KX_AUTH message (set if we would like to transmit right now, but cannot)

Definition at line 1418 of file gnunet-service-cadet_tunnels.c.

References GNUNET_CADET_TunnelKeyExchangeAuthMessage::auth, CADET_TUNNEL_KEY_AX_AUTH_SENT, CADET_TUNNEL_KEY_OK, CadetTConnection::cc, GNUNET_CADET_TunnelKeyExchangeMessage::cid, GNUNET_CADET_ConnectionTunnelIdentifier::connection_of_tunnel, CadetTunnelAxolotl::DHRs, env, GNUNET_CADET_TunnelKeyExchangeMessage::ephemeral_key, CadetTunnel::estate, GNUNET_CADET_TunnelKeyExchangeMessage::flags, GCC_get_id(), GCC_transmit(), GCT_2s(), GCT_change_estate(), get_ready_connection(), GNUNET_CADET_KX_FLAG_FORCE_REPLY, GNUNET_CADET_KX_FLAG_NONE, GNUNET_CRYPTO_ecdhe_key_get_public(), GNUNET_CRYPTO_hash(), GNUNET_e2s(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_MESSAGE_TYPE_CADET_TUNNEL_KX_AUTH, GNUNET_MQ_msg, GNUNET_NO, GNUNET_sh2s(), GNUNET_STATISTICS_update(), GNUNET_TIME_absolute_get(), GNUNET_TIME_relative_to_absolute(), GNUNET_TIME_STD_BACKOFF, GNUNET_YES, CadetTConnection::is_ready, GNUNET_CADET_TunnelKeyExchangeAuthMessage::kx, CadetTunnelAxolotl::kx_0, CadetTunnel::kx_auth_requested, CadetTunnel::kx_retry_delay, CadetTunnelAxolotl::last_ephemeral, LOG, mark_connection_unready(), msg, my_private_key, CadetTunnel::next_kx_attempt, GNUNET_CADET_TunnelKeyExchangeMessage::ratchet_key, CadetTunnelAxolotl::RK, and stats.

Referenced by connection_ready_cb(), GCT_handle_encrypted(), GCT_handle_kx(), GCT_handle_kx_auth(), and retry_kx().

1422 {
1423  struct CadetConnection *cc;
1424  struct GNUNET_MQ_Envelope *env;
1426  enum GNUNET_CADET_KX_Flags flags;
1427 
1428  if ((NULL == ct) ||
1429  (GNUNET_NO == ct->is_ready))
1430  ct = get_ready_connection (t);
1431  if (NULL == ct)
1432  {
1434  "Wanted to send KX_AUTH on %s, but no connection is ready, deferring\n",
1435  GCT_2s (t));
1437  t->kx_auth_requested = GNUNET_YES; /* queue KX_AUTH independent of estate */
1438  return;
1439  }
1440  t->kx_auth_requested = GNUNET_NO; /* clear flag */
1441  cc = ct->cc;
1442  env = GNUNET_MQ_msg (msg,
1444  flags = GNUNET_CADET_KX_FLAG_NONE;
1445  if (GNUNET_YES == force_reply)
1447  msg->kx.flags = htonl (flags);
1448  msg->kx.cid = *GCC_get_id (cc);
1450  &msg->kx.ephemeral_key);
1452  &msg->kx.ratchet_key);
1453 #if DEBUG_KX
1454  msg->kx.ephemeral_key_XXX = ax->kx_0;
1455  msg->kx.private_key_XXX = *my_private_key;
1456  msg->r_ephemeral_key_XXX = ax->last_ephemeral;
1457 #endif
1459  "Sending KX_AUTH message to %s with ephemeral %s on CID %s\n",
1460  GCT_2s (t),
1461  GNUNET_e2s (&msg->kx.ephemeral_key),
1463 
1464  /* Compute authenticator (this is the main difference to #send_kx()) */
1465  GNUNET_CRYPTO_hash (&ax->RK,
1466  sizeof(ax->RK),
1467  &msg->auth);
1468  /* Compute when to be triggered again; actual job will
1469  be scheduled via #connection_ready_cb() */
1470  t->kx_retry_delay
1472  t->next_kx_attempt
1474 
1475  /* Send via cc, mark it as unready */
1477 
1478  /* Update state machine, unless we are already OK */
1479  if (CADET_TUNNEL_KEY_OK != t->estate)
1480  GCT_change_estate (t,
1482  GCC_transmit (cc,
1483  env);
1485  "# KX_AUTH transmitted",
1486  1,
1487  GNUNET_NO);
1488 }
const char * GNUNET_sh2s(const struct GNUNET_ShortHashCode *shc)
Convert a short hash value to a string (for printing debug messages).
struct GNUNET_MessageHeader * msg
Definition: 005.c:2
Low-level connection to a destination.
int is_ready
Is the connection currently ready for transmission?
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
struct GNUNET_CADET_TunnelKeyExchangeMessage kx
Message header with key material.
uint32_t flags
Flags for the key exchange in NBO, based on enum GNUNET_CADET_KX_Flags.
struct GNUNET_TIME_Absolute GNUNET_TIME_relative_to_absolute(struct GNUNET_TIME_Relative rel)
Convert relative time to an absolute time in the future.
Definition: time.c:246
const struct GNUNET_CADET_ConnectionTunnelIdentifier * GCC_get_id(struct CadetConnection *cc)
Obtain unique ID for the connection.
static void mark_connection_unready(struct CadetTConnection *ct)
Connection ct is now unready, clear it&#39;s ready flag and move it from the ready DLL to the busy DLL...
KX received and we sent KX_AUTH back, but we got no traffic yet, so we&#39;re waiting for either KX_AUTH ...
#define GNUNET_MQ_msg(mvar, type)
Allocate a GNUNET_MQ_Envelope.
Definition: gnunet_mq_lib.h:67
int kx_auth_requested
Force triggering KX_AUTH independent of estate.
#define GNUNET_NO
Definition: gnunet_common.h:78
Should the peer reply with its KX details?
static struct CadetTConnection * get_ready_connection(struct CadetTunnel *t)
Find first connection that is ready in the list of our connections.
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
GNUNET_CADET_KX_Flags
Flags to be used in GNUNET_CADET_KX.
void GNUNET_CRYPTO_hash(const void *block, size_t size, struct GNUNET_HashCode *ret)
Compute hash of a given block.
Definition: crypto_hash.c:48
struct GNUNET_STATISTICS_Handle * stats
Handle to the statistics service.
Message for a Key eXchange for a tunnel, with authentication.
struct GNUNET_CRYPTO_EcdhePublicKey last_ephemeral
Last ephemeral public key received from the other peer, for duplicate detection.
struct GNUNET_CADET_ConnectionTunnelIdentifier cid
ID of the connection.
struct GNUNET_CRYPTO_EcdhePublicKey ratchet_key
Sender&#39;s next ephemeral public ECC key encoded in a format suitable for network transmission, as created using &#39;gcry_sexp_sprint&#39;.
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_get(void)
Get the current time.
Definition: time.c:118
struct CadetConnection * cc
Connection handle.
void GNUNET_CRYPTO_ecdhe_key_get_public(const struct GNUNET_CRYPTO_EcdhePrivateKey *priv, struct GNUNET_CRYPTO_EcdhePublicKey *pub)
Extract the public key for the given private key.
Definition: crypto_ecc.c:301
struct GNUNET_TIME_Absolute next_kx_attempt
When do we try the next KX?
struct GNUNET_MQ_Envelope * env
Definition: 005.c:1
#define GNUNET_TIME_STD_BACKOFF(r)
Perform our standard exponential back-off calculation, starting at 1 ms and then going by a factor of...
Handshake completed: session key available.
struct GNUNET_CRYPTO_EddsaPrivateKey * my_private_key
Own private key.
void GCT_change_estate(struct CadetTunnel *t, enum CadetTunnelEState state)
Change the tunnel encryption state.
struct GNUNET_CRYPTO_SymmetricSessionKey RK
32-byte root key which gets updated by DH ratchet.
void GCC_transmit(struct CadetConnection *cc, struct GNUNET_MQ_Envelope *env)
Transmit message msg via connection cc.
The peer should reply with its KX details?
struct GNUNET_CRYPTO_EcdhePrivateKey DHRs
ECDH Ratchet key (our private key in the current DH).
struct GNUNET_HashCode auth
KDF-proof that sender could compute the 3-DH, used in lieu of a signature or payload data...
#define LOG(level,...)
#define GNUNET_MESSAGE_TYPE_CADET_TUNNEL_KX_AUTH
Axolotl key exchange response with authentication.
struct GNUNET_TIME_Relative kx_retry_delay
How long do we wait until we retry the KX?
#define GNUNET_YES
Definition: gnunet_common.h:77
struct GNUNET_CRYPTO_EcdhePublicKey ephemeral_key
Sender&#39;s ephemeral public ECC key encoded in a format suitable for network transmission, as created using &#39;gcry_sexp_sprint&#39;.
const char * GNUNET_e2s(const struct GNUNET_CRYPTO_EcdhePublicKey *p)
Convert a public key value to a string (for printing debug messages).
struct GNUNET_ShortHashCode connection_of_tunnel
enum CadetTunnelEState estate
State of the tunnel encryption.
struct GNUNET_CRYPTO_EcdhePrivateKey kx_0
ECDH for key exchange (A0 / B0).
Here is the call graph for this function:
Here is the caller graph for this function:

◆ cleanup_ax()

static void cleanup_ax ( struct CadetTunnelAxolotl ax)
static

Cleanup state used by ax.

Parameters
axstate to free, but not memory of ax itself

Definition at line 1497 of file gnunet-service-cadet_tunnels.c.

References delete_skipped_key(), CadetTunnelAxolotl::DHRs, GNUNET_assert, GNUNET_CRYPTO_ecdhe_key_clear(), CadetTunnelAxolotl::kx_0, CadetTunnelAxolotl::skipped, and CadetTunnelAxolotl::skipped_head.

Referenced by destroy_tunnel(), GCT_handle_encrypted(), and GCT_handle_kx_auth().

1498 {
1499  while (NULL != ax->skipped_head)
1500  delete_skipped_key (ax,
1501  ax->skipped_head);
1502  GNUNET_assert (0 == ax->skipped);
1505 }
void GNUNET_CRYPTO_ecdhe_key_clear(struct GNUNET_CRYPTO_EcdhePrivateKey *pk)
Clear memory that was used to store a private key.
Definition: crypto_ecc.c:570
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
static void delete_skipped_key(struct CadetTunnelAxolotl *ax, struct CadetTunnelSkippedKey *key)
Delete a key from the list of skipped keys.
struct GNUNET_CRYPTO_EcdhePrivateKey DHRs
ECDH Ratchet key (our private key in the current DH).
struct CadetTunnelSkippedKey * skipped_head
A (double linked) list of stored message keys and associated header keys for "skipped" messages...
unsigned int skipped
Number of elements in skipped_head <-> skipped_tail.
struct GNUNET_CRYPTO_EcdhePrivateKey kx_0
ECDH for key exchange (A0 / B0).
Here is the call graph for this function:
Here is the caller graph for this function:

◆ update_ax_by_kx()

static int update_ax_by_kx ( struct CadetTunnelAxolotl ax,
const struct GNUNET_PeerIdentity pid,
const struct GNUNET_CRYPTO_EcdhePublicKey ephemeral_key,
const struct GNUNET_CRYPTO_EcdhePublicKey ratchet_key 
)
static

Update our Axolotl key state based on the KX data we received.

Computes the new chain keys, and root keys, etc, and also checks wether this is a replay of the current chain.

Parameters

Definition at line 1522 of file gnunet-service-cadet_tunnels.c.

References alice_or_betty(), CadetTunnelAxolotl::CKr, CadetTunnelAxolotl::CKs, CadetTunnelAxolotl::DHRr, GNUNET_break_op, GNUNET_CRYPTO_ecc_ecdh(), GNUNET_CRYPTO_ecdh_eddsa(), GNUNET_CRYPTO_eddsa_ecdh(), GNUNET_CRYPTO_kdf(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_memcmp, GNUNET_NO, GNUNET_OK, GNUNET_STATISTICS_update(), GNUNET_SYSERR, GNUNET_TIME_absolute_add(), GNUNET_TIME_absolute_get(), GNUNET_YES, CadetTunnelAxolotl::HKr, CadetTunnelAxolotl::HKs, CadetTunnelAxolotl::kx_0, CadetTunnelAxolotl::last_ephemeral, LOG, my_private_key, CadetTunnelAxolotl::NHKr, CadetTunnelAxolotl::NHKs, GNUNET_PeerIdentity::public_key, CadetTunnelAxolotl::ratchet_expiration, CadetTunnelAxolotl::ratchet_flag, ratchet_time, CadetTunnelAxolotl::RK, and stats.

Referenced by GCT_handle_kx(), and GCT_handle_kx_auth().

1526 {
1527  struct GNUNET_HashCode key_material[3];
1528  struct GNUNET_CRYPTO_SymmetricSessionKey keys[5];
1529  const char salt[] = "CADET Axolotl salt";
1530  int am_I_alice;
1531 
1532  if (GNUNET_SYSERR == (am_I_alice = alice_or_betty (pid)))
1533  {
1534  GNUNET_break_op (0);
1535  return GNUNET_SYSERR;
1536  }
1537  if (0 == GNUNET_memcmp (&ax->DHRr,
1538  ratchet_key))
1539  {
1541  "# Ratchet key already known",
1542  1,
1543  GNUNET_NO);
1545  "Ratchet key already known. Ignoring KX.\n");
1546  return GNUNET_NO;
1547  }
1548 
1549  ax->DHRr = *ratchet_key;
1550  ax->last_ephemeral = *ephemeral_key;
1551  /* ECDH A B0 */
1552  if (GNUNET_YES == am_I_alice)
1553  {
1555  ephemeral_key, /* B0 */
1556  &key_material[0]);
1557  }
1558  else
1559  {
1560  GNUNET_CRYPTO_ecdh_eddsa (&ax->kx_0, /* b0 */
1561  &pid->public_key, /* A */
1562  &key_material[0]);
1563  }
1564  /* ECDH A0 B */
1565  if (GNUNET_YES == am_I_alice)
1566  {
1567  GNUNET_CRYPTO_ecdh_eddsa (&ax->kx_0, /* a0 */
1568  &pid->public_key, /* B */
1569  &key_material[1]);
1570  }
1571  else
1572  {
1574  ephemeral_key, /* A0 */
1575  &key_material[1]);
1576  }
1577 
1578  /* ECDH A0 B0 */
1579  GNUNET_CRYPTO_ecc_ecdh (&ax->kx_0, /* a0 or b0 */
1580  ephemeral_key, /* B0 or A0 */
1581  &key_material[2]);
1582  /* KDF */
1583  GNUNET_CRYPTO_kdf (keys, sizeof(keys),
1584  salt, sizeof(salt),
1585  &key_material, sizeof(key_material),
1586  NULL);
1587 
1588  if (0 == memcmp (&ax->RK,
1589  &keys[0],
1590  sizeof(ax->RK)))
1591  {
1593  "Root key already known. Ignoring KX.\n");
1595  "# Root key already known",
1596  1,
1597  GNUNET_NO);
1598  return GNUNET_NO;
1599  }
1600 
1601  ax->RK = keys[0];
1602  if (GNUNET_YES == am_I_alice)
1603  {
1604  ax->HKr = keys[1];
1605  ax->NHKs = keys[2];
1606  ax->NHKr = keys[3];
1607  ax->CKr = keys[4];
1608  ax->ratchet_flag = GNUNET_YES;
1609  }
1610  else
1611  {
1612  ax->HKs = keys[1];
1613  ax->NHKr = keys[2];
1614  ax->NHKs = keys[3];
1615  ax->CKs = keys[4];
1616  ax->ratchet_flag = GNUNET_NO;
1617  ax->ratchet_expiration
1619  ratchet_time);
1620  }
1621  return GNUNET_OK;
1622 }
struct GNUNET_CRYPTO_SymmetricSessionKey HKr
32-byte header key (currently used for receiving)
static int alice_or_betty(const struct GNUNET_PeerIdentity *other)
Am I Alice or Betty (some call her Bob), or talking to myself?
struct GNUNET_TIME_Absolute ratchet_expiration
Time when the current ratchet expires and a new one is triggered (if ratchet_allowed is GNUNET_YES)...
int GNUNET_CRYPTO_ecc_ecdh(const struct GNUNET_CRYPTO_EcdhePrivateKey *priv, const struct GNUNET_CRYPTO_EcdhePublicKey *pub, struct GNUNET_HashCode *key_material)
Derive key material from a public and a private ECC key.
Definition: crypto_ecc.c:1182
#define GNUNET_NO
Definition: gnunet_common.h:78
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
struct GNUNET_CRYPTO_SymmetricSessionKey NHKr
32-byte next header key (for receiving).
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_add(struct GNUNET_TIME_Absolute start, struct GNUNET_TIME_Relative duration)
Add a given relative duration to the given start time.
Definition: time.c:395
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
struct GNUNET_CRYPTO_SymmetricSessionKey CKr
32-byte chain keys (used for forward-secrecy) for receiving messages.
struct GNUNET_TIME_Relative ratchet_time
How long until we trigger a ratched advance due to time.
int GNUNET_CRYPTO_eddsa_ecdh(const struct GNUNET_CRYPTO_EddsaPrivateKey *priv, const struct GNUNET_CRYPTO_EcdhePublicKey *pub, struct GNUNET_HashCode *key_material)
Derive key material from a ECDH public key and a private EdDSA key.
Definition: crypto_ecc.c:1502
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
struct GNUNET_STATISTICS_Handle * stats
Handle to the statistics service.
struct GNUNET_CRYPTO_EcdhePublicKey last_ephemeral
Last ephemeral public key received from the other peer, for duplicate detection.
A 512-bit hashcode.
int GNUNET_CRYPTO_ecdh_eddsa(const struct GNUNET_CRYPTO_EcdhePrivateKey *priv, const struct GNUNET_CRYPTO_EddsaPublicKey *pub, struct GNUNET_HashCode *key_material)
Derive key material from a EdDSA public key and a private ECDH key.
Definition: crypto_ecc.c:1612
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_get(void)
Get the current time.
Definition: time.c:118
#define GNUNET_SYSERR
Definition: gnunet_common.h:76
#define GNUNET_memcmp(a, b)
Compare memory in a and b, where both must be of the same pointer type.
struct GNUNET_CRYPTO_EddsaPrivateKey * my_private_key
Own private key.
struct GNUNET_CRYPTO_SymmetricSessionKey RK
32-byte root key which gets updated by DH ratchet.
struct GNUNET_CRYPTO_EcdhePublicKey DHRr
ECDH Ratchet key (other peer&#39;s public key in the current DH).
struct GNUNET_CRYPTO_SymmetricSessionKey HKs
32-byte header key (currently used for sending).
#define LOG(level,...)
#define GNUNET_YES
Definition: gnunet_common.h:77
struct GNUNET_CRYPTO_SymmetricSessionKey CKs
32-byte chain keys (used for forward-secrecy) for sending messages.
int ratchet_flag
True (GNUNET_YES) if we have to send a new ratchet key in next msg.
int GNUNET_CRYPTO_kdf(void *result, size_t out_len, const void *xts, size_t xts_len, const void *skm, size_t skm_len,...)
Derive key.
Definition: crypto_kdf.c:89
struct GNUNET_CRYPTO_SymmetricSessionKey NHKs
32-byte next header key (for sending), used once the ratchet advances.
struct GNUNET_CRYPTO_EddsaPublicKey public_key
struct GNUNET_CRYPTO_EcdhePrivateKey kx_0
ECDH for key exchange (A0 / B0).
Here is the call graph for this function:
Here is the caller graph for this function:

◆ retry_kx()

static void retry_kx ( void *  cls)
static

Try to redo the KX or KX_AUTH handshake, if we can.

Parameters
clsthe struct CadetTunnel to do KX for.

Definition at line 1631 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::ax, CADET_TUNNEL_KEY_AX_AUTH_SENT, CADET_TUNNEL_KEY_AX_RECV, CADET_TUNNEL_KEY_AX_SENT, CADET_TUNNEL_KEY_AX_SENT_AND_RECV, CADET_TUNNEL_KEY_OK, CADET_TUNNEL_KEY_UNINITIALIZED, CadetTunnel::estate, estate2s(), GCT_2s(), GCT_count_channels(), GNUNET_break, GNUNET_ERROR_TYPE_DEBUG, GNUNET_NO, GNUNET_YES, CadetTunnel::kx_task, LOG, send_kx(), send_kx_auth(), t, and CadetTunnel::unverified_ax.

Referenced by connection_ready_cb(), GCT_add_channel(), GCT_handle_kx(), and GCT_handle_kx_auth().

1632 {
1633  struct CadetTunnel *t = cls;
1634  struct CadetTunnelAxolotl *ax;
1635 
1636  t->kx_task = NULL;
1638  "Trying to make KX progress on %s in state %s\n",
1639  GCT_2s (t),
1640  estate2s (t->estate));
1641  switch (t->estate)
1642  {
1643  case CADET_TUNNEL_KEY_UNINITIALIZED: /* first attempt */
1644  case CADET_TUNNEL_KEY_AX_SENT: /* trying again */
1645  send_kx (t,
1646  NULL,
1647  &t->ax);
1648  break;
1649 
1652  /* We are responding, so only require reply
1653  if WE have a channel waiting. */
1654  if (NULL != t->unverified_ax)
1655  {
1656  /* Send AX_AUTH so we might get this one verified */
1657  ax = t->unverified_ax;
1658  }
1659  else
1660  {
1661  /* How can this be? */
1662  GNUNET_break (0);
1663  ax = &t->ax;
1664  }
1665  send_kx_auth (t,
1666  NULL,
1667  ax,
1668  (0 == GCT_count_channels (t))
1669  ? GNUNET_NO
1670  : GNUNET_YES);
1671  break;
1672 
1674  /* We are responding, so only require reply
1675  if WE have a channel waiting. */
1676  if (NULL != t->unverified_ax)
1677  {
1678  /* Send AX_AUTH so we might get this one verified */
1679  ax = t->unverified_ax;
1680  }
1681  else
1682  {
1683  /* How can this be? */
1684  GNUNET_break (0);
1685  ax = &t->ax;
1686  }
1687  send_kx_auth (t,
1688  NULL,
1689  ax,
1690  (0 == GCT_count_channels (t))
1691  ? GNUNET_NO
1692  : GNUNET_YES);
1693  break;
1694 
1695  case CADET_TUNNEL_KEY_OK:
1696  /* Must have been the *other* peer asking us to
1697  respond with a KX_AUTH. */
1698  if (NULL != t->unverified_ax)
1699  {
1700  /* Sending AX_AUTH in response to AX so we might get this one verified */
1701  ax = t->unverified_ax;
1702  }
1703  else
1704  {
1705  /* Sending AX_AUTH in response to AX_AUTH */
1706  ax = &t->ax;
1707  }
1708  send_kx_auth (t,
1709  NULL,
1710  ax,
1711  GNUNET_NO);
1712  break;
1713  }
1714 }
struct CadetTunnelAxolotl ax
Axolotl info.
static const char * estate2s(enum CadetTunnelEState es)
Get string description for tunnel encryption state.
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
KX received and we sent KX_AUTH back, but we got no traffic yet, so we&#39;re waiting for either KX_AUTH ...
static void send_kx(struct CadetTunnel *t, struct CadetTConnection *ct, struct CadetTunnelAxolotl *ax)
Send a KX message.
#define GNUNET_NO
Definition: gnunet_common.h:78
KX message sent, waiting for other peer&#39;s KX_AUTH.
static struct GNUNET_SCHEDULER_Task * t
Main task.
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
struct GNUNET_SCHEDULER_Task * kx_task
Task to trigger KX.
struct CadetTunnelAxolotl * unverified_ax
Unverified Axolotl info, used only if we got a fresh KX (not a KX_AUTH) while our end of the tunnel w...
Struct containing all information regarding a tunnel to a peer.
Handshake completed: session key available.
KX message sent and received, trying to send back KX_AUTH.
Axolotl data, according to https://github.com/trevp/axolotl/wiki .
static void send_kx_auth(struct CadetTunnel *t, struct CadetTConnection *ct, struct CadetTunnelAxolotl *ax, int force_reply)
Send a KX_AUTH message.
unsigned int GCT_count_channels(struct CadetTunnel *t)
Count channels of a tunnel.
Uninitialized status, we need to send KX.
#define LOG(level,...)
KX message received, trying to send back KX_AUTH.
#define GNUNET_YES
Definition: gnunet_common.h:77
enum CadetTunnelEState estate
State of the tunnel encryption.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_handle_kx()

void GCT_handle_kx ( struct CadetTConnection ct,
const struct GNUNET_CADET_TunnelKeyExchangeMessage msg 
)

Handle KX message that lacks authentication (and which will thus only be considered authenticated after we respond with our own KX_AUTH and finally successfully decrypt payload).

Handle KX message.

Parameters
ctconnection/tunnel combo that received encrypted message
msgthe key exchange message

Definition at line 1726 of file gnunet-service-cadet_tunnels.c.

References alice_or_betty(), CadetTunnel::ax, CADET_TUNNEL_KEY_AX_RECV, CADET_TUNNEL_KEY_AX_SENT, CADET_TUNNEL_KEY_AX_SENT_AND_RECV, CADET_TUNNEL_KEY_OK, CADET_TUNNEL_KEY_UNINITIALIZED, CadetTConnection::cc, CadetTunnel::destination, CadetTunnelAxolotl::DHRr, CadetTunnelAxolotl::DHRs, GNUNET_CADET_TunnelKeyExchangeMessage::ephemeral_key, CadetTunnel::estate, GCC_2s(), GCP_get_id(), GCT_2s(), GCT_change_estate(), GNUNET_assert, GNUNET_break, GNUNET_break_op, GNUNET_CRYPTO_ecc_ecdh(), GNUNET_CRYPTO_ecdh_eddsa(), GNUNET_CRYPTO_ecdhe_key_get_public(), GNUNET_CRYPTO_eddsa_ecdh(), GNUNET_CRYPTO_eddsa_key_get_public(), GNUNET_e2s(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_memcmp, GNUNET_new, GNUNET_NO, GNUNET_OK, GNUNET_SCHEDULER_add_now(), GNUNET_SCHEDULER_cancel(), GNUNET_STATISTICS_update(), GNUNET_SYSERR, GNUNET_YES, CadetTunnelAxolotl::kx_0, CadetTunnel::kx_task, CadetTunnelAxolotl::last_ephemeral, LOG, GNUNET_CADET_TunnelKeyExchangeMessage::ratchet_key, ret, retry_kx(), CadetTunnelAxolotl::RK, send_kx_auth(), CadetTunnelAxolotl::skipped_head, stats, t, CadetTConnection::t, CadetTunnel::unverified_attempts, CadetTunnel::unverified_ax, and update_ax_by_kx().

Referenced by GCC_handle_kx().

1728 {
1729  struct CadetTunnel *t = ct->t;
1730  int ret;
1731 
1733  "# KX received",
1734  1,
1735  GNUNET_NO);
1736  if (GNUNET_YES ==
1738  {
1739  /* Betty/Bob is not allowed to send KX! */
1740  GNUNET_break_op (0);
1741  return;
1742  }
1744  "Received KX message from %s with ephemeral %s from %s on connection %s\n",
1745  GCT_2s (t),
1746  GNUNET_e2s (&msg->ephemeral_key),
1748  GCC_2s (ct->cc));
1749 #if 1
1750  if ((0 ==
1751  memcmp (&t->ax.DHRr,
1752  &msg->ratchet_key,
1753  sizeof(msg->ratchet_key))) &&
1754  (0 ==
1755  memcmp (&t->ax.last_ephemeral,
1756  &msg->ephemeral_key,
1757  sizeof(msg->ephemeral_key))))
1758 
1759  {
1761  "# Duplicate KX received",
1762  1,
1763  GNUNET_NO);
1764  send_kx_auth (t,
1765  ct,
1766  &t->ax,
1767  GNUNET_NO);
1768  return;
1769  }
1770 #endif
1771  /* We only keep ONE unverified KX around, so if there is an existing one,
1772  clean it up. */
1773  if (NULL != t->unverified_ax)
1774  {
1775  if ((0 ==
1776  memcmp (&t->unverified_ax->DHRr,
1777  &msg->ratchet_key,
1778  sizeof(msg->ratchet_key))) &&
1779  (0 ==
1780  memcmp (&t->unverified_ax->last_ephemeral,
1781  &msg->ephemeral_key,
1782  sizeof(msg->ephemeral_key))))
1783  {
1785  "# Duplicate unverified KX received",
1786  1,
1787  GNUNET_NO);
1788 #if 1
1789  send_kx_auth (t,
1790  ct,
1791  t->unverified_ax,
1792  GNUNET_NO);
1793  return;
1794 #endif
1795  }
1797  "Dropping old unverified KX state.\n");
1799  "# Unverified KX dropped for fresh KX",
1800  1,
1801  GNUNET_NO);
1802  GNUNET_break (NULL == t->unverified_ax->skipped_head);
1803  memset (t->unverified_ax,
1804  0,
1805  sizeof(struct CadetTunnelAxolotl));
1806  }
1807  else
1808  {
1810  "Creating fresh unverified KX for %s\n",
1811  GCT_2s (t));
1813  "# Fresh KX setup",
1814  1,
1815  GNUNET_NO);
1817  }
1818  /* Set as the 'current' RK/DHRr the one we are currently using,
1819  so that the duplicate-detection logic of
1820  #update_ax_by_kx can work. */
1821  t->unverified_ax->RK = t->ax.RK;
1822  t->unverified_ax->DHRr = t->ax.DHRr;
1823  t->unverified_ax->DHRs = t->ax.DHRs;
1824  t->unverified_ax->kx_0 = t->ax.kx_0;
1825  t->unverified_attempts = 0;
1826 
1827  /* Update 'ax' by the new key material */
1828  ret = update_ax_by_kx (t->unverified_ax,
1829  GCP_get_id (t->destination),
1830  &msg->ephemeral_key,
1831  &msg->ratchet_key);
1832  GNUNET_break (GNUNET_SYSERR != ret);
1833  if (GNUNET_OK != ret)
1834  {
1836  "# Useless KX",
1837  1,
1838  GNUNET_NO);
1839  return; /* duplicate KX, nothing to do */
1840  }
1841  /* move ahead in our state machine */
1843  GCT_change_estate (t,
1845  else if (CADET_TUNNEL_KEY_AX_SENT == t->estate)
1846  GCT_change_estate (t,
1848 
1849  /* KX is still not done, try again our end. */
1850  if (CADET_TUNNEL_KEY_OK != t->estate)
1851  {
1852  if (NULL != t->kx_task)
1854  t->kx_task
1856  t);
1857  }
1858 }
struct CadetTunnelAxolotl ax
Axolotl info.
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
const char * GCC_2s(const struct CadetConnection *cc)
Get a (static) string for a connection.
static int alice_or_betty(const struct GNUNET_PeerIdentity *other)
Am I Alice or Betty (some call her Bob), or talking to myself?
static int ret
Return value of the commandline.
Definition: gnunet-abd.c:81
#define GNUNET_NO
Definition: gnunet_common.h:78
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
#define GNUNET_new(type)
Allocate a struct or union of the given type.
KX message sent, waiting for other peer&#39;s KX_AUTH.
static struct GNUNET_SCHEDULER_Task * t
Main task.
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
static int update_ax_by_kx(struct CadetTunnelAxolotl *ax, const struct GNUNET_PeerIdentity *pid, const struct GNUNET_CRYPTO_EcdhePublicKey *ephemeral_key, const struct GNUNET_CRYPTO_EcdhePublicKey *ratchet_key)
Update our Axolotl key state based on the KX data we received.
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
struct GNUNET_SCHEDULER_Task * kx_task
Task to trigger KX.
struct CadetTunnel * t
Tunnel this connection belongs to.
struct CadetTunnelAxolotl * unverified_ax
Unverified Axolotl info, used only if we got a fresh KX (not a KX_AUTH) while our end of the tunnel w...
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
struct GNUNET_STATISTICS_Handle * stats
Handle to the statistics service.
struct GNUNET_CRYPTO_EcdhePublicKey last_ephemeral
Last ephemeral public key received from the other peer, for duplicate detection.
struct GNUNET_SCHEDULER_Task * GNUNET_SCHEDULER_add_now(GNUNET_SCHEDULER_TaskCallback task, void *task_cls)
Schedule a new task to be run as soon as possible.
Definition: scheduler.c:1280
unsigned int unverified_attempts
How often have we tried and failed to decrypt a message using the unverified KX material from unverif...
struct GNUNET_CRYPTO_EcdhePublicKey ratchet_key
Sender&#39;s next ephemeral public ECC key encoded in a format suitable for network transmission, as created using &#39;gcry_sexp_sprint&#39;.
struct CadetConnection * cc
Connection handle.
Struct containing all information regarding a tunnel to a peer.
#define GNUNET_SYSERR
Definition: gnunet_common.h:76
Handshake completed: session key available.
void GCT_change_estate(struct CadetTunnel *t, enum CadetTunnelEState state)
Change the tunnel encryption state.
struct GNUNET_CRYPTO_SymmetricSessionKey RK
32-byte root key which gets updated by DH ratchet.
struct GNUNET_CRYPTO_EcdhePublicKey DHRr
ECDH Ratchet key (other peer&#39;s public key in the current DH).
KX message sent and received, trying to send back KX_AUTH.
struct CadetPeer * destination
Destination of the tunnel.
struct GNUNET_CRYPTO_EcdhePrivateKey DHRs
ECDH Ratchet key (our private key in the current DH).
Axolotl data, according to https://github.com/trevp/axolotl/wiki .
struct CadetTunnelSkippedKey * skipped_head
A (double linked) list of stored message keys and associated header keys for "skipped" messages...
static void send_kx_auth(struct CadetTunnel *t, struct CadetTConnection *ct, struct CadetTunnelAxolotl *ax, int force_reply)
Send a KX_AUTH message.
static void retry_kx(void *cls)
Try to redo the KX or KX_AUTH handshake, if we can.
Uninitialized status, we need to send KX.
#define LOG(level,...)
KX message received, trying to send back KX_AUTH.
#define GNUNET_YES
Definition: gnunet_common.h:77
struct GNUNET_CRYPTO_EcdhePublicKey ephemeral_key
Sender&#39;s ephemeral public ECC key encoded in a format suitable for network transmission, as created using &#39;gcry_sexp_sprint&#39;.
const char * GNUNET_e2s(const struct GNUNET_CRYPTO_EcdhePublicKey *p)
Convert a public key value to a string (for printing debug messages).
enum CadetTunnelEState estate
State of the tunnel encryption.
const char * GNUNET_i2s(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
const struct GNUNET_PeerIdentity * GCP_get_id(struct CadetPeer *cp)
Obtain the peer identity for a struct CadetPeer.
struct GNUNET_CRYPTO_EcdhePrivateKey kx_0
ECDH for key exchange (A0 / B0).
void * GNUNET_SCHEDULER_cancel(struct GNUNET_SCHEDULER_Task *task)
Cancel the task with the specified identifier.
Definition: scheduler.c:966
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_handle_kx_auth()

void GCT_handle_kx_auth ( struct CadetTConnection ct,
const struct GNUNET_CADET_TunnelKeyExchangeAuthMessage msg 
)

Handle KX_AUTH message.

Parameters
ctconnection/tunnel combo that received encrypted message
msgthe key exchange message

Definition at line 1936 of file gnunet-service-cadet_tunnels.c.

References GNUNET_CADET_TunnelKeyExchangeAuthMessage::auth, CadetTunnel::ax, CADET_TUNNEL_KEY_AX_AUTH_SENT, CADET_TUNNEL_KEY_AX_RECV, CADET_TUNNEL_KEY_AX_SENT, CADET_TUNNEL_KEY_AX_SENT_AND_RECV, CADET_TUNNEL_KEY_OK, CADET_TUNNEL_KEY_UNINITIALIZED, cleanup_ax(), CadetTunnel::destination, GNUNET_CADET_TunnelKeyExchangeMessage::ephemeral_key, CadetTunnel::estate, GNUNET_CADET_TunnelKeyExchangeMessage::flags, GCP_get_id(), GCT_2s(), GCT_change_estate(), GNUNET_assert, GNUNET_break, GNUNET_break_op, GNUNET_CADET_KX_FLAG_FORCE_REPLY, GNUNET_CRYPTO_ecdhe_key_get_public(), GNUNET_CRYPTO_hash(), GNUNET_e2s(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_WARNING, GNUNET_free, GNUNET_memcmp, GNUNET_NO, GNUNET_OK, GNUNET_SCHEDULER_add_at(), GNUNET_STATISTICS_update(), GNUNET_CADET_TunnelKeyExchangeAuthMessage::kx, CadetTunnelAxolotl::kx_0, CadetTunnel::kx_task, LOG, my_private_key, CadetTunnel::next_kx_attempt, GNUNET_CADET_TunnelKeyExchangeMessage::ratchet_key, ret, retry_kx(), CadetTunnelAxolotl::RK, send_kx_auth(), stats, t, CadetTConnection::t, CadetTunnel::unverified_ax, and update_ax_by_kx().

Referenced by GCC_handle_kx_auth().

1938 {
1939  struct CadetTunnel *t = ct->t;
1940  struct CadetTunnelAxolotl ax_tmp;
1941  struct GNUNET_HashCode kx_auth;
1942  int ret;
1943 
1945  "# KX_AUTH received",
1946  1,
1947  GNUNET_NO);
1948  if ((CADET_TUNNEL_KEY_UNINITIALIZED == t->estate) ||
1950  {
1951  /* Confusing, we got a KX_AUTH before we even send our own
1952  KX. This should not happen. We'll send our own KX ASAP anyway,
1953  so let's ignore this here. */
1954  GNUNET_break_op (0);
1955  return;
1956  }
1958  "Handling KX_AUTH message from %s with ephemeral %s\n",
1959  GCT_2s (t),
1960  GNUNET_e2s (&msg->kx.ephemeral_key));
1961  /* We do everything in ax_tmp until we've checked the authentication
1962  so we don't clobber anything we care about by accident. */
1963  ax_tmp = t->ax;
1964 
1965  /* Update 'ax' by the new key material */
1966  ret = update_ax_by_kx (&ax_tmp,
1967  GCP_get_id (t->destination),
1968  &msg->kx.ephemeral_key,
1969  &msg->kx.ratchet_key);
1970  if (GNUNET_OK != ret)
1971  {
1972  if (GNUNET_NO == ret)
1974  "# redundant KX_AUTH received",
1975  1,
1976  GNUNET_NO);
1977  else
1978  GNUNET_break (0); /* connect to self!? */
1979  return;
1980  }
1981  GNUNET_CRYPTO_hash (&ax_tmp.RK,
1982  sizeof(ax_tmp.RK),
1983  &kx_auth);
1984  if (0 != GNUNET_memcmp (&kx_auth,
1985  &msg->auth))
1986  {
1987  /* This KX_AUTH is not using the latest KX/KX_AUTH data
1988  we transmitted to the sender, refuse it, try KX again. */
1990  "# KX_AUTH not using our last KX received (auth failure)",
1991  1,
1992  GNUNET_NO);
1994  "KX AUTH mismatch!\n");
1995 #if DEBUG_KX
1996  {
1997  struct GNUNET_CRYPTO_EcdhePublicKey ephemeral_key;
1998 
1999  GNUNET_CRYPTO_ecdhe_key_get_public (&ax_tmp.kx_0,
2000  &ephemeral_key);
2001  if (0 != GNUNET_memcmp (&ephemeral_key,
2002  &msg->r_ephemeral_key_XXX))
2003  {
2005  "My ephemeral is %s!\n",
2006  GNUNET_e2s (&ephemeral_key));
2008  "Response is for ephemeral %s!\n",
2009  GNUNET_e2s (&msg->r_ephemeral_key_XXX));
2010  }
2011  else
2012  {
2013  test_crypto_bug (&ax_tmp.kx_0,
2014  &msg->kx.ephemeral_key_XXX,
2016  &msg->kx.private_key_XXX);
2017  }
2018  }
2019 #endif
2020  if (NULL == t->kx_task)
2021  t->kx_task
2023  &retry_kx,
2024  t);
2025  return;
2026  }
2027  /* Yep, we're good. */
2028  t->ax = ax_tmp;
2029  if (NULL != t->unverified_ax)
2030  {
2031  /* We got some "stale" KX before, drop that. */
2034  t->unverified_ax = NULL;
2035  }
2036 
2037  /* move ahead in our state machine */
2038  switch (t->estate)
2039  {
2042  /* Checked above, this is impossible. */
2043  GNUNET_assert (0);
2044  break;
2045 
2046  case CADET_TUNNEL_KEY_AX_SENT: /* This is the normal case */
2047  case CADET_TUNNEL_KEY_AX_SENT_AND_RECV: /* both peers started KX */
2048  case CADET_TUNNEL_KEY_AX_AUTH_SENT: /* both peers now did KX_AUTH */
2049  GCT_change_estate (t,
2051  break;
2052 
2053  case CADET_TUNNEL_KEY_OK:
2054  /* Did not expect another KX_AUTH, but so what, still acceptable.
2055  Nothing to do here. */
2056  break;
2057  }
2058  if (0 != (GNUNET_CADET_KX_FLAG_FORCE_REPLY & ntohl (msg->kx.flags)))
2059  {
2060  send_kx_auth (t,
2061  NULL,
2062  &t->ax,
2063  GNUNET_NO);
2064  }
2065 }
struct CadetTunnelAxolotl ax
Axolotl info.
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
struct GNUNET_CADET_TunnelKeyExchangeMessage kx
Message header with key material.
uint32_t flags
Flags for the key exchange in NBO, based on enum GNUNET_CADET_KX_Flags.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
KX received and we sent KX_AUTH back, but we got no traffic yet, so we&#39;re waiting for either KX_AUTH ...
static int ret
Return value of the commandline.
Definition: gnunet-abd.c:81
#define GNUNET_NO
Definition: gnunet_common.h:78
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
KX message sent, waiting for other peer&#39;s KX_AUTH.
static struct GNUNET_SCHEDULER_Task * t
Main task.
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
static int update_ax_by_kx(struct CadetTunnelAxolotl *ax, const struct GNUNET_PeerIdentity *pid, const struct GNUNET_CRYPTO_EcdhePublicKey *ephemeral_key, const struct GNUNET_CRYPTO_EcdhePublicKey *ratchet_key)
Update our Axolotl key state based on the KX data we received.
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
struct GNUNET_SCHEDULER_Task * kx_task
Task to trigger KX.
struct CadetTunnel * t
Tunnel this connection belongs to.
struct CadetTunnelAxolotl * unverified_ax
Unverified Axolotl info, used only if we got a fresh KX (not a KX_AUTH) while our end of the tunnel w...
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
void GNUNET_CRYPTO_hash(const void *block, size_t size, struct GNUNET_HashCode *ret)
Compute hash of a given block.
Definition: crypto_hash.c:48
struct GNUNET_STATISTICS_Handle * stats
Handle to the statistics service.
A 512-bit hashcode.
struct GNUNET_CRYPTO_EcdhePublicKey ratchet_key
Sender&#39;s next ephemeral public ECC key encoded in a format suitable for network transmission, as created using &#39;gcry_sexp_sprint&#39;.
Struct containing all information regarding a tunnel to a peer.
void GNUNET_CRYPTO_ecdhe_key_get_public(const struct GNUNET_CRYPTO_EcdhePrivateKey *priv, struct GNUNET_CRYPTO_EcdhePublicKey *pub)
Extract the public key for the given private key.
Definition: crypto_ecc.c:301
struct GNUNET_TIME_Absolute next_kx_attempt
When do we try the next KX?
Handshake completed: session key available.
#define GNUNET_memcmp(a, b)
Compare memory in a and b, where both must be of the same pointer type.
struct GNUNET_CRYPTO_EddsaPrivateKey * my_private_key
Own private key.
void GCT_change_estate(struct CadetTunnel *t, enum CadetTunnelEState state)
Change the tunnel encryption state.
KX message sent and received, trying to send back KX_AUTH.
struct CadetPeer * destination
Destination of the tunnel.
The peer should reply with its KX details?
Axolotl data, according to https://github.com/trevp/axolotl/wiki .
struct GNUNET_HashCode auth
KDF-proof that sender could compute the 3-DH, used in lieu of a signature or payload data...
static void send_kx_auth(struct CadetTunnel *t, struct CadetTConnection *ct, struct CadetTunnelAxolotl *ax, int force_reply)
Send a KX_AUTH message.
Public ECC key (always for Curve25519) encoded in a format suitable for network transmission and encr...
static void retry_kx(void *cls)
Try to redo the KX or KX_AUTH handshake, if we can.
static void cleanup_ax(struct CadetTunnelAxolotl *ax)
Cleanup state used by ax.
Uninitialized status, we need to send KX.
#define LOG(level,...)
KX message received, trying to send back KX_AUTH.
struct GNUNET_CRYPTO_EcdhePublicKey ephemeral_key
Sender&#39;s ephemeral public ECC key encoded in a format suitable for network transmission, as created using &#39;gcry_sexp_sprint&#39;.
const char * GNUNET_e2s(const struct GNUNET_CRYPTO_EcdhePublicKey *p)
Convert a public key value to a string (for printing debug messages).
struct GNUNET_SCHEDULER_Task * GNUNET_SCHEDULER_add_at(struct GNUNET_TIME_Absolute at, GNUNET_SCHEDULER_TaskCallback task, void *task_cls)
Schedule a new task to be run at the specified time.
Definition: scheduler.c:1230
enum CadetTunnelEState estate
State of the tunnel encryption.
#define GNUNET_free(ptr)
Wrapper around free.
const struct GNUNET_PeerIdentity * GCP_get_id(struct CadetPeer *cp)
Obtain the peer identity for a struct CadetPeer.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ get_next_free_ctn()

static struct GNUNET_CADET_ChannelTunnelNumber get_next_free_ctn ( struct CadetTunnel t)
static

Compute the next free channel tunnel number for this tunnel.

Parameters
tthe tunnel
Returns
unused number that can uniquely identify a channel in the tunnel

Definition at line 2078 of file gnunet-service-cadet_tunnels.c.

References GNUNET_CADET_ChannelTunnelNumber::cn, GCP_get_id(), GCT_get_destination(), GNUNET_assert, GNUNET_CONTAINER_multihashmap32_get(), GNUNET_memcmp, HIGH_BIT, my_full_id, ret, and t.

Referenced by GCT_add_channel().

2079 {
2080 #define HIGH_BIT 0x8000000
2082  uint32_t ctn;
2083  int cmp;
2084  uint32_t highbit;
2085 
2086  cmp = GNUNET_memcmp (&my_full_id,
2088  if (0 < cmp)
2089  highbit = HIGH_BIT;
2090  else if (0 > cmp)
2091  highbit = 0;
2092  else
2093  GNUNET_assert (0); // loopback must never go here!
2094  ctn = ntohl (t->next_ctn.cn);
2095  while (NULL !=
2097  ctn | highbit))
2098  {
2099  ctn = ((ctn + 1) & (~HIGH_BIT));
2100  }
2101  t->next_ctn.cn = htonl ((ctn + 1) & (~HIGH_BIT));
2102  ret.cn = htonl (ctn | highbit);
2103  return ret;
2104 }
struct GNUNET_CONTAINER_MultiHashMap32 * channels
Channels inside this tunnel.
uint32_t cn
Which number does this channel have that uniquely identfies it within its tunnel, in network byte ord...
struct CadetPeer * GCT_get_destination(struct CadetTunnel *t)
Return the peer to which this tunnel goes.
struct GNUNET_PeerIdentity my_full_id
Local peer own ID.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
static int ret
Return value of the commandline.
Definition: gnunet-abd.c:81
struct GNUNET_CADET_ChannelTunnelNumber next_ctn
Channel ID for the next created channel in this tunnel.
void * GNUNET_CONTAINER_multihashmap32_get(const struct GNUNET_CONTAINER_MultiHashMap32 *map, uint32_t key)
Given a key find a value in the map matching the key.
#define GNUNET_memcmp(a, b)
Compare memory in a and b, where both must be of the same pointer type.
#define HIGH_BIT
Number identifying a CADET channel within a tunnel.
const struct GNUNET_PeerIdentity * GCP_get_id(struct CadetPeer *cp)
Obtain the peer identity for a struct CadetPeer.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_add_channel()

struct GNUNET_CADET_ChannelTunnelNumber GCT_add_channel ( struct CadetTunnel t,
struct CadetChannel ch 
)

Add a channel to a tunnel, and notify channel that we are ready for transmission if we are already up.

Add a channel to a tunnel.

Otherwise that notification will be done later in notify_tunnel_up_cb().

Parameters
tTunnel.
chChannel
Returns
unique number identifying ch within t

Definition at line 2117 of file gnunet-service-cadet_tunnels.c.

References CADET_TUNNEL_KEY_AX_AUTH_SENT, CADET_TUNNEL_KEY_AX_RECV, CADET_TUNNEL_KEY_AX_SENT, CADET_TUNNEL_KEY_AX_SENT_AND_RECV, CADET_TUNNEL_KEY_OK, CADET_TUNNEL_KEY_UNINITIALIZED, ch, GCCH_2s(), GCCH_tunnel_up(), GCT_2s(), get_next_free_ctn(), GNUNET_assert, GNUNET_CONTAINER_multihashmap32_put(), GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY, GNUNET_ERROR_TYPE_DEBUG, GNUNET_SCHEDULER_add_at(), GNUNET_SCHEDULER_cancel(), GNUNET_YES, LOG, and retry_kx().

Referenced by GCCH_channel_local_new().

2119 {
2121 
2122  ctn = get_next_free_ctn (t);
2123  if (NULL != t->destroy_task)
2124  {
2126  t->destroy_task = NULL;
2127  }
2130  ntohl (ctn.cn),
2131  ch,
2134  "Adding %s to %s\n",
2135  GCCH_2s (ch),
2136  GCT_2s (t));
2137  switch (t->estate)
2138  {
2140  /* waiting for connection to start KX */
2141  break;
2142 
2146  /* we're currently waiting for KX to complete */
2147  break;
2148 
2150  /* waiting for OTHER peer to send us data,
2151  we might need to prompt more aggressively! */
2152  if (NULL == t->kx_task)
2153  t->kx_task
2155  &retry_kx,
2156  t);
2157  break;
2158 
2159  case CADET_TUNNEL_KEY_OK:
2160  /* We are ready. Tell the new channel that we are up. */
2161  GCCH_tunnel_up (ch);
2162  break;
2163  }
2164  return ctn;
2165 }
struct GNUNET_CONTAINER_MultiHashMap32 * channels
Channels inside this tunnel.
void GCCH_tunnel_up(struct CadetChannel *ch)
Function called once and only once after a channel was bound to its tunnel via GCT_add_channel() is r...
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
KX received and we sent KX_AUTH back, but we got no traffic yet, so we&#39;re waiting for either KX_AUTH ...
KX message sent, waiting for other peer&#39;s KX_AUTH.
struct GNUNET_SCHEDULER_Task * destroy_task
Task scheduled if there are no more channels using the tunnel.
int GNUNET_CONTAINER_multihashmap32_put(struct GNUNET_CONTAINER_MultiHashMap32 *map, uint32_t key, void *value, enum GNUNET_CONTAINER_MultiHashMapOption opt)
Store a key-value pair in the map.
struct GNUNET_SCHEDULER_Task * kx_task
Task to trigger KX.
There must only be one value per key; storing a value should fail if a value under the same key alrea...
struct GNUNET_TIME_Absolute next_kx_attempt
When do we try the next KX?
Handshake completed: session key available.
const char * GCCH_2s(const struct CadetChannel *ch)
Get the static string for identification of the channel.
KX message sent and received, trying to send back KX_AUTH.
Number identifying a CADET channel within a tunnel.
static void retry_kx(void *cls)
Try to redo the KX or KX_AUTH handshake, if we can.
Uninitialized status, we need to send KX.
#define LOG(level,...)
KX message received, trying to send back KX_AUTH.
#define GNUNET_YES
Definition: gnunet_common.h:77
struct GNUNET_SCHEDULER_Task * GNUNET_SCHEDULER_add_at(struct GNUNET_TIME_Absolute at, GNUNET_SCHEDULER_TaskCallback task, void *task_cls)
Schedule a new task to be run at the specified time.
Definition: scheduler.c:1230
enum CadetTunnelEState estate
State of the tunnel encryption.
void * GNUNET_SCHEDULER_cancel(struct GNUNET_SCHEDULER_Task *task)
Cancel the task with the specified identifier.
Definition: scheduler.c:966
static struct GNUNET_CADET_ChannelTunnelNumber get_next_free_ctn(struct CadetTunnel *t)
Compute the next free channel tunnel number for this tunnel.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_connection_lost()

void GCT_connection_lost ( struct CadetTConnection ct)

We lost a connection, remove it from our list and clean up the connection object itself.

Parameters
ctbinding of connection to tunnel of the connection that was lost.

Definition at line 2175 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::connection_busy_head, CadetTunnel::connection_busy_tail, CadetTunnel::connection_ready_head, CadetTunnel::connection_ready_tail, GNUNET_CONTAINER_DLL_remove, GNUNET_free, GNUNET_YES, CadetTConnection::is_ready, CadetTunnel::num_busy_connections, CadetTunnel::num_ready_connections, and CadetTConnection::t.

Referenced by destroy_t_connection(), GCC_create_inbound(), and GCC_destroy_without_core().

2176 {
2177  struct CadetTunnel *t = ct->t;
2178 
2179  if (GNUNET_YES == ct->is_ready)
2180  {
2183  ct);
2184  t->num_ready_connections--;
2185  }
2186  else
2187  {
2190  ct);
2191  t->num_busy_connections--;
2192  }
2193  GNUNET_free (ct);
2194 }
#define GNUNET_CONTAINER_DLL_remove(head, tail, element)
Remove an element from a DLL.
struct CadetTConnection * connection_ready_tail
DLL of ready connections that are actively used to reach the destination peer.
int is_ready
Is the connection currently ready for transmission?
unsigned int num_ready_connections
Number of connections in the connection_ready_head DLL.
struct CadetTConnection * connection_ready_head
DLL of ready connections that are actively used to reach the destination peer.
static struct GNUNET_SCHEDULER_Task * t
Main task.
struct CadetTConnection * connection_busy_head
DLL of connections that we maintain that might be used to reach the destination peer.
struct CadetTunnel * t
Tunnel this connection belongs to.
Struct containing all information regarding a tunnel to a peer.
#define GNUNET_YES
Definition: gnunet_common.h:77
unsigned int num_busy_connections
Number of connections in the connection_busy_head DLL.
struct CadetTConnection * connection_busy_tail
DLL of connections that we maintain that might be used to reach the destination peer.
#define GNUNET_free(ptr)
Wrapper around free.
Here is the caller graph for this function:

◆ destroy_t_connection()

static void destroy_t_connection ( void *  cls,
struct CadetTConnection ct 
)
static

Clean up connection ct of a tunnel.

Parameters
clsthe struct CadetTunnel
ctconnection to clean up

Definition at line 2204 of file gnunet-service-cadet_tunnels.c.

References CadetTConnection::cc, GCC_destroy_without_tunnel(), GCT_connection_lost(), GNUNET_assert, and CadetTConnection::t.

Referenced by destroy_tunnel(), and maintain_connections_cb().

2206 {
2207  struct CadetTunnel *t = cls;
2208  struct CadetConnection *cc = ct->cc;
2209 
2210  GNUNET_assert (ct->t == t);
2211  GCT_connection_lost (ct);
2213 }
void GCT_connection_lost(struct CadetTConnection *ct)
We lost a connection, remove it from our list and clean up the connection object itself.
Low-level connection to a destination.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
static struct GNUNET_SCHEDULER_Task * t
Main task.
struct CadetTunnel * t
Tunnel this connection belongs to.
void GCC_destroy_without_tunnel(struct CadetConnection *cc)
Destroy a connection, called if the tunnel association with the connection was already broken...
struct CadetConnection * cc
Connection handle.
Struct containing all information regarding a tunnel to a peer.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ destroy_tunnel()

static void destroy_tunnel ( void *  cls)
static

This tunnel is no longer used, destroy it.

Parameters
clsthe idle tunnel

Definition at line 2222 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::ax, CadetTunnel::channels, cleanup_ax(), CadetTunnel::connection_busy_head, CadetTunnel::connection_ready_head, CadetTunnelQueueEntry::cont, CadetTunnelQueueEntry::cont_cls, CadetTunnel::destination, destroy_t_connection(), CadetTunnel::destroy_task, GCP_drop_tunnel(), GCT_2s(), GCT_count_channels(), GCT_iterate_connections(), GCT_send_cancel(), GNUNET_assert, GNUNET_CONTAINER_multihashmap32_destroy(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_MQ_destroy(), GNUNET_MST_destroy(), GNUNET_SCHEDULER_cancel(), CadetTunnel::kx_task, LOG, CadetTunnel::maintain_connections_task, CadetTunnel::mq, CadetTunnel::mst, CadetTunnel::send_task, CadetTunnel::tq_head, and CadetTunnel::unverified_ax.

Referenced by connection_ready_cb(), GCT_destroy_tunnel_now(), and GCT_remove_channel().

2223 {
2224  struct CadetTunnel *t = cls;
2225  struct CadetTunnelQueueEntry *tq;
2226 
2227  t->destroy_task = NULL;
2229  "Destroying idle %s\n",
2230  GCT_2s (t));
2231  GNUNET_assert (0 == GCT_count_channels (t));
2234  t);
2235  GNUNET_assert (NULL == t->connection_ready_head);
2236  GNUNET_assert (NULL == t->connection_busy_head);
2237  while (NULL != (tq = t->tq_head))
2238  {
2239  if (NULL != tq->cont)
2240  tq->cont (tq->cont_cls,
2241  NULL);
2242  GCT_send_cancel (tq);
2243  }
2245  t);
2247  if (NULL != t->maintain_connections_task)
2248  {
2250  t->maintain_connections_task = NULL;
2251  }
2252  if (NULL != t->send_task)
2253  {
2255  t->send_task = NULL;
2256  }
2257  if (NULL != t->kx_task)
2258  {
2260  t->kx_task = NULL;
2261  }
2262  GNUNET_MST_destroy (t->mst);
2263  GNUNET_MQ_destroy (t->mq);
2264  if (NULL != t->unverified_ax)
2265  {
2268  }
2269  cleanup_ax (&t->ax);
2270  GNUNET_assert (NULL == t->destroy_task);
2271  GNUNET_free (t);
2272 }
struct CadetTunnelAxolotl ax
Axolotl info.
struct GNUNET_CONTAINER_MultiHashMap32 * channels
Channels inside this tunnel.
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
struct GNUNET_MQ_Handle * mq
Dispatcher for decrypted messages only (do NOT use for sending!).
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
void GCT_send_cancel(struct CadetTunnelQueueEntry *tq)
Cancel a previously sent message while it&#39;s in the queue.
struct CadetTConnection * connection_ready_head
DLL of ready connections that are actively used to reach the destination peer.
static struct GNUNET_SCHEDULER_Task * t
Main task.
struct GNUNET_SCHEDULER_Task * destroy_task
Task scheduled if there are no more channels using the tunnel.
struct CadetTConnection * connection_busy_head
DLL of connections that we maintain that might be used to reach the destination peer.
struct GNUNET_SCHEDULER_Task * kx_task
Task to trigger KX.
struct CadetTunnelAxolotl * unverified_ax
Unverified Axolotl info, used only if we got a fresh KX (not a KX_AUTH) while our end of the tunnel w...
void GNUNET_MST_destroy(struct GNUNET_MessageStreamTokenizer *mst)
Destroys a tokenizer.
Definition: mst.c:411
struct GNUNET_MessageStreamTokenizer * mst
Tokenizer for decrypted messages.
void GNUNET_CONTAINER_multihashmap32_destroy(struct GNUNET_CONTAINER_MultiHashMap32 *map)
Destroy a 32-bit key hash map.
Struct containing all information regarding a tunnel to a peer.
Struct used to save messages in a non-ready tunnel to send once connected.
struct CadetTunnelQueueEntry * tq_head
Queued messages, to transmit once tunnel gets connected.
void * cont_cls
Closure for cont.
void GCP_drop_tunnel(struct CadetPeer *cp, struct CadetTunnel *t)
The tunnel to the given peer no longer exists, remove it from our data structures, and possibly clean up the peer itself.
struct CadetPeer * destination
Destination of the tunnel.
unsigned int GCT_count_channels(struct CadetTunnel *t)
Count channels of a tunnel.
struct GNUNET_SCHEDULER_Task * maintain_connections_task
Task to trim connections if too many are present.
void GCT_iterate_connections(struct CadetTunnel *t, GCT_ConnectionIterator iter, void *iter_cls)
Iterate over all connections of a tunnel.
static void destroy_t_connection(void *cls, struct CadetTConnection *ct)
Clean up connection ct of a tunnel.
static void cleanup_ax(struct CadetTunnelAxolotl *ax)
Cleanup state used by ax.
#define LOG(level,...)
struct GNUNET_SCHEDULER_Task * send_task
Task to send messages from queue (if possible).
void GNUNET_MQ_destroy(struct GNUNET_MQ_Handle *mq)
Destroy the message queue.
Definition: mq.c:824
GCT_SendContinuation cont
Continuation to call once sent (on the channel layer).
#define GNUNET_free(ptr)
Wrapper around free.
void * GNUNET_SCHEDULER_cancel(struct GNUNET_SCHEDULER_Task *task)
Cancel the task with the specified identifier.
Definition: scheduler.c:966
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_remove_channel()

void GCT_remove_channel ( struct CadetTunnel t,
struct CadetChannel ch,
struct GNUNET_CADET_ChannelTunnelNumber  ctn 
)

Remove a channel from a tunnel.

Parameters
tTunnel.
chChannel
ctnunique number identifying ch within t

Definition at line 2283 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::channels, GNUNET_CADET_ChannelTunnelNumber::cn, CadetTunnel::destroy_task, destroy_tunnel(), GCCH_2s(), GCT_2s(), GCT_count_channels(), GNUNET_assert, GNUNET_CONTAINER_multihashmap32_remove(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_SCHEDULER_add_delayed(), GNUNET_YES, IDLE_DESTROY_DELAY, and LOG.

Referenced by channel_destroy().

2286 {
2288  "Removing %s from %s\n",
2289  GCCH_2s (ch),
2290  GCT_2s (t));
2293  ntohl (ctn.cn),
2294  ch));
2295  if ((0 ==
2296  GCT_count_channels (t)) &&
2297  (NULL == t->destroy_task))
2298  {
2299  t->destroy_task
2301  &destroy_tunnel,
2302  t);
2303  }
2304 }
struct GNUNET_CONTAINER_MultiHashMap32 * channels
Channels inside this tunnel.
uint32_t cn
Which number does this channel have that uniquely identfies it within its tunnel, in network byte ord...
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct GNUNET_SCHEDULER_Task * destroy_task
Task scheduled if there are no more channels using the tunnel.
static void destroy_tunnel(void *cls)
This tunnel is no longer used, destroy it.
struct GNUNET_SCHEDULER_Task * GNUNET_SCHEDULER_add_delayed(struct GNUNET_TIME_Relative delay, GNUNET_SCHEDULER_TaskCallback task, void *task_cls)
Schedule a new task to be run with a specified delay.
Definition: scheduler.c:1253
int GNUNET_CONTAINER_multihashmap32_remove(struct GNUNET_CONTAINER_MultiHashMap32 *map, uint32_t key, const void *value)
Remove the given key-value pair from the map.
const char * GCCH_2s(const struct CadetChannel *ch)
Get the static string for identification of the channel.
unsigned int GCT_count_channels(struct CadetTunnel *t)
Count channels of a tunnel.
#define LOG(level,...)
#define GNUNET_YES
Definition: gnunet_common.h:77
#define IDLE_DESTROY_DELAY
How long do we wait until tearing down an idle tunnel?
Here is the call graph for this function:
Here is the caller graph for this function:

◆ destroy_remaining_channels()

static int destroy_remaining_channels ( void *  cls,
uint32_t  key,
void *  value 
)
static

Destroy remaining channels during shutdown.

Parameters
clsthe struct CadetTunnel of the channel
keykey of the channel
valuethe struct CadetChannel
Returns
GNUNET_OK (continue to iterate)

Definition at line 2316 of file gnunet-service-cadet_tunnels.c.

References ch, GCCH_handle_remote_destroy(), GNUNET_OK, and value.

Referenced by GCT_destroy_tunnel_now().

2319 {
2320  struct CadetChannel *ch = value;
2321 
2323  NULL);
2324  return GNUNET_OK;
2325 }
void GCCH_handle_remote_destroy(struct CadetChannel *ch, const struct GNUNET_CADET_ConnectionTunnelIdentifier *cti)
Destroy channel, based on the other peer closing the connection.
static struct GNUNET_CADET_Channel * ch
Channel handle.
Definition: gnunet-cadet.c:117
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
static char * value
Value of the record to add/remove.
Struct containing all information regarding a channel to a remote client.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_destroy_tunnel_now()

void GCT_destroy_tunnel_now ( struct CadetTunnel t)

Destroys the tunnel t now, without delay.

Used during shutdown.

Parameters
ttunnel to destroy

Definition at line 2334 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::channels, destroy_remaining_channels(), CadetTunnel::destroy_task, destroy_tunnel(), GCT_count_channels(), GNUNET_assert, GNUNET_CONTAINER_multihashmap32_iterate(), GNUNET_SCHEDULER_cancel(), GNUNET_YES, and shutting_down.

Referenced by destroy_tunnels_now().

2335 {
2339  t);
2340  GNUNET_assert (0 ==
2341  GCT_count_channels (t));
2342  if (NULL != t->destroy_task)
2343  {
2345  t->destroy_task = NULL;
2346  }
2347  destroy_tunnel (t);
2348 }
struct GNUNET_CONTAINER_MultiHashMap32 * channels
Channels inside this tunnel.
int GNUNET_CONTAINER_multihashmap32_iterate(struct GNUNET_CONTAINER_MultiHashMap32 *map, GNUNET_CONTAINER_MulitHashMapIterator32Callback it, void *it_cls)
Iterate over all entries in the map.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct GNUNET_SCHEDULER_Task * destroy_task
Task scheduled if there are no more channels using the tunnel.
static void destroy_tunnel(void *cls)
This tunnel is no longer used, destroy it.
static int destroy_remaining_channels(void *cls, uint32_t key, void *value)
Destroy remaining channels during shutdown.
int shutting_down
Signal that shutdown is happening: prevent recovery measures.
unsigned int GCT_count_channels(struct CadetTunnel *t)
Count channels of a tunnel.
#define GNUNET_YES
Definition: gnunet_common.h:77
void * GNUNET_SCHEDULER_cancel(struct GNUNET_SCHEDULER_Task *task)
Cancel the task with the specified identifier.
Definition: scheduler.c:966
Here is the call graph for this function:
Here is the caller graph for this function:

◆ try_send_normal_payload()

static void try_send_normal_payload ( struct CadetTunnel t,
struct CadetTConnection ct 
)
static

Send normal payload from queue in t via connection ct.

Does nothing if our payload queue is empty.

Parameters
ttunnel to send data from
ctconnection to use for transmission (is ready)

Definition at line 2359 of file gnunet-service-cadet_tunnels.c.

References CadetTConnection::cc, CadetTunnelQueueEntry::cid, CadetTunnelQueueEntry::cont, CadetTunnelQueueEntry::cont_cls, CadetTunnelQueueEntry::env, GCC_2s(), GCC_get_id(), GCC_transmit(), GCT_2s(), GNUNET_assert, GNUNET_CONTAINER_DLL_remove, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_YES, CadetTConnection::is_ready, LOG, mark_connection_unready(), CadetTunnelQueueEntry::t, CadetTunnel::tq_head, and CadetTunnel::tq_tail.

Referenced by connection_ready_cb(), and trigger_transmissions().

2361 {
2362  struct CadetTunnelQueueEntry *tq;
2363 
2365  tq = t->tq_head;
2366  if (NULL == tq)
2367  {
2368  /* no messages pending right now */
2370  "Not sending payload of %s on ready %s (nothing pending)\n",
2371  GCT_2s (t),
2372  GCC_2s (ct->cc));
2373  return;
2374  }
2375  /* ready to send message 'tq' on tunnel 'ct' */
2376  GNUNET_assert (t == tq->t);
2378  t->tq_tail,
2379  tq);
2380  if (NULL != tq->cid)
2381  *tq->cid = *GCC_get_id (ct->cc);
2384  "Sending payload of %s on %s\n",
2385  GCT_2s (t),
2386  GCC_2s (ct->cc));
2387  GCC_transmit (ct->cc,
2388  tq->env);
2389  if (NULL != tq->cont)
2390  tq->cont (tq->cont_cls,
2391  GCC_get_id (ct->cc));
2392  GNUNET_free (tq);
2393 }
#define GNUNET_CONTAINER_DLL_remove(head, tail, element)
Remove an element from a DLL.
int is_ready
Is the connection currently ready for transmission?
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
const char * GCC_2s(const struct CadetConnection *cc)
Get a (static) string for a connection.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
const struct GNUNET_CADET_ConnectionTunnelIdentifier * GCC_get_id(struct CadetConnection *cc)
Obtain unique ID for the connection.
static void mark_connection_unready(struct CadetTConnection *ct)
Connection ct is now unready, clear it&#39;s ready flag and move it from the ready DLL to the busy DLL...
struct CadetTunnelQueueEntry * tq_tail
Queued messages, to transmit once tunnel gets connected.
struct CadetConnection * cc
Connection handle.
Struct used to save messages in a non-ready tunnel to send once connected.
struct CadetTunnelQueueEntry * tq_head
Queued messages, to transmit once tunnel gets connected.
struct CadetTunnel * t
Tunnel these messages belong in.
void * cont_cls
Closure for cont.
struct GNUNET_MQ_Envelope * env
Envelope of message to send follows.
void GCC_transmit(struct CadetConnection *cc, struct GNUNET_MQ_Envelope *env)
Transmit message msg via connection cc.
#define LOG(level,...)
#define GNUNET_YES
Definition: gnunet_common.h:77
GCT_SendContinuation cont
Continuation to call once sent (on the channel layer).
#define GNUNET_free(ptr)
Wrapper around free.
struct GNUNET_CADET_ConnectionTunnelIdentifier * cid
Where to put the connection identifier into the payload of the message in env once we have it...
Here is the call graph for this function:
Here is the caller graph for this function:

◆ connection_ready_cb()

static void connection_ready_cb ( void *  cls,
int  is_ready 
)
static

A connection is is_ready for transmission.

Looks at our message queue and if there is a message, sends it out via the connection.

Parameters
clsthe struct CadetTConnection that is is_ready
is_readyGNUNET_YES if connection are now ready, GNUNET_NO if connection are no longer ready

Definition at line 2405 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::ax, CADET_TUNNEL_KEY_AX_AUTH_SENT, CADET_TUNNEL_KEY_AX_RECV, CADET_TUNNEL_KEY_AX_SENT, CADET_TUNNEL_KEY_AX_SENT_AND_RECV, CADET_TUNNEL_KEY_OK, CADET_TUNNEL_KEY_UNINITIALIZED, CadetTConnection::cc, CadetTunnel::connection_busy_head, CadetTunnel::connection_busy_tail, CadetTunnel::connection_ready_head, CadetTunnel::connection_ready_tail, CadetTunnel::destroy_task, destroy_tunnel(), CadetTunnel::estate, estate2s(), GCC_2s(), GCT_2s(), GCT_count_channels(), GNUNET_assert, GNUNET_CONTAINER_DLL_insert_tail, GNUNET_CONTAINER_DLL_remove, GNUNET_ERROR_TYPE_DEBUG, GNUNET_NO, GNUNET_SCHEDULER_add_at(), GNUNET_SCHEDULER_add_delayed(), GNUNET_SCHEDULER_cancel(), GNUNET_TIME_absolute_get_remaining(), GNUNET_YES, IDLE_DESTROY_DELAY, CadetTConnection::is_ready, CadetTunnel::kx_auth_requested, CadetTunnel::kx_task, LOG, mark_connection_unready(), CadetTunnel::next_kx_attempt, CadetTunnel::num_busy_connections, CadetTunnel::num_ready_connections, GNUNET_TIME_Relative::rel_value_us, retry_kx(), send_kx(), send_kx_auth(), CadetTConnection::t, and try_send_normal_payload().

Referenced by consider_path_cb(), and GCT_add_inbound_connection().

2407 {
2408  struct CadetTConnection *ct = cls;
2409  struct CadetTunnel *t = ct->t;
2410 
2411  if (GNUNET_NO == is_ready)
2412  {
2414  "%s no longer ready for %s\n",
2415  GCC_2s (ct->cc),
2416  GCT_2s (t));
2418  return;
2419  }
2420  GNUNET_assert (GNUNET_NO == ct->is_ready);
2423  ct);
2425  t->num_busy_connections--;
2426  ct->is_ready = GNUNET_YES;
2429  ct);
2430  t->num_ready_connections++;
2431 
2433  "%s now ready for %s in state %s\n",
2434  GCC_2s (ct->cc),
2435  GCT_2s (t),
2436  estate2s (t->estate));
2437  switch (t->estate)
2438  {
2440  /* Do not begin KX if WE have no channels waiting! */
2443  return; /* wait for timeout before retrying */
2444  /* We are uninitialized, just transmit immediately,
2445  without undue delay. */
2446  if (NULL != t->kx_task)
2447  {
2449  t->kx_task = NULL;
2450  }
2451  send_kx (t,
2452  ct,
2453  &t->ax);
2454  if ((0 ==
2455  GCT_count_channels (t)) &&
2456  (NULL == t->destroy_task))
2457  {
2458  t->destroy_task
2460  &destroy_tunnel,
2461  t);
2462  }
2463  break;
2464 
2469  /* we're currently waiting for KX to complete, schedule job */
2470  if (NULL == t->kx_task)
2471  t->kx_task
2473  &retry_kx,
2474  t);
2475  break;
2476 
2477  case CADET_TUNNEL_KEY_OK:
2478  if (GNUNET_YES == t->kx_auth_requested)
2479  {
2482  return; /* wait for timeout */
2483  if (NULL != t->kx_task)
2484  {
2486  t->kx_task = NULL;
2487  }
2488  send_kx_auth (t,
2489  ct,
2490  &t->ax,
2491  GNUNET_NO);
2492  return;
2493  }
2495  ct);
2496  break;
2497  }
2498 }
struct CadetTunnelAxolotl ax
Axolotl info.
#define GNUNET_CONTAINER_DLL_remove(head, tail, element)
Remove an element from a DLL.
struct CadetTConnection * connection_ready_tail
DLL of ready connections that are actively used to reach the destination peer.
static const char * estate2s(enum CadetTunnelEState es)
Get string description for tunnel encryption state.
uint64_t rel_value_us
The actual value.
int is_ready
Is the connection currently ready for transmission?
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
unsigned int num_ready_connections
Number of connections in the connection_ready_head DLL.
const char * GCC_2s(const struct CadetConnection *cc)
Get a (static) string for a connection.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
static void mark_connection_unready(struct CadetTConnection *ct)
Connection ct is now unready, clear it&#39;s ready flag and move it from the ready DLL to the busy DLL...
KX received and we sent KX_AUTH back, but we got no traffic yet, so we&#39;re waiting for either KX_AUTH ...
struct CadetTConnection * connection_ready_head
DLL of ready connections that are actively used to reach the destination peer.
int kx_auth_requested
Force triggering KX_AUTH independent of estate.
static void send_kx(struct CadetTunnel *t, struct CadetTConnection *ct, struct CadetTunnelAxolotl *ax)
Send a KX message.
#define GNUNET_NO
Definition: gnunet_common.h:78
KX message sent, waiting for other peer&#39;s KX_AUTH.
static struct GNUNET_SCHEDULER_Task * t
Main task.
struct GNUNET_SCHEDULER_Task * destroy_task
Task scheduled if there are no more channels using the tunnel.
struct CadetTConnection * connection_busy_head
DLL of connections that we maintain that might be used to reach the destination peer.
struct GNUNET_SCHEDULER_Task * kx_task
Task to trigger KX.
static void destroy_tunnel(void *cls)
This tunnel is no longer used, destroy it.
struct CadetTunnel * t
Tunnel this connection belongs to.
struct GNUNET_SCHEDULER_Task * GNUNET_SCHEDULER_add_delayed(struct GNUNET_TIME_Relative delay, GNUNET_SCHEDULER_TaskCallback task, void *task_cls)
Schedule a new task to be run with a specified delay.
Definition: scheduler.c:1253
struct CadetConnection * cc
Connection handle.
Struct containing all information regarding a tunnel to a peer.
struct GNUNET_TIME_Absolute next_kx_attempt
When do we try the next KX?
#define GNUNET_CONTAINER_DLL_insert_tail(head, tail, element)
Insert an element at the tail of a DLL.
Handshake completed: session key available.
Entry in list of connections used by tunnel, with metadata.
KX message sent and received, trying to send back KX_AUTH.
static void send_kx_auth(struct CadetTunnel *t, struct CadetTConnection *ct, struct CadetTunnelAxolotl *ax, int force_reply)
Send a KX_AUTH message.
unsigned int GCT_count_channels(struct CadetTunnel *t)
Count channels of a tunnel.
static void retry_kx(void *cls)
Try to redo the KX or KX_AUTH handshake, if we can.
Uninitialized status, we need to send KX.
#define LOG(level,...)
struct GNUNET_TIME_Relative GNUNET_TIME_absolute_get_remaining(struct GNUNET_TIME_Absolute future)
Given a timestamp in the future, how much time remains until then?
Definition: time.c:331
KX message received, trying to send back KX_AUTH.
#define GNUNET_YES
Definition: gnunet_common.h:77
unsigned int num_busy_connections
Number of connections in the connection_busy_head DLL.
struct GNUNET_SCHEDULER_Task * GNUNET_SCHEDULER_add_at(struct GNUNET_TIME_Absolute at, GNUNET_SCHEDULER_TaskCallback task, void *task_cls)
Schedule a new task to be run at the specified time.
Definition: scheduler.c:1230
struct CadetTConnection * connection_busy_tail
DLL of connections that we maintain that might be used to reach the destination peer.
enum CadetTunnelEState estate
State of the tunnel encryption.
static void try_send_normal_payload(struct CadetTunnel *t, struct CadetTConnection *ct)
Send normal payload from queue in t via connection ct.
#define IDLE_DESTROY_DELAY
How long do we wait until tearing down an idle tunnel?
void * GNUNET_SCHEDULER_cancel(struct GNUNET_SCHEDULER_Task *task)
Cancel the task with the specified identifier.
Definition: scheduler.c:966
Here is the call graph for this function:
Here is the caller graph for this function:

◆ evaluate_connection()

static void evaluate_connection ( void *  cls,
struct CadetTConnection ct 
)
static

Evaluate a connection, updating our summary information in cls about what kinds of connections we have.

Parameters
clsthe struct EvaluationSummary * to update
cta connection to include in the summary

Definition at line 2583 of file gnunet-service-cadet_tunnels.c.

References CadetConnectionMetrics::age, CadetTConnection::cc, EvaluationSummary::duplicate, GCC_2s(), GCC_get_metrics(), GCC_get_path(), GCPP_2s(), GCPP_get_desirability(), GCPP_get_length(), GCPP_get_peer_at_offset(), GNUNET_assert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_MAX, GNUNET_MIN, GNUNET_NO, GNUNET_TIME_absolute_get_duration(), GNUNET_YES, CadetConnectionMetrics::last_use, LOG, EvaluationSummary::max_desire, EvaluationSummary::max_length, EvaluationSummary::min_desire, EvaluationSummary::min_length, CadetConnectionMetrics::num_acked_transmissions, CadetConnectionMetrics::num_successes, EvaluationSummary::path, GNUNET_TIME_Relative::rel_value_us, EvaluationSummary::worst, and EvaluationSummary::worst_score.

Referenced by consider_path_cb(), and maintain_connections_cb().

2585 {
2586  struct EvaluationSummary *es = cls;
2587  struct CadetConnection *cc = ct->cc;
2588  unsigned int ct_length;
2589  struct CadetPeerPath *ps;
2590  const struct CadetConnectionMetrics *metrics;
2591  GNUNET_CONTAINER_HeapCostType ct_desirability;
2592  struct GNUNET_TIME_Relative uptime;
2593  struct GNUNET_TIME_Relative last_use;
2594  double score;
2595  double success_rate;
2596 
2597  ps = GCC_get_path (cc,
2598  &ct_length);
2600  "Evaluating path %s of existing %s\n",
2601  GCPP_2s (ps),
2602  GCC_2s (cc));
2603  if (ps == es->path)
2604  {
2606  "Ignoring duplicate path %s.\n",
2607  GCPP_2s (es->path));
2608  es->duplicate = GNUNET_YES;
2609  return;
2610  }
2611  if (NULL != es->path)
2612  {
2613  int duplicate = GNUNET_YES;
2614 
2615  for (unsigned int i = 0; i < ct_length; i++)
2616  {
2617  GNUNET_assert (GCPP_get_length (es->path) > i);
2618  if (GCPP_get_peer_at_offset (es->path,
2619  i) !=
2621  i))
2622  {
2623  duplicate = GNUNET_NO;
2624  break;
2625  }
2626  }
2627  if (GNUNET_YES == duplicate)
2628  {
2630  "Ignoring overlapping path %s.\n",
2631  GCPP_2s (es->path));
2632  es->duplicate = GNUNET_YES;
2633  return;
2634  }
2635  else
2636  {
2638  "Known path %s differs from proposed path\n",
2639  GCPP_2s (ps));
2640  }
2641  }
2642 
2643  ct_desirability = GCPP_get_desirability (ps);
2644  metrics = GCC_get_metrics (cc);
2645  uptime = GNUNET_TIME_absolute_get_duration (metrics->age);
2646  last_use = GNUNET_TIME_absolute_get_duration (metrics->last_use);
2647  /* We add 1.0 here to avoid division by zero. */
2648  success_rate = (metrics->num_acked_transmissions + 1.0)
2649  / (metrics->num_successes + 1.0);
2650  score
2651  = ct_desirability
2652  + 100.0 / (1.0 + ct_length) /* longer paths = better */
2653  + sqrt (uptime.rel_value_us / 60000000LL) /* larger uptime = better */
2654  - last_use.rel_value_us / 1000L; /* longer idle = worse */
2655  score *= success_rate; /* weigh overall by success rate */
2656 
2657  if ((NULL == es->worst) ||
2658  (score < es->worst_score))
2659  {
2660  es->worst = ct;
2661  es->worst_score = score;
2662  }
2663  es->min_length = GNUNET_MIN (es->min_length,
2664  ct_length);
2665  es->max_length = GNUNET_MAX (es->max_length,
2666  ct_length);
2667  es->min_desire = GNUNET_MIN (es->min_desire,
2668  ct_desirability);
2669  es->max_desire = GNUNET_MAX (es->max_desire,
2670  ct_desirability);
2671 }
Closure for evaluate_connection.
const struct CadetConnectionMetrics * GCC_get_metrics(struct CadetConnection *cc)
Obtain performance metrics from cc.
struct CadetPeerPath * path
Path we are comparing against for evaluate_connection, can be NULL.
Low-level connection to a destination.
int duplicate
Set to GNUNET_YES if we have a connection over path already.
unsigned int max_length
Maximum length of any of our connections, 0 if we have none.
unsigned long long num_successes
Number of packets that were sent via this connection did actually receive an ACK? (Note: ACKs may be ...
const char * GCC_2s(const struct CadetConnection *cc)
Get a (static) string for a connection.
struct GNUNET_TIME_Absolute last_use
When was this connection last used? (by us sending or receiving a PAYLOAD message on it) ...
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
#define GNUNET_NO
Definition: gnunet_common.h:78
const char * GCPP_2s(struct CadetPeerPath *path)
Convert a path to a human-readable string.
Performance metrics for a connection.
double worst_score
Numeric score of worst, only set if worst is non-NULL.
GNUNET_CONTAINER_HeapCostType min_desire
Minimum desirability of any of our connections, UINT64_MAX if we have none.
#define GNUNET_MAX(a, b)
Definition: gnunet_common.h:82
#define GNUNET_MIN(a, b)
Definition: gnunet_common.h:80
struct CadetConnection * cc
Connection handle.
uint64_t GNUNET_CONTAINER_HeapCostType
Cost by which elements in a heap can be ordered.
GNUNET_CONTAINER_HeapCostType GCPP_get_desirability(const struct CadetPeerPath *path)
Return how much we like keeping the path.
struct CadetPeerPath * GCC_get_path(struct CadetConnection *cc, unsigned int *off)
Obtain the path used by this connection.
GNUNET_CONTAINER_HeapCostType max_desire
Maximum desirability of any of our connections, 0 if we have none.
unsigned int min_length
Minimum length of any of our connections, UINT_MAX if we have none.
struct GNUNET_TIME_Relative GNUNET_TIME_absolute_get_duration(struct GNUNET_TIME_Absolute whence)
Get the duration of an operation as the difference of the current time and the given start time "henc...
Definition: time.c:375
unsigned long long num_acked_transmissions
How many packets that ought to generate an ACK did we send via this connection?
struct CadetPeer * GCPP_get_peer_at_offset(struct CadetPeerPath *path, unsigned int off)
Obtain the peer at offset off in path.
#define LOG(level,...)
#define GNUNET_YES
Definition: gnunet_common.h:77
struct GNUNET_TIME_Absolute age
When was this connection first established? (by us sending or receiving the CREATE_ACK for the first ...
Information regarding a possible path to reach a peer.
unsigned int GCPP_get_length(struct CadetPeerPath *path)
Return the length of the path.
Time for relative time used by GNUnet, in microseconds.
struct CadetTConnection * worst
Connection deemed the "worst" so far encountered by evaluate_connection, NULL if we did not yet encou...
Here is the call graph for this function:
Here is the caller graph for this function:

◆ consider_path_cb()

static int consider_path_cb ( void *  cls,
struct CadetPeerPath path,
unsigned int  off 
)
static

Consider using the path p for the tunnel t.

The tunnel destination is at offset off in path p.

Parameters
clsour tunnel
patha path to our destination
offoffset of the destination on path path
Returns
GNUNET_YES (should keep iterating)

Definition at line 2684 of file gnunet-service-cadet_tunnels.c.

References CadetTConnection::cc, CadetTunnel::connection_busy_head, CadetTunnel::connection_busy_tail, connection_ready_cb(), CadetTConnection::created, DESIRED_CONNECTIONS_PER_TUNNEL, CadetTunnel::destination, EvaluationSummary::duplicate, evaluate_connection(), GCC_2s(), GCC_create(), GCP_2s(), GCPP_2s(), GCPP_get_desirability(), GCPP_get_length(), GCPP_get_peer_at_offset(), GCT_2s(), GCT_count_any_connections(), GCT_iterate_connections(), GNUNET_assert, GNUNET_CONTAINER_DLL_insert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_new, GNUNET_NO, GNUNET_TIME_absolute_get(), GNUNET_YES, LOG, EvaluationSummary::max_desire, EvaluationSummary::max_length, EvaluationSummary::min_desire, EvaluationSummary::min_length, CadetTunnel::num_busy_connections, EvaluationSummary::path, t, CadetTConnection::t, and EvaluationSummary::worst.

Referenced by GCT_consider_path(), and maintain_connections_cb().

2687 {
2688  struct CadetTunnel *t = cls;
2689  struct EvaluationSummary es;
2690  struct CadetTConnection *ct;
2691 
2692  GNUNET_assert (off < GCPP_get_length (path));
2694  off) == t->destination);
2695  es.min_length = UINT_MAX;
2696  es.max_length = 0;
2697  es.max_desire = 0;
2698  es.min_desire = UINT64_MAX;
2699  es.path = path;
2700  es.duplicate = GNUNET_NO;
2701  es.worst = NULL;
2702 
2703  /* Compute evaluation summary over existing connections. */
2705  "Evaluating proposed path %s for target %s\n",
2706  GCPP_2s (path),
2707  GCT_2s (t));
2708  /* FIXME: suspect this does not ACTUALLY iterate
2709  over all existing paths, otherwise dup detection
2710  should work!!! */
2713  &es);
2714  if (GNUNET_YES == es.duplicate)
2715  return GNUNET_YES;
2716 
2717  /* FIXME: not sure we should really just count
2718  'num_connections' here, as they may all have
2719  consistently failed to connect. */
2720 
2721  /* We iterate by increasing path length; if we have enough paths and
2722  this one is more than twice as long than what we are currently
2723  using, then ignore all of these super-long ones! */
2725  (es.min_length * 2 < off) &&
2726  (es.max_length < off))
2727  {
2729  "Ignoring paths of length %u, they are way too long.\n",
2730  es.min_length * 2);
2731  return GNUNET_NO;
2732  }
2733  /* If we have enough paths and this one looks no better, ignore it. */
2735  (es.min_length < GCPP_get_length (path)) &&
2736  (es.min_desire > GCPP_get_desirability (path)) &&
2737  (es.max_length < off))
2738  {
2740  "Ignoring path (%u/%llu) to %s, got something better already.\n",
2741  GCPP_get_length (path),
2742  (unsigned long long) GCPP_get_desirability (path),
2743  GCP_2s (t->destination));
2744  return GNUNET_YES;
2745  }
2746 
2747  /* Path is interesting (better by some metric, or we don't have
2748  enough paths yet). */
2749  ct = GNUNET_new (struct CadetTConnection);
2751  ct->t = t;
2752  ct->cc = GCC_create (t->destination,
2753  path,
2754  off,
2755  ct,
2757  ct);
2758 
2759  /* FIXME: schedule job to kill connection (and path?) if it takes
2760  too long to get ready! (And track performance data on how long
2761  other connections took with the tunnel!)
2762  => Note: to be done within 'connection'-logic! */
2765  ct);
2766  t->num_busy_connections++;
2768  "Found interesting path %s for %s, created %s\n",
2769  GCPP_2s (path),
2770  GCT_2s (t),
2771  GCC_2s (ct->cc));
2772  return GNUNET_YES;
2773 }
Closure for evaluate_connection.
#define GNUNET_CONTAINER_DLL_insert(head, tail, element)
Insert an element at the head of a DLL.
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
#define DESIRED_CONNECTIONS_PER_TUNNEL
How many connections would we like to have per tunnel?
const char * GCC_2s(const struct CadetConnection *cc)
Get a (static) string for a connection.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
unsigned int GCT_count_any_connections(const struct CadetTunnel *t)
Count all created connections of a tunnel.
#define GNUNET_NO
Definition: gnunet_common.h:78
#define GNUNET_new(type)
Allocate a struct or union of the given type.
struct CadetConnection * GCC_create(struct CadetPeer *destination, struct CadetPeerPath *path, unsigned int off, struct CadetTConnection *ct, GCC_ReadyCallback ready_cb, void *ready_cb_cls)
Create a connection to destination via path and notify cb whenever we are ready for more data...
static struct GNUNET_SCHEDULER_Task * t
Main task.
struct CadetTConnection * connection_busy_head
DLL of connections that we maintain that might be used to reach the destination peer.
const char * GCP_2s(const struct CadetPeer *cp)
Get the static string for a peer ID.
struct CadetTunnel * t
Tunnel this connection belongs to.
const char * GCPP_2s(struct CadetPeerPath *path)
Convert a path to a human-readable string.
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_get(void)
Get the current time.
Definition: time.c:118
struct CadetConnection * cc
Connection handle.
Struct containing all information regarding a tunnel to a peer.
GNUNET_CONTAINER_HeapCostType GCPP_get_desirability(const struct CadetPeerPath *path)
Return how much we like keeping the path.
static void evaluate_connection(void *cls, struct CadetTConnection *ct)
Evaluate a connection, updating our summary information in cls about what kinds of connections we hav...
Entry in list of connections used by tunnel, with metadata.
struct CadetPeer * destination
Destination of the tunnel.
static void connection_ready_cb(void *cls, int is_ready)
A connection is is_ready for transmission.
struct GNUNET_TIME_Absolute created
Creation time, to keep oldest connection alive.
struct CadetPeer * GCPP_get_peer_at_offset(struct CadetPeerPath *path, unsigned int off)
Obtain the peer at offset off in path.
void GCT_iterate_connections(struct CadetTunnel *t, GCT_ConnectionIterator iter, void *iter_cls)
Iterate over all connections of a tunnel.
#define LOG(level,...)
#define GNUNET_YES
Definition: gnunet_common.h:77
unsigned int num_busy_connections
Number of connections in the connection_busy_head DLL.
struct CadetTConnection * connection_busy_tail
DLL of connections that we maintain that might be used to reach the destination peer.
unsigned int GCPP_get_length(struct CadetPeerPath *path)
Return the length of the path.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ maintain_connections_cb()

static void maintain_connections_cb ( void *  cls)
static

Function called to maintain the connections underlying our tunnel.

Tries to maintain (incl. tear down) connections for the tunnel, and if there is a significant change, may trigger transmissions.

Basically, needs to check if there are connections that perform badly, and if so eventually kill them and trigger a replacement. The strategy is to open one more connection than DESIRED_CONNECTIONS_PER_TUNNEL, and then periodically kick out the least-performing one, and then inquire for new ones.

Parameters
clsthe struct CadetTunnel

Definition at line 2790 of file gnunet-service-cadet_tunnels.c.

References consider_path_cb(), DESIRED_CONNECTIONS_PER_TUNNEL, CadetTunnel::destination, destroy_t_connection(), EvaluationSummary::duplicate, evaluate_connection(), GCP_iterate_paths(), GCT_2s(), GCT_count_any_connections(), GCT_iterate_connections(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_NO, GNUNET_SCHEDULER_add_delayed(), GNUNET_TIME_UNIT_MINUTES, LOG, CadetTunnel::maintain_connections_task, EvaluationSummary::max_desire, EvaluationSummary::max_length, EvaluationSummary::min_desire, EvaluationSummary::min_length, EvaluationSummary::path, and EvaluationSummary::worst.

Referenced by GCT_create_tunnel().

2791 {
2792  struct CadetTunnel *t = cls;
2793  struct GNUNET_TIME_Relative delay;
2794  struct EvaluationSummary es;
2795 
2796  t->maintain_connections_task = NULL;
2798  "Performing connection maintenance for %s.\n",
2799  GCT_2s (t));
2800 
2801  es.min_length = UINT_MAX;
2802  es.max_length = 0;
2803  es.max_desire = 0;
2804  es.min_desire = UINT64_MAX;
2805  es.path = NULL;
2806  es.worst = NULL;
2807  es.duplicate = GNUNET_NO;
2810  &es);
2811  if ((NULL != es.worst) &&
2813  {
2814  /* Clear out worst-performing connection 'es.worst'. */
2816  es.worst);
2817  }
2818 
2819  /* Consider additional paths */
2820  (void) GCP_iterate_paths (t->destination,
2822  t);
2823 
2824  /* FIXME: calculate when to try again based on how well we are doing;
2825  in particular, if we have to few connections, we might be able
2826  to do without this (as PATHS should tell us whenever a new path
2827  is available instantly; however, need to make sure this job is
2828  restarted after that happens).
2829  Furthermore, if the paths we do know are in a reasonably narrow
2830  quality band and are plentyful, we might also consider us stabilized
2831  and then reduce the frequency accordingly. */delay = GNUNET_TIME_UNIT_MINUTES;
2835  t);
2836 }
Closure for evaluate_connection.
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
#define DESIRED_CONNECTIONS_PER_TUNNEL
How many connections would we like to have per tunnel?
#define GNUNET_TIME_UNIT_MINUTES
One minute.
unsigned int GCT_count_any_connections(const struct CadetTunnel *t)
Count all created connections of a tunnel.
#define GNUNET_NO
Definition: gnunet_common.h:78
unsigned int GCP_iterate_paths(struct CadetPeer *cp, GCP_PathIterator callback, void *callback_cls)
Iterate over the paths to a peer.
static struct GNUNET_SCHEDULER_Task * t
Main task.
struct GNUNET_SCHEDULER_Task * GNUNET_SCHEDULER_add_delayed(struct GNUNET_TIME_Relative delay, GNUNET_SCHEDULER_TaskCallback task, void *task_cls)
Schedule a new task to be run with a specified delay.
Definition: scheduler.c:1253
static int consider_path_cb(void *cls, struct CadetPeerPath *path, unsigned int off)
Consider using the path p for the tunnel t.
Struct containing all information regarding a tunnel to a peer.
static struct GNUNET_TIME_Relative delay
When should dkg communication start?
static void evaluate_connection(void *cls, struct CadetTConnection *ct)
Evaluate a connection, updating our summary information in cls about what kinds of connections we hav...
static void maintain_connections_cb(void *cls)
Function called to maintain the connections underlying our tunnel.
struct CadetPeer * destination
Destination of the tunnel.
struct GNUNET_SCHEDULER_Task * maintain_connections_task
Task to trim connections if too many are present.
void GCT_iterate_connections(struct CadetTunnel *t, GCT_ConnectionIterator iter, void *iter_cls)
Iterate over all connections of a tunnel.
static void destroy_t_connection(void *cls, struct CadetTConnection *ct)
Clean up connection ct of a tunnel.
#define LOG(level,...)
Time for relative time used by GNUnet, in microseconds.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_consider_path()

void GCT_consider_path ( struct CadetTunnel t,
struct CadetPeerPath p,
unsigned int  off 
)

Consider using the path p for the tunnel t.

The tunnel destination is at offset off in path p.

Parameters
clsour tunnel
patha path to our destination
offoffset of the destination on path path

Definition at line 2848 of file gnunet-service-cadet_tunnels.c.

References consider_path_cb(), GCPP_2s(), GCT_2s(), GNUNET_ERROR_TYPE_DEBUG, and LOG.

Referenced by GCP_path_entry_add(), and GCP_set_mq().

2851 {
2853  "Considering %s for %s (offset %u)\n",
2854  GCPP_2s (p),
2855  GCT_2s (t),
2856  off);
2857  (void) consider_path_cb (t,
2858  p,
2859  off);
2860 }
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
const char * GCPP_2s(struct CadetPeerPath *path)
Convert a path to a human-readable string.
static int consider_path_cb(void *cls, struct CadetPeerPath *path, unsigned int off)
Consider using the path p for the tunnel t.
#define LOG(level,...)
Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_plaintext_keepalive()

static void handle_plaintext_keepalive ( void *  cls,
const struct GNUNET_MessageHeader msg 
)
static

We got a keepalive.

Track in statistics.

Parameters
clsthe struct CadetTunnel for which we decrypted the message
msgthe message we received on the tunnel

Definition at line 2870 of file gnunet-service-cadet_tunnels.c.

References GCT_2s(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_NO, GNUNET_STATISTICS_update(), LOG, and stats.

2872 {
2873  struct CadetTunnel *t = cls;
2874 
2876  "Received KEEPALIVE on %s\n",
2877  GCT_2s (t));
2879  "# keepalives received",
2880  1,
2881  GNUNET_NO);
2882 }
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
#define GNUNET_NO
Definition: gnunet_common.h:78
static struct GNUNET_SCHEDULER_Task * t
Main task. <