144 lines
3.9 KiB
C
144 lines
3.9 KiB
C
/* This file is part of libbrandt.
|
|
* Copyright (C) 2016 GNUnet e.V.
|
|
*
|
|
* libbrandt is free software: you can redistribute it and/or modify it under
|
|
* the terms of the GNU General Public License as published by the Free Software
|
|
* Foundation, either version 3 of the License, or (at your option) any later
|
|
* version.
|
|
*
|
|
* libbrandt is distributed in the hope that it will be useful, but WITHOUT ANY
|
|
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
|
|
* A PARTICULAR PURPOSE. See the GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License along with
|
|
* libbrandt. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
/**
|
|
* @file brandt.c
|
|
* @brief Implementation of the high level libbrandt interface.
|
|
* @author Markus Teich
|
|
*/
|
|
|
|
#include "brandt_config.h"
|
|
#include "crypto.h"
|
|
#include "internals.h"
|
|
#include "util.h"
|
|
|
|
|
|
typedef int
|
|
(*msg_recv)(struct BRANDT_Auction *ad,
|
|
const unsigned char *buf,
|
|
size_t buflen,
|
|
uint16_t sender);
|
|
|
|
|
|
enum {
|
|
auction_firstPrice,
|
|
auction_mPlusFirstPrice,
|
|
auction_last
|
|
};
|
|
|
|
|
|
enum {
|
|
outcome_private,
|
|
outcome_public,
|
|
outcome_last
|
|
};
|
|
|
|
|
|
/**
|
|
* stores the function pointers to receive functions for each state.
|
|
*
|
|
* The first index denotes if a first price auction or a M+1st price auction is
|
|
* used. If it is 0, it is a first price auction, if it is 1, it is a M+1st
|
|
* price auction.
|
|
*
|
|
* The second index denotes if the outcome should be public or private. A value
|
|
* of 0 means a private outcome, while a value of 1 means public outcome.
|
|
*/
|
|
static msg_recv handler_in[auction_last][outcome_last][msg_last] =
|
|
{
|
|
[auction_firstPrice] =
|
|
{
|
|
[outcome_private] =
|
|
{
|
|
[msg_init] = &smc_recv_keyshare,
|
|
[msg_bid] = &smc_recv_encrypted_bid,
|
|
[msg_outcome] = &fp_priv_recv_outcome,
|
|
[msg_decrypt] = &fp_priv_recv_decryption,
|
|
},
|
|
[outcome_public] =
|
|
{
|
|
[msg_init] = &smc_recv_keyshare,
|
|
[msg_bid] = &smc_recv_encrypted_bid,
|
|
[msg_outcome] = &fp_pub_recv_outcome,
|
|
[msg_decrypt] = &fp_pub_recv_decryption,
|
|
}
|
|
},
|
|
[auction_mPlusFirstPrice] =
|
|
{
|
|
[outcome_private] =
|
|
{
|
|
[msg_init] = &smc_recv_keyshare,
|
|
[msg_bid] = &smc_recv_encrypted_bid,
|
|
},
|
|
[outcome_public] =
|
|
{
|
|
[msg_init] = &smc_recv_keyshare,
|
|
[msg_bid] = &smc_recv_encrypted_bid,
|
|
}
|
|
}
|
|
};
|
|
|
|
|
|
void
|
|
BRANDT_init (struct GNUNET_CRYPTO_EccDlogContext *dlogctx)
|
|
{
|
|
gcry_error_t err = 0;
|
|
|
|
if (!gcry_check_version ("1.7.0"))
|
|
eprintf ("libgcrypt version mismatch");
|
|
|
|
/* SECMEM cannot be resized dynamically. We do not know how much we need */
|
|
if ((err = gcry_control (GCRYCTL_DISABLE_SECMEM, 0)))
|
|
weprintf ("failed to set libgcrypt option DISABLE_SECMEM: %s",
|
|
gcry_strerror (err));
|
|
|
|
/* ecc is slow otherwise and we don't create long term keys anyway. */
|
|
if ((err = gcry_control (GCRYCTL_ENABLE_QUICK_RANDOM, 0)))
|
|
weprintf ("failed to set libgcrypt option ENABLE_QUICK_RANDOM: %s",
|
|
gcry_strerror (err));
|
|
|
|
gcry_control (GCRYCTL_INITIALIZATION_FINISHED, 0);
|
|
brandt_crypto_init (dlogctx);
|
|
}
|
|
|
|
|
|
void
|
|
BRANDT_got_message (struct BRANDT_Auction *auction,
|
|
uint16_t sender,
|
|
const unsigned char *msg,
|
|
size_t msg_len)
|
|
{
|
|
uint16_t mtype = *(uint16_t *)msg;
|
|
int atype;
|
|
int outcome;
|
|
enum rounds round = auction->cur_round;
|
|
|
|
atype = auction->desc->m > 0 ? auction_mPlusFirstPrice : auction_firstPrice;
|
|
outcome = auction->desc->outcome_public ? outcome_public : outcome_private;
|
|
|
|
/** \todo: cache out of order messages */
|
|
|
|
if (!handler_in[atype][outcome][round] ||
|
|
!handler_in[atype][outcome][round](auction,
|
|
msg + sizeof (mtype),
|
|
msg_len - sizeof (mtype),
|
|
sender))
|
|
{
|
|
/** \todo */
|
|
weprintf ("wow fail");
|
|
}
|
|
}
|