rottenwheel/monero
1
0
Fork 0
mirror of https://codeberg.org/anoncontributorxmr/monero.git synced 2024-11-27 05:13:25 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

Added balance check to MLSAG/CLSAG performance tests

Browse Source
This commit is contained in:
Sarang Noether 2020-05-12 13:53:10 -04:00 committed by moneromooo-monero
parent f964a92c57
commit aff87b5f6a
3 changed files with 257 additions and 119 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
tests/performance_tests/main.cpp
View File

@ -215,18 +215,20 @@ int main(int argc, char** argv)
TEST_PERFORMANCE1(filter, p, test_cn_fast_hash, 32); TEST_PERFORMANCE1(filter, p, test_cn_fast_hash, 32);
TEST_PERFORMANCE1(filter, p, test_cn_fast_hash, 16384); TEST_PERFORMANCE1(filter, p, test_cn_fast_hash, 16384);
TEST_PERFORMANCE2(filter, p, test_sig_mlsag, 8, 1); // MLSAG verification TEST_PERFORMANCE3(filter, p, test_sig_mlsag, 4, 2, 2); // MLSAG verification
TEST_PERFORMANCE2(filter, p, test_sig_mlsag, 16, 1); TEST_PERFORMANCE3(filter, p, test_sig_mlsag, 8, 2, 2);
TEST_PERFORMANCE2(filter, p, test_sig_mlsag, 32, 1); TEST_PERFORMANCE3(filter, p, test_sig_mlsag, 16, 2, 2);
TEST_PERFORMANCE2(filter, p, test_sig_mlsag, 64, 1); TEST_PERFORMANCE3(filter, p, test_sig_mlsag, 32, 2, 2);
TEST_PERFORMANCE2(filter, p, test_sig_mlsag, 128, 1); TEST_PERFORMANCE3(filter, p, test_sig_mlsag, 64, 2, 2);
TEST_PERFORMANCE2(filter, p, test_sig_mlsag, 256, 1); TEST_PERFORMANCE3(filter, p, test_sig_mlsag, 128, 2, 2);
TEST_PERFORMANCE2(filter, p, test_sig_clsag, 8, 1); // CLSAG verification TEST_PERFORMANCE3(filter, p, test_sig_mlsag, 256, 2, 2);
TEST_PERFORMANCE2(filter, p, test_sig_clsag, 16, 1); TEST_PERFORMANCE3(filter, p, test_sig_clsag, 4, 2, 2); // CLSAG verification
TEST_PERFORMANCE2(filter, p, test_sig_clsag, 32, 1); TEST_PERFORMANCE3(filter, p, test_sig_clsag, 8, 2, 2);
TEST_PERFORMANCE2(filter, p, test_sig_clsag, 64, 1); TEST_PERFORMANCE3(filter, p, test_sig_clsag, 16, 2, 2);
TEST_PERFORMANCE2(filter, p, test_sig_clsag, 128, 1); TEST_PERFORMANCE3(filter, p, test_sig_clsag, 32, 2, 2);
TEST_PERFORMANCE2(filter, p, test_sig_clsag, 256, 1); TEST_PERFORMANCE3(filter, p, test_sig_clsag, 64, 2, 2);
TEST_PERFORMANCE3(filter, p, test_sig_clsag, 128, 2, 2);
TEST_PERFORMANCE3(filter, p, test_sig_clsag, 256, 2, 2);
TEST_PERFORMANCE2(filter, p, test_ringct_mlsag, 11, false); TEST_PERFORMANCE2(filter, p, test_ringct_mlsag, 11, false);
TEST_PERFORMANCE2(filter, p, test_ringct_mlsag, 11, true); TEST_PERFORMANCE2(filter, p, test_ringct_mlsag, 11, true);

158
tests/performance_tests/sig_clsag.h
View File

@ -1,4 +1,4 @@
// Copyright (c) 2014-2019, The Monero Project // Copyright (c) 2014-2020, The Monero Project
// //
// All rights reserved. // All rights reserved.
// //
@ -31,74 +31,142 @@
#pragma once #pragma once
#include "ringct/rctSigs.h" #include "ringct/rctSigs.h"
#include "cryptonote_basic/cryptonote_basic.h" #include "ringct/rctTypes.h"
#include "device/device.hpp" #include "device/device.hpp"
#include "single_tx_test_base.h"
using namespace rct; using namespace rct;
template<size_t ring_size, size_t index> template<size_t a_N, size_t a_T, size_t a_w>
class test_sig_clsag : public single_tx_test_base class test_sig_clsag
{ {
public: public:
static const size_t N = ring_size;
static const size_t loop_count = 1000; static const size_t loop_count = 1000;
static const size_t l = index; static const size_t N = a_N;
static const size_t T = a_T;
static const size_t w = a_w;
bool init() bool init()
{ {
if (!single_tx_test_base::init())
return false;
message = skGen();
// Random signing/commitment keys
pubs.reserve(N); pubs.reserve(N);
for (size_t i = 0; i < N; i++) pubs.resize(N);
r = keyV(w); // M[l[u]] = Com(0,r[u])
a = keyV(w); // P[l[u]] = Com(a[u],s[u])
s = keyV(w);
Q = keyV(T); // Q[j] = Com(b[j],t[j])
b = keyV(T);
t = keyV(T);
// Random keys
key temp;
for (size_t k = 0; k < N; k++)
{ {
key sk; skpkGen(temp,pubs[k].dest);
ctkey tmp; skpkGen(temp,pubs[k].mask);
skpkGen(sk, tmp.dest);
skpkGen(sk, tmp.mask);
pubs.push_back(tmp);
} }
// Signing key // Signing and commitment keys (assumes fixed signing indices 0,1,...,w-1 for this test)
key p; // TODO: random signing indices
skpkGen(p,pubs[l].dest); C_offsets = keyV(w); // P[l[u]] - C_offsets[u] = Com(0,s[u]-s1[u])
s1 = keyV(w);
key a_sum = zero();
key s1_sum = zero();
messages = keyV(w);
for (size_t u = 0; u < w; u++)
{
skpkGen(r[u],pubs[u].dest); // M[u] = Com(0,r[u])
// Commitment key a[u] = skGen(); // P[u] = Com(a[u],s[u])
key t,u; s[u] = skGen();
t = skGen(); addKeys2(pubs[u].mask,s[u],a[u],H);
u = skGen();
addKeys2(pubs[l].mask,t,u,H);
// Offset s1[u] = skGen(); // C_offsets[u] = Com(a[u],s1[u])
key t2; addKeys2(C_offsets[u],s1[u],a[u],H);
t2 = skGen();
addKeys2(C_offset,t2,u,H);
// Final signing keys sc_add(a_sum.bytes,a_sum.bytes,a[u].bytes);
ctkey insk; sc_add(s1_sum.bytes,s1_sum.bytes,s1[u].bytes);
insk.dest = p;
insk.mask = t;
sig = proveRctCLSAGSimple(message,pubs,insk,t2,C_offset,NULL,NULL,NULL,l,hw::get_device("default")); messages[u] = skGen();
}
// Outputs
key b_sum = zero();
key t_sum = zero();
for (size_t j = 0; j < T-1; j++)
{
b[j] = skGen(); // Q[j] = Com(b[j],t[j])
t[j] = skGen();
addKeys2(Q[j],t[j],b[j],H);
sc_add(b_sum.bytes,b_sum.bytes,b[j].bytes);
sc_add(t_sum.bytes,t_sum.bytes,t[j].bytes);
}
// Value/mask balance for Q[T-1]
sc_sub(b[T-1].bytes,a_sum.bytes,b_sum.bytes);
sc_sub(t[T-1].bytes,s1_sum.bytes,t_sum.bytes);
addKeys2(Q[T-1],t[T-1],b[T-1],H);
// Build proofs
sigs.reserve(w);
sigs.resize(0);
ctkey sk;
for (size_t u = 0; u < w; u++)
{
sk.dest = r[u];
sk.mask = s[u];
sigs.push_back(proveRctCLSAGSimple(messages[u],pubs,sk,s1[u],C_offsets[u],NULL,NULL,NULL,u,hw::get_device("default")));
}
return true; return true;
} }
bool test() bool test()
{ {
return verRctCLSAGSimple(message,sig,pubs,C_offset); for (size_t u = 0; u < w; u++)
{
if (!verRctCLSAGSimple(messages[u],sigs[u],pubs,C_offsets[u]))
{
return false;
}
} }
private: // Check balanace
std::vector<MultiexpData> balance;
balance.reserve(w + T);
balance.resize(0);
key ZERO = zero();
key ONE = identity();
key MINUS_ONE;
sc_sub(MINUS_ONE.bytes,ZERO.bytes,ONE.bytes);
for (size_t u = 0; u < w; u++)
{
balance.push_back({ONE,C_offsets[u]});
}
for (size_t j = 0; j < T; j++)
{
balance.push_back({MINUS_ONE,Q[j]});
}
if (!(straus(balance) == ONE)) // group identity
{
return false;
}
return true;
}
private:
ctkeyV pubs; ctkeyV pubs;
key C_offset; keyV Q;
clsag sig; keyV r;
key message; keyV s;
keyV s1;
keyV t;
keyV a;
keyV b;
keyV C_offsets;
keyV messages;
std::vector<clsag> sigs;
}; };

158
tests/performance_tests/sig_mlsag.h
View File

@ -1,4 +1,4 @@
// Copyright (c) 2014-2019, The Monero Project // Copyright (c) 2014-2020, The Monero Project
// //
// All rights reserved. // All rights reserved.
// //
@ -31,74 +31,142 @@
#pragma once #pragma once
#include "ringct/rctSigs.h" #include "ringct/rctSigs.h"
#include "cryptonote_basic/cryptonote_basic.h" #include "ringct/rctTypes.h"
#include "device/device.hpp" #include "device/device.hpp"
#include "single_tx_test_base.h"
using namespace rct; using namespace rct;
template<size_t ring_size, size_t index> template<size_t a_N, size_t a_T, size_t a_w>
class test_sig_mlsag : public single_tx_test_base class test_sig_mlsag
{ {
public: public:
static const size_t N = ring_size;
static const size_t loop_count = 1000; static const size_t loop_count = 1000;
static const size_t l = index; static const size_t N = a_N;
static const size_t T = a_T;
static const size_t w = a_w;
bool init() bool init()
{ {
if (!single_tx_test_base::init())
return false;
message = skGen();
// Random signing/commitment keys
pubs.reserve(N); pubs.reserve(N);
for (size_t i = 0; i < N; i++) pubs.resize(N);
r = keyV(w); // M[l[u]] = Com(0,r[u])
a = keyV(w); // P[l[u]] = Com(a[u],s[u])
s = keyV(w);
Q = keyV(T); // Q[j] = Com(b[j],t[j])
b = keyV(T);
t = keyV(T);
// Random keys
key temp;
for (size_t k = 0; k < N; k++)
{ {
key sk; skpkGen(temp,pubs[k].dest);
ctkey tmp; skpkGen(temp,pubs[k].mask);
skpkGen(sk, tmp.dest);
skpkGen(sk, tmp.mask);
pubs.push_back(tmp);
} }
// Signing key // Signing and commitment keys (assumes fixed signing indices 0,1,...,w-1 for this test)
key p; // TODO: random signing indices
skpkGen(p,pubs[l].dest); C_offsets = keyV(w); // P[l[u]] - C_offsets[u] = Com(0,s[u]-s1[u])
s1 = keyV(w);
key a_sum = zero();
key s1_sum = zero();
messages = keyV(w);
for (size_t u = 0; u < w; u++)
{
skpkGen(r[u],pubs[u].dest); // M[u] = Com(0,r[u])
// Commitment key a[u] = skGen(); // P[u] = Com(a[u],s[u])
key t,u; s[u] = skGen();
t = skGen(); addKeys2(pubs[u].mask,s[u],a[u],H);
u = skGen();
addKeys2(pubs[l].mask,t,u,H);
// Offset s1[u] = skGen(); // C_offsets[u] = Com(a[u],s1[u])
key t2; addKeys2(C_offsets[u],s1[u],a[u],H);
t2 = skGen();
addKeys2(C_offset,t2,u,H);
// Final signing keys sc_add(a_sum.bytes,a_sum.bytes,a[u].bytes);
ctkey insk; sc_add(s1_sum.bytes,s1_sum.bytes,s1[u].bytes);
insk.dest = p;
insk.mask = t;
sig = proveRctMGSimple(message,pubs,insk,t2,C_offset,NULL,NULL,l,hw::get_device("default")); messages[u] = skGen();
}
// Outputs
key b_sum = zero();
key t_sum = zero();
for (size_t j = 0; j < T-1; j++)
{
b[j] = skGen(); // Q[j] = Com(b[j],t[j])
t[j] = skGen();
addKeys2(Q[j],t[j],b[j],H);
sc_add(b_sum.bytes,b_sum.bytes,b[j].bytes);
sc_add(t_sum.bytes,t_sum.bytes,t[j].bytes);
}
// Value/mask balance for Q[T-1]
sc_sub(b[T-1].bytes,a_sum.bytes,b_sum.bytes);
sc_sub(t[T-1].bytes,s1_sum.bytes,t_sum.bytes);
addKeys2(Q[T-1],t[T-1],b[T-1],H);
// Build proofs
sigs.reserve(w);
sigs.resize(0);
ctkey sk;
for (size_t u = 0; u < w; u++)
{
sk.dest = r[u];
sk.mask = s[u];
sigs.push_back(proveRctMGSimple(messages[u],pubs,sk,s1[u],C_offsets[u],NULL,NULL,u,hw::get_device("default")));
}
return true; return true;
} }
bool test() bool test()
{ {
return verRctMGSimple(message,sig,pubs,C_offset); for (size_t u = 0; u < w; u++)
{
if (!verRctMGSimple(messages[u],sigs[u],pubs,C_offsets[u]))
{
return false;
}
} }
private: // Check balanace
std::vector<MultiexpData> balance;
balance.reserve(w + T);
balance.resize(0);
key ZERO = zero();
key ONE = identity();
key MINUS_ONE;
sc_sub(MINUS_ONE.bytes,ZERO.bytes,ONE.bytes);
for (size_t u = 0; u < w; u++)
{
balance.push_back({ONE,C_offsets[u]});
}
for (size_t j = 0; j < T; j++)
{
balance.push_back({MINUS_ONE,Q[j]});
}
if (!(straus(balance) == ONE)) // group identity
{
return false;
}
return true;
}
private:
ctkeyV pubs; ctkeyV pubs;
key C_offset; keyV Q;
mgSig sig; keyV r;
key message; keyV s;
keyV s1;
keyV t;
keyV a;
keyV b;
keyV C_offsets;
keyV messages;
std::vector<mgSig> sigs;
}; };