oec/libbrandt
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

create proof for public key share

Browse Source
This commit is contained in:
Markus Teich 2016-06-22 02:12:54 +02:00
parent 965b4da779
commit 2c63da0ed1
2 changed files with 24 additions and 21 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

43
crypto.c
View File

@ -527,6 +527,29 @@ smc_sum (gcry_mpi_point_t out, gcry_mpi_point_t in[], uint16_t len)
}
/**
* smc_gen_keyshare creates the private additive keyshare and computes the
* public multiplicative key share
*
* @param[in,out] ad Pointer to the AuctionData struct to operate on
* @param[out] proof Pointer to where the proof of knowledge should be saved.
* Must be allocated memory with apropriate size for one proof struct.
*/
void
smc_gen_keyshare (struct AuctionData *ad, struct proof_dl *proof)
{
uint16_t i;
ad->y = calloc (ad->n, sizeof (*ad->y));
for (i = 0; i < ad->n; i++)
ad->y[0] = gcry_mpi_point_new (0);
ad->x = gcry_mpi_new (0);
ec_skey_create (ad->x);
smc_zkp_dl (ad->y[ad->i], ad->x, proof);
}
/**
* smc_compute_pkey calculates the shared public key
*
@ -540,26 +563,6 @@ smc_compute_pkey (struct AuctionData *ad)
}
/**
* smc_gen_keyshare creates the private additive keyshare and computes the
* public multiplicative key share
*
* @param[in,out] ad Pointer to the AuctionData struct to operate on
*/
void
smc_gen_keyshare (struct AuctionData *ad)
{
uint16_t i;
ad->y = calloc (ad->n, sizeof (*ad->y));
for (i = 0; i < ad->n; i++)
ad->y[0] = gcry_mpi_point_new (0);
ad->x = gcry_mpi_new (0);
ec_keypair_create (ad->y[ad->i], ad->x);
}
/**
* smc_encrypt_bid \todo
*

2
crypto.h
View File

@ -115,7 +115,7 @@ int smc_zkp_0og_check (const gcry_mpi_point_t y,
/* --- Protocol implementation --- */
void smc_gen_keyshare (struct AuctionData *ad);
void smc_gen_keyshare (struct AuctionData *ad, struct proof_dl *proof);
void smc_compute_pkey (struct AuctionData *ad);
#endif /* ifndef _BRANDT_CRYPTO_H */