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
|
#ifndef CERT_TRANS_MERKLETREE_MERKLE_VERIFIER_H_
#define CERT_TRANS_MERKLETREE_MERKLE_VERIFIER_H_
#include <stddef.h>
#include <memory>
#include <vector>
#include "merkletree/tree_hasher.h"
class SerialHasher;
// Class for verifying paths emitted by MerkleTrees.
// TODO: consistency proofs between snapshots.
class MerkleVerifier {
public:
MerkleVerifier(std::unique_ptr<SerialHasher> hasher);
~MerkleVerifier();
// Verify Merkle path. Return true iff the path is a valid proof for
// the leaf in the tree, i.e., iff 0 < leaf <= tree_size and path
// is a valid path from the leaf hash of data to the root.
//
// @param leaf index of the leaf.
// @param tree_size number of leaves in the tree.
// @param path a vector of node hashes ordered according to levels from leaf
// to root. Does not include the leaf hash or the root.
// @ param root The root hash
// @ param data The leaf data
bool VerifyPath(size_t leaf, size_t tree_size,
const std::vector<std::string>& path,
const std::string& root, const std::string& data);
// Compute the root corresponding to a Merkle audit path.
// Returns an empty string if the path is not valid.
//
// @param leaf index of the leaf.
// @param tree_size number of leaves in the tree.
// @param path a vector of node hashes ordered according to levels from leaf
// to root. Does not include the leaf hash or the root.
// @ param data The leaf data
std::string RootFromPath(size_t leaf, size_t tree_size,
const std::vector<std::string>& path,
const std::string& data);
bool VerifyConsistency(size_t snapshot1, size_t snapshot2,
const std::string& root1, const std::string& root2,
const std::vector<std::string>& proof);
// Return the leaf hash corresponding to the leaf input.
std::string LeafHash(const std::string& data);
private:
TreeHasher treehasher_;
};
#endif // CERT_TRANS_MERKLETREE_MERKLE_VERIFIER_H_
|
