diff options
| -rw-r--r-- | src/ringct/rctSigs.cpp | 18 | ||||
| -rw-r--r-- | src/ringct/rctSigs.h | 2 |
2 files changed, 0 insertions, 20 deletions
diff --git a/src/ringct/rctSigs.cpp b/src/ringct/rctSigs.cpp index d3437eb36..f6d862b4d 100644 --- a/src/ringct/rctSigs.cpp +++ b/src/ringct/rctSigs.cpp @@ -130,29 +130,12 @@ namespace rct { return equalKeys(eeComputed, bb.ee); } - //Multilayered Spontaneous Anonymous Group Signatures (MLSAG signatures) - //These are aka MG signatutes in earlier drafts of the ring ct paper - // c.f. http://eprint.iacr.org/2015/1098 section 2. - // keyImageV just does I[i] = xx[i] * Hash(xx[i] * G) for each i - // Gen creates a signature which proves that for some column in the keymatrix "pk" - // the signer knows a secret key for each row in that column - // Ver verifies that the MG sig was created correctly - keyV keyImageV(const keyV &xx) { - keyV II(xx.size()); - size_t i = 0; - for (i = 0; i < xx.size(); i++) { - II[i] = scalarmultKey(hashToPoint(scalarmultBase(xx[i])), xx[i]); - } - return II; - } - //Multilayered Spontaneous Anonymous Group Signatures (MLSAG signatures) //This is a just slghtly more efficient version than the ones described below //(will be explained in more detail in Ring Multisig paper //These are aka MG signatutes in earlier drafts of the ring ct paper // c.f. http://eprint.iacr.org/2015/1098 section 2. - // keyImageV just does I[i] = xx[i] * Hash(xx[i] * G) for each i // Gen creates a signature which proves that for some column in the keymatrix "pk" // the signer knows a secret key for each row in that column // Ver verifies that the MG sig was created correctly @@ -250,7 +233,6 @@ namespace rct { //(will be explained in more detail in Ring Multisig paper //These are aka MG signatutes in earlier drafts of the ring ct paper // c.f. http://eprint.iacr.org/2015/1098 section 2. - // keyImageV just does I[i] = xx[i] * Hash(xx[i] * G) for each i // Gen creates a signature which proves that for some column in the keymatrix "pk" // the signer knows a secret key for each row in that column // Ver verifies that the MG sig was created correctly diff --git a/src/ringct/rctSigs.h b/src/ringct/rctSigs.h index 17047fc0f..7485938ee 100644 --- a/src/ringct/rctSigs.h +++ b/src/ringct/rctSigs.h @@ -70,11 +70,9 @@ namespace rct { //Multilayered Spontaneous Anonymous Group Signatures (MLSAG signatures) //These are aka MG signatutes in earlier drafts of the ring ct paper // c.f. http://eprint.iacr.org/2015/1098 section 2. - // keyImageV just does I[i] = xx[i] * HashToPoint(xx[i] * G) for each i // Gen creates a signature which proves that for some column in the keymatrix "pk" // the signer knows a secret key for each row in that column // Ver verifies that the MG sig was created correctly - keyV keyImageV(const keyV &xx); mgSig MLSAG_Gen(const key &message, const keyM & pk, const keyV & xx, const multisig_kLRki *kLRki, key *mscout, const unsigned int index, size_t dsRows, hw::device &hwdev); bool MLSAG_Ver(const key &message, const keyM &pk, const mgSig &sig, size_t dsRows); //mgSig MLSAG_Gen_Old(const keyM & pk, const keyV & xx, const int index); |