This is an automated email from the ASF dual-hosted git repository. sandreoli pushed a commit to branch add-amcl-wrappers in repository https://gitbox.apache.org/repos/asf/incubator-milagro-MPC.git
commit fd1e16130fd9c3bf729ab4aead93d2c2fafc9350 Author: Samuele Andreoli <[email protected]> AuthorDate: Wed Feb 26 16:22:49 2020 +0000 Fix doxygen --- include/amcl/commitments.h | 4 ++-- include/amcl/factoring_zk.h | 4 ++-- include/amcl/mta.h | 5 +++-- 3 files changed, 7 insertions(+), 6 deletions(-) diff --git a/include/amcl/commitments.h b/include/amcl/commitments.h index d0dff24..260dc5e 100644 --- a/include/amcl/commitments.h +++ b/include/amcl/commitments.h @@ -34,8 +34,8 @@ extern "C" { #endif -#define COMMITMENTS_OK 0 /** < Success */ -#define COMMITMENTS_FAIL 81 /** < Invalid Commitment */ +#define COMMITMENTS_OK 0 /**< Success */ +#define COMMITMENTS_FAIL 81 /**< Invalid Commitment */ /* NM Commitment Scheme API */ diff --git a/include/amcl/factoring_zk.h b/include/amcl/factoring_zk.h index bd8a81e..6f9d100 100644 --- a/include/amcl/factoring_zk.h +++ b/include/amcl/factoring_zk.h @@ -45,8 +45,8 @@ extern "C" #define FACTORING_ZK_B 16 /**< Security parameter, length in bytes */ -#define FACTORING_ZK_OK 0 /** < Proof successfully verified */ -#define FACTORING_ZK_FAIL 91 /** < Invalid proof */ +#define FACTORING_ZK_OK 0 /**< Proof successfully verified */ +#define FACTORING_ZK_FAIL 91 /**< Invalid proof */ /** \brief Prove knowledge of the modulus m in ZK * diff --git a/include/amcl/mta.h b/include/amcl/mta.h index 5df6504..8ef8b3a 100644 --- a/include/amcl/mta.h +++ b/include/amcl/mta.h @@ -120,7 +120,7 @@ void MPC_SUM_MTA(const octet *A, const octet *B, const octet *ALPHA, const octet * * <ol> * <li> \f$ e \in_R [0, \ldots, q] \f$ - * <ol> + * </ol> * * @param RNG csprng for random generation * @param E Destination octet for the challenge. @@ -481,7 +481,7 @@ typedef MTA_ZK_proof MTA_ZKWC_proof; * <li> \f$ t = h_1^{y}h_2^{\sigma} \text{ }\mathrm{mod}\text{ }\tilde{N} \f$ * <li> \f$ w = h_1^{\gamma}h_2^{\tau} \text{ }\mathrm{mod}\text{ }\tilde{N} \f$ * <li> \f$ v = c1^{\alpha}g^{\gamma}\beta^{N} \text{ }\mathrm{mod}\text{ }N^2 \f$ - * <li> \f$ U = \alpha.G + * <li> \f$ U = \alpha.G \f$ * </ol> * * @param RNG csprng for random generation @@ -507,6 +507,7 @@ extern void MTA_ZKWC_commit(csprng *RNG, PAILLIER_public_key *key, COMMITMENTS_B * @param mod Public BC modulus of the verifier * @param C1 Base Paillier Ciphertext * @param C2 New Paillier Ciphertext to prove knowledge and range + * @param X Public exponent of the associated DLOG to prove knowledge * @param c Commitment of the prover * @param E Destination challenge */
