forked from remyers/lot49
-
Notifications
You must be signed in to change notification settings - Fork 0
/
lot49.cpp
434 lines (347 loc) · 19 KB
/
lot49.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
#include "bls.hpp"
#include "MeshNode.hpp"
#include "Ledger.hpp"
#include "ImpliedTransaction.hpp"
#include "Utils.hpp"
#include <algorithm>
using namespace std;
using namespace lot49;
// TODO: use 48 byte signatures, not 96 byte: https://twitter.com/sorgente711/status/1025451092610433024
bool testBLS();
void test1();
void test2();
void test3();
void TestRoute(HGID inSender, HGID inReceiver, std::string& inMessage)
{
// send a message and receive delivery receipt
cout << std::hex << endl << "Node " << std::setw(4) << std::setfill('0') << inSender << ": send a message to Node " << std::setw(4) << inReceiver << endl;
std::vector<uint8_t> data(inMessage.begin(), inMessage.end());
assert(data.size() == inMessage.size());
MeshNode::FromHGID(inSender).OriginateMessage(inReceiver, data);
}
int main(int argc, char* argv[])
{
cout << "testBLS(): " << (testBLS() ? "success!" : "failed!") << endl;
// test with pre-defined paths
//test1();
// test randomly moving nodes
test2();
// test aggregation of specific keys and messages
//test3();
};
// test aggregation of specific keys and messages
void test3()
{
int s1 = 7;
int s2 = 1;
std::vector<uint8_t> seed1(32, s1);
std::vector<uint8_t> seed2(32, s2);
bls::PrivateKey sk1 = bls::PrivateKey::FromSeed(seed1.data(), seed1.size());
cout << "sk" << s1 << " = " << std::hex;
for (auto byte : seed1 ) { cout << std::setw(2) << std::setfill('0') << static_cast<int>(byte);}
cout << endl;
bls::PublicKey pk1 = sk1.GetPublicKey();
cout << "pk" << s1 << " = " << std::hex << pk1 << endl;
bls::PrivateKey sk2 = bls::PrivateKey::FromSeed(seed2.data(), seed2.size());
cout << "sk" << s2 << " = " << std::hex;
for (auto byte : seed2 ) { cout << std::setw(2) << std::setfill('0') << static_cast<int>(byte);}
cout << endl;
bls::PublicKey pk2 = sk2.GetPublicKey();
cout << "pk" << s2 << " = " << std::hex << pk2 << endl;
std::vector<uint8_t> refund_tx = lot49::HexToBytes("0304c9dac5dd96896276e531c2e86c8fa704c4a2996c23b146fcb48d08d6d3ae48728b29d9fdead8b3bab150cb7d58fbcd857958fe97f040075ef324bfd46a0d2031ea3c28fe8bda1ea2542cf4ffff3b2ca23ea8d216cf33881789fcd0ff9f7bc704c9dac5dd96896276e531c2e86c8fa704c4a2996c23b146fcb48d08d6d3ae48728b29d9fdead8b3bab150cb7d58fbcd000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d000000007000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000");
std::vector<uint8_t> setup_tx = lot49::HexToBytes("0204c9dac5dd96896276e531c2e86c8fa704c4a2996c23b146fcb48d08d6d3ae48728b29d9fdead8b3bab150cb7d58fbcd00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004c9dac5dd96896276e531c2e86c8fa704c4a2996c23b146fcb48d08d6d3ae48728b29d9fdead8b3bab150cb7d58fbcd857958fe97f040075ef324bfd46a0d2031ea3c28fe8bda1ea2542cf4ffff3b2ca23ea8d216cf33881789fcd0ff9f7bc7d000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000");
std::vector<uint8_t> update1_tx = lot49::HexToBytes("0404c9dac5dd96896276e531c2e86c8fa704c4a2996c23b146fcb48d08d6d3ae48728b29d9fdead8b3bab150cb7d58fbcd857958fe97f040075ef324bfd46a0d2031ea3c28fe8bda1ea2542cf4ffff3b2ca23ea8d216cf33881789fcd0ff9f7bc704c9dac5dd96896276e531c2e86c8fa704c4a2996c23b146fcb48d08d6d3ae48728b29d9fdead8b3bab150cb7d58fbcd857958fe97f040075ef324bfd46a0d2031ea3c28fe8bda1ea2542cf4ffff3b2ca23ea8d216cf33881789fcd0ff9f7bc7cd00030007018f62165173f9087a003c04de96bd3ef09cd84b7b7c53c4f77aa8870594dea08d41ab8fb1db7e48bdc4bae1dd6b1412700000000000000000000000000000000000000000000000000000000000000000");
std::vector<uint8_t> update2_tx = lot49::HexToBytes("04857958fe97f040075ef324bfd46a0d2031ea3c28fe8bda1ea2542cf4ffff3b2ca23ea8d216cf33881789fcd0ff9f7bc78f62165173f9087a003c04de96bd3ef09cd84b7b7c53c4f77aa8870594dea08d41ab8fb1db7e48bdc4bae1dd6b141270857958fe97f040075ef324bfd46a0d2031ea3c28fe8bda1ea2542cf4ffff3b2ca23ea8d216cf33881789fcd0ff9f7bc78f62165173f9087a003c04de96bd3ef09cd84b7b7c53c4f77aa8870594dea08d41ab8fb1db7e48bdc4bae1dd6b141270ce00020007028f62165173f9087a003c04de96bd3ef09cd84b7b7c53c4f77aa8870594dea08d41ab8fb1db7e48bdc4bae1dd6b1412700000000000000000000000000000000000000000000000000000000000000000");
// SUCCEED
std::vector<uint8_t> sig_refund_test = lot49::HexToBytes("038da3bdcdf4838137f88268e3bb532f873671d53ac19807e0806888e082df1e9f2d6ab6d632c94993a7db257c21a98509ceef38d5f195037a9fa2444979c6c03654d9f4a309dc159aa2a7c73f7f2be1f984c29755e45f2b288d32f08542b25b");
// SUCCEED
std::vector<uint8_t> sig_update1_test = lot49::HexToBytes("15ad5f8a75b0c3c18a6efbb298a6db788bc6049a2eab7d01454d03f50383f648935f045e3749da5296052ac43ff430aa05d66916f70a23eff3a5de65663e34f4e94cc42ae81909868b5d240ebbb01ac78ec2f2a068a586ab88a3139bd1d2f78b");
// FAIL?
std::vector<uint8_t> sig_update2_test = lot49::HexToBytes("99b850d5d360b0a6c61fa7ea909750546bf53b3acc78549d8804e709c9dd77ecdf23320c7f65de52d5e9303d0fd06a7602d90a3d19d45bfb6b59d9824db30e183bf2a797d2a1bee21c9fc80d53ca46d562a6ed281f33113f6fd8466ab5bf5b32");
std::vector<uint8_t> refund_hash(bls::BLS::MESSAGE_HASH_LEN);
bls::Util::Hash256(refund_hash.data(), reinterpret_cast<const uint8_t*>(refund_tx.data()), refund_tx.size());
std::vector<uint8_t> setup_hash(bls::BLS::MESSAGE_HASH_LEN);
bls::Util::Hash256(setup_hash.data(), reinterpret_cast<const uint8_t*>(setup_tx.data()), setup_tx.size());
std::vector<uint8_t> update1_hash(bls::BLS::MESSAGE_HASH_LEN);
bls::Util::Hash256(update1_hash.data(), reinterpret_cast<const uint8_t*>(update1_tx.data()), update1_tx.size());
std::vector<uint8_t> update2_hash(bls::BLS::MESSAGE_HASH_LEN);
bls::Util::Hash256(update2_hash.data(), reinterpret_cast<const uint8_t*>(update2_tx.data()), update2_tx.size());
// Create signatures
bls::Signature sig_refund_sk1 = sk1.Sign(refund_tx.data(), refund_tx.size());
bls::Signature sig_setup_sk2 = sk2.Sign(setup_tx.data(), setup_tx.size());
bls::Signature sig_update1_sk2 = sk2.Sign(update1_tx.data(), update1_tx.size());
bls::Signature sig_update1_sk1 = sk1.Sign(update1_tx.data(), update1_tx.size());
bls::Signature sig_update2_sk1 = sk1.Sign(update2_tx.data(), update2_tx.size());
cout << "sig_refund = " << std::hex << sig_refund_sk1 << endl << endl;
assert(sig_refund_sk1 == bls::Signature::FromBytes(sig_refund_test.data()));
// Create aggregate signature for update1 test
vector<bls::Signature> update1_sigs = {sig_refund_sk1, sig_setup_sk2, sig_update1_sk2};
{
cout << "update 1 test" << endl;
bls::Signature agg_sig = bls::Signature::AggregateSigs(update1_sigs);
cout << "agg_sig = " << std::hex << agg_sig << endl;
bool ok = agg_sig.Verify();
cout << "agg_sig.Verify() = " << (ok ? "true" : "false") << endl;
assert(agg_sig == bls::Signature::FromBytes(sig_update1_test.data()));
update1_sigs.clear();
update1_sigs.push_back(agg_sig);
cout << endl;
}
// Create aggregate signature for update1 test and added update2 signatures
{
cout << "update 1 + update 2 test" << endl;
bls::AggregationInfo a1 = bls::AggregationInfo::FromMsgHash(pk1, refund_hash.data());
bls::AggregationInfo a2 = bls::AggregationInfo::FromMsgHash(pk2, setup_hash.data());
bls::AggregationInfo a3 = bls::AggregationInfo::FromMsgHash(pk2, update1_hash.data());
vector<bls::AggregationInfo> infos = {a1, a2, a3};
bls::AggregationInfo agg_info = bls::AggregationInfo::MergeInfos(infos);
bls::Signature agg_sig = bls::Signature::FromBytes(update1_sigs.back().Serialize().data());
agg_sig.SetAggregationInfo(agg_info);
cout << "agg_sig = " << std::hex << agg_sig << endl;
bool ok = agg_sig.Verify();
cout << "agg_sig.Verify() = " << (ok ? "true" : "false") << endl;
assert(agg_sig == bls::Signature::FromBytes(sig_update1_test.data()));
cout << endl;
std::vector<bls::Signature> sigs = {agg_sig, sig_update1_sk1, sig_update2_sk1};
agg_sig = bls::Signature::AggregateSigs(sigs);
cout << "agg_sig = " << std::hex << agg_sig << endl;
ok = agg_sig.Verify();
cout << "agg_sig.Verify() = " << (ok ? "true" : "false") << endl;
//assert(agg_sig == bls::Signature::FromBytes(sig_update2_test.data()));
cout << endl;
}
// Create aggreage signature for update2 test
vector<bls::Signature> update2_sigs;
{
cout << "update 2 test" << endl;
std::vector<bls::Signature> sigs = {sig_refund_sk1, sig_setup_sk2, sig_update1_sk2};
bls::Signature agg_sig = bls::Signature::AggregateSigs(sigs);
cout << "agg_sig = " << std::hex << agg_sig << endl;
cout << "agg_sig.Verify() = " << (agg_sig.Verify() ? "true" : "false") << endl;
sigs = {agg_sig, sig_update1_sk1, sig_update2_sk1};
agg_sig = bls::Signature::AggregateSigs(sigs);
cout << "agg_sig = " << std::hex << agg_sig << endl;
cout << "agg_sig.Verify() = " << (agg_sig.Verify() ? "true" : "false") << endl;
assert(agg_sig == bls::Signature::FromBytes(sig_update2_test.data()));
update2_sigs.push_back(agg_sig);
cout << endl;
}
// use aggregation information with deserialize sig for update 2
{
bls::AggregationInfo a1 = bls::AggregationInfo::FromMsgHash(pk1, refund_hash.data());
bls::AggregationInfo a2 = bls::AggregationInfo::FromMsgHash(pk2, setup_hash.data());
bls::AggregationInfo a3 = bls::AggregationInfo::FromMsgHash(pk2, update1_hash.data());
bls::AggregationInfo a4 = bls::AggregationInfo::FromMsgHash(pk1, update1_hash.data());
bls::AggregationInfo a5 = bls::AggregationInfo::FromMsgHash(pk1, update2_hash.data());
vector<bls::AggregationInfo> infos = {a1};
bls::AggregationInfo agg_info = bls::AggregationInfo::MergeInfos(infos);
infos = {agg_info, a2, a3};
agg_info = bls::AggregationInfo::MergeInfos(infos);
infos = {agg_info, a4, a5};
agg_info = bls::AggregationInfo::MergeInfos(infos);
// reconstruct signature from serialized data
cout << "update 2 test from serialized aggregate signature" << endl;
vector<bls::Signature> sigs = {sig_refund_sk1, sig_setup_sk2, sig_update1_sk2};
bls::Signature agg_sig = bls::Signature::AggregateSigs(sigs);
sigs = {agg_sig, sig_update1_sk1, sig_update2_sk1};
agg_sig = bls::Signature::AggregateSigs(sigs);
// strip aggregation data
agg_sig = bls::Signature::FromBytes(agg_sig.Serialize().data());
// add reconstructed aggregation data
agg_sig.SetAggregationInfo(agg_info);
cout << "agg_sig = " << std::hex << agg_sig << endl;
cout << "agg_sig.Verify() = " << (agg_sig.Verify() ? "true" : "false") << endl;
assert(agg_sig == bls::Signature::FromBytes(sig_update2_test.data()));
}
}
// test randomly moving nodes
void test2()
{
auto t = std::time(nullptr);
auto tm = *std::localtime(&t);
const size_t MAX_NODES = 30;
const size_t MAX_TIME = 480; // 8 hrs of simulation
std::vector<int> sides = {2928}; // {5477, 4472, 3873, 3464, 3162, 2928};
for (auto side : sides) {
std::ostringstream oss;
oss << "results/";
oss << std::put_time(&tm, "%y%m%d_%H%M%S");
oss << "_side-" << side;
oss << "_nodes-" << MAX_NODES << "_";
MeshNode::sParametersString = oss.str();
MeshNode::sMaxSize = side;
MeshNode::CreateNodes(MAX_NODES);
for (int i = 0; i < MAX_NODES; i++) {
bls::PublicKey pk = MeshNode::FromIndex(i).GetPublicKey();
Ledger::sInstance.Issue(pk, COMMITTED_TOKENS, MAX_NODES);
}
for (int i = 0; i < MAX_TIME; i++) {
MeshNode::UpdateSimulation();
}
CloseLogs();
}
}
// test with pre-defined paths
void test1()
{
const size_t MAX_NODES = 6;
MeshNode::CreateNodes(MAX_NODES);
// create linear route: A <-> B <-> C <-> D1
MeshRoute route1;
for (int i = 0; i < MAX_NODES-1; i++) {
HGID hgid = MeshNode::FromIndex(i).GetHGID();
route1.push_back(hgid);
}
auto iter = route1.begin();
HGID A = *iter++;
HGID B = *iter++;
HGID C = *iter++;
HGID D1 = route1.back();
MeshRoute route2 = route1;
route2.pop_back();
HGID D2 = MeshNode::FromIndex(MAX_NODES-1).GetHGID();
route2.push_back(D2);
// add route to gateway
HGID gateway = MeshNode::FromIndex(MAX_NODES).GetHGID();
route1.push_back(gateway);
route2.push_back(gateway);
MeshNode::AddGateway(gateway);
// add route from first to D1 node A->B->C->D1
MeshNode::AddRoute(route1);
// add route from first to D2 node A->B-C->D2
MeshNode::AddRoute(route2);
cout << "----------------------------------------------" << endl << endl;
// send a message from route 0 [A to C], and receive delivery receipt
std::string payload = "TEST TEST TEST";
TestRoute(A, B, payload);
TestRoute(A, C, payload);
cout << "----------------------------------------------" << endl << endl;
// send a message from route 1 [A to D1], and receive delivery receipt
//payload = "Mr. Watson - come here - I want to see you.";
//TestRoute(A, D1, payload);
cout << "----------------------------------------------" << endl << endl;
// send a message from route 2 [A to D2], and receive delivery receipt
payload = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks.";
TestRoute(A, D2, payload);
cout << "----------------------------------------------" << endl << endl;
// send a message from reverse of route 1 [D2 to A], and receive delivery receipt
//payload = "The computer can be used as a tool to liberate and protect people, rather than to control them.";
//TestRoute(D2, A, payload);
}
bool testBLS()
{
//
// Creating keys and signatures
//
// Example seed, used to generate private key. Always use
// a secure RNG with sufficient entropy to generate a seed.
uint8_t seed[] = {0, 50, 6, 244, 24, 199, 1, 25, 52, 88, 192,
19, 18, 12, 89, 6, 220, 18, 102, 58, 209,
82, 12, 62, 89, 110, 182, 9, 44, 20, 254, 22};
bls::PrivateKey sk = bls::PrivateKey::FromSeed(seed, sizeof(seed));
bls::PublicKey pk = sk.GetPublicKey();
//
// Serializing keys and signatures to bytes
//
uint8_t skBytes[bls::PrivateKey::PRIVATE_KEY_SIZE]; // 32 byte array
uint8_t pkBytes[bls::PublicKey::PUBLIC_KEY_SIZE]; // 96 byte array
uint8_t sigBytes[bls::Signature::SIGNATURE_SIZE]; // 48 byte array
pk.Serialize(pkBytes); // 96 bytes
// Takes array of 96 bytes
pk = bls::PublicKey::FromBytes(pkBytes);
sk.Serialize(skBytes); // 32 bytes
uint8_t msg[] = {100, 2, 254, 88, 90, 45, 23};
bls::Signature sig = sk.Sign(msg, sizeof(msg));
sig.Serialize(sigBytes); // 48 bytes
//
// Loading keys and signatures from bytes
//
// Takes array of 32 bytes
sk = bls::PrivateKey::FromBytes(skBytes);
// Takes array of 96 bytes
pk = bls::PublicKey::FromBytes(pkBytes);
// Takes array of 48 bytes
sig = bls::Signature::FromBytes(sigBytes);
//
// Verifying signatures
//
// Add information required for verification, to sig object
sig.SetAggregationInfo(bls::AggregationInfo::FromMsg(pk, msg, sizeof(msg)));
bool ok = sig.Verify();
//
// Aggregate signatures for a single message
//
{
// Generate some more private keys
seed[0] = 1;
bls::PrivateKey sk1 = bls::PrivateKey::FromSeed(seed, sizeof(seed));
seed[0] = 2;
bls::PrivateKey sk2 = bls::PrivateKey::FromSeed(seed, sizeof(seed));
// Generate first sig
bls::PublicKey pk1 = sk1.GetPublicKey();
bls::Signature sig1 = sk1.Sign(msg, sizeof(msg));
// Generate second sig
bls::PublicKey pk2 = sk2.GetPublicKey();
bls::Signature sig2 = sk2.Sign(msg, sizeof(msg));
// Aggregate signatures together
vector<bls::Signature> sigs = {sig1, sig2};
bls::Signature aggSig = bls::Signature::AggregateSigs(sigs);
// For same message, public keys can be aggregated into one.
// The signature can be verified the same as a single signature,
// using this public key.
vector<bls::PublicKey> pubKeys = {pk1, pk2};
bls::PublicKey aggPubKey = bls::PublicKey::Aggregate(pubKeys);
}
//
// Aggregate signatures for different messages
//
// Generate one more key and message
seed[0] = 1;
bls::PrivateKey sk1 = bls::PrivateKey::FromSeed(seed, sizeof(seed));
bls::PublicKey pk1 = sk1.GetPublicKey();
seed[0] = 2;
bls::PrivateKey sk2 = bls::PrivateKey::FromSeed(seed, sizeof(seed));
bls::PublicKey pk2 = sk2.GetPublicKey();
seed[0] = 3;
bls::PrivateKey sk3 = bls::PrivateKey::FromSeed(seed, sizeof(seed));
bls::PublicKey pk3 = sk3.GetPublicKey();
uint8_t msg2[] = {100, 2, 254, 88, 90, 45, 23};
// Generate the signatures, assuming we have 3 private keys
bls::Signature sig1 = sk1.Sign(msg, sizeof(msg));
bls::Signature sig2 = sk2.Sign(msg, sizeof(msg));
bls::Signature sig3 = sk3.Sign(msg2, sizeof(msg2));
// They can be noninteractively combined by anyone
// Aggregation below can also be done by the verifier, to
// make batch verification more efficient
vector<bls::Signature> sigsL = {sig1, sig2};
bls::Signature aggSigL = bls::Signature::AggregateSigs(sigsL);
// Arbitrary trees of aggregates
vector<bls::Signature> sigsFinal = {aggSigL, sig3};
bls::Signature aggSigFinal = bls::Signature::AggregateSigs(sigsFinal);
// Serialize the final signature
aggSigFinal.Serialize(sigBytes);
//
// Verify aggregate signature for different messages
//
// Deserialize aggregate signature
aggSigFinal = bls::Signature::FromBytes(sigBytes);
// Create aggregation information (or deserialize it)
bls::AggregationInfo a1 = bls::AggregationInfo::FromMsg(pk1, msg, sizeof(msg));
bls::AggregationInfo a2 = bls::AggregationInfo::FromMsg(pk2, msg, sizeof(msg));
bls::AggregationInfo a3 = bls::AggregationInfo::FromMsg(pk3, msg2, sizeof(msg2));
vector<bls::AggregationInfo> infos = {a1, a2};
bls::AggregationInfo a1a2 = bls::AggregationInfo::MergeInfos(infos);
vector<bls::AggregationInfo> infos2 = {a1a2, a3};
bls::AggregationInfo aFinal = bls::AggregationInfo::MergeInfos(infos2);
// Verify final signature using the aggregation info
aggSigFinal.SetAggregationInfo(aFinal);
ok = aggSigFinal.Verify();
// If you previously verified a signature, you can also divide
// the aggregate signature by the signature you already verified.
ok = aggSigL.Verify();
vector<bls::Signature> cache = {aggSigL};
aggSigFinal = aggSigFinal.DivideBy(cache);
// Final verification is now more efficient
ok = aggSigFinal.Verify();
return ok;
}