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
|
%%% Copyright (c) 2014-2015, NORDUnet A/S.
%%% See LICENSE for licensing information.
%%% @doc Frontend node API
-module(frontend).
%% API (URL)
-export([request/3]).
request(post, "ct/frontend/sendentry", Input) ->
case (catch mochijson2:decode(Input)) of
{error, E} ->
html("sendentry: bad input:", E);
{struct, PropList} ->
LogEntry = base64:decode(proplists:get_value(<<"entry">>, PropList)),
TreeLeafHash = base64:decode(proplists:get_value(<<"treeleafhash">>, PropList)),
ok = db:add(TreeLeafHash, LogEntry),
success({[{result, <<"ok">>}]})
end;
request(post, "ct/frontend/sendlog", Input) ->
case (catch mochijson2:decode(Input)) of
{error, E} ->
html("sendentry: bad input:", E);
{struct, PropList} ->
Start = proplists:get_value(<<"start">>, PropList),
Hashes = lists:map(fun (S) -> base64:decode(S) end, proplists:get_value(<<"hashes">>, PropList)),
Indices = lists:seq(Start, Start + length(Hashes) - 1),
lists:foreach(fun ({Hash, Index}) ->
ok = db:add_index_nosync(Hash, Index)
end, lists:zip(Hashes, Indices)),
lists:foreach(fun ({Hash, Index}) ->
ok = db:indexforhash_sync(Hash, Index)
end, lists:zip(Hashes, Indices)),
ok = db:index_sync(),
success({[{result, <<"ok">>}]})
end;
request(post, "ct/frontend/sendsth", Input) ->
case (catch mochijson2:decode(Input)) of
{error, E} ->
html("sendentry: bad input:", E);
{struct, PropList} ->
OldSize = db:size(),
Treesize = proplists:get_value(<<"tree_size">>, PropList),
Timestamp = proplists:get_value(<<"timestamp">>, PropList),
RootHash = base64:decode(proplists:get_value(<<"sha256_root_hash">>, PropList)),
Signature = base64:decode(proplists:get_value(<<"tree_head_signature">>, PropList)),
Indexsize = db:indexsize(),
if
Treesize < OldSize ->
html("Size is older than current size", OldSize);
Treesize == 0, OldSize == 0 ->
lager:debug("both old and new size is 0, saving sth"),
OwnRootHash = ht:root(-1),
case {plop:verify_sth(Treesize, Timestamp, RootHash, Signature), OwnRootHash} of
{true, RootHash} ->
ok = plop:save_sth({struct, PropList}),
success({[{result, <<"ok">>}]});
{false, RootHash} ->
html("Verification failed", hex:bin_to_hexstr(RootHash));
_ ->
html("Root hash not the same", hex:bin_to_hexstr(OwnRootHash))
end;
Treesize > Indexsize ->
html("Has too few entries", Indexsize);
true ->
NewEntries = get_new_entries(OldSize, Treesize),
lager:debug("old size: ~p new size: ~p entries: ~p",
[OldSize, Treesize, NewEntries]),
Errors = check_entries(NewEntries, OldSize, Treesize - 1),
case Errors of
[] ->
ht:load_tree(Treesize - 1),
OwnRootHash = ht:root(Treesize - 1),
case {plop:verify_sth(Treesize, Timestamp, RootHash, Signature), OwnRootHash} of
{true, RootHash} ->
ok = plop:save_sth({struct, PropList}),
success({[{result, <<"ok">>}]});
{false, RootHash} ->
html("Verification failed", hex:bin_to_hexstr(RootHash));
_ ->
html("Root hash not the same", hex:bin_to_hexstr(OwnRootHash))
end;
_ ->
html("Database not complete", Errors)
end
end
end;
request(get, "ct/frontend/currentposition", _Query) ->
Size = db:size(),
success({[{result, <<"ok">>},
{position, Size}]});
request(get, "ct/frontend/missingentries", _Query) ->
Size = db:size(),
Missing = fetchmissingentries(Size),
lager:debug("missingentries: ~p", [Missing]),
success({[{result, <<"ok">>},
{entries, lists:map(fun (Entry) -> base64:encode(Entry) end,
Missing)}]}).
get_new_entries(OldSize, Treesize) when OldSize < Treesize ->
db:leafhash_for_indices(OldSize, Treesize - 1);
get_new_entries(OldSize, Treesize) when OldSize == Treesize ->
[].
check_entries(Entries, Start, End) ->
lists:foldl(fun ({Hash, Index}, Acc) ->
case check_entry(Hash, Index) of
ok ->
Acc;
Error ->
[Error | Acc]
end
end, [], lists:zip(Entries, lists:seq(Start, End))).
entryhash_from_entry(Entry) ->
{ok, {Module, Function}} = application:get_env(plop, entryhash_from_entry),
Module:Function(Entry).
verify_entry(Entry) ->
{ok, {Module, Function}} = application:get_env(plop, verify_entry),
Module:Function(Entry).
check_entry(LeafHash, Index) ->
case db:get_by_leaf_hash(LeafHash) of
notfound ->
{notfound, Index};
{Index, LeafHash, Entry} ->
case verify_entry(Entry) of
{ok, LeafHash} ->
EntryHash = entryhash_from_entry(Entry),
db:add_entryhash(LeafHash, EntryHash),
ok;
{ok, DifferentLeafHash} ->
lager:error("leaf hash not correct: filename is ~p " ++
"and contents are ~p",
[hex:bin_to_hexstr(LeafHash),
hex:bin_to_hexstr(DifferentLeafHash)]),
{error, differentleafhash};
{error, Reason} ->
lager:error("verification failed: ~p", [Reason])
end
end.
-spec fetchmissingentries(non_neg_integer()) -> [binary() | noentry].
fetchmissingentries(Index) ->
lists:reverse(fetchmissingentries(Index, [])).
-spec fetchmissingentries(non_neg_integer(), [binary() | noentry]) ->
[binary() | noentry].
fetchmissingentries(Index, Acc) ->
lager:debug("index ~p", [Index]),
case db:leafhash_for_index(Index) of
noentry ->
Acc;
Hash ->
case db:entry_for_leafhash(Hash) of
noentry ->
lager:debug("didn't find hash ~p", [Hash]),
fetchmissingentries(Index + 1, [Hash | Acc]);
_ ->
fetchmissingentries(Index + 1, Acc)
end
end.
%% Private functions.
html(Text, Input) ->
{400, [{"Content-Type", "text/html"}],
io_lib:format(
"<html><body><p>~n" ++
"~s~n" ++
"~p~n" ++
"</body></html>~n", [Text, Input])}.
success(Data) ->
{200, [{"Content-Type", "text/json"}], mochijson2:encode(Data)}.
|
