Slide 12
Slide 12 text
Built on proven, scalable transparency logs & merkle
trees
{
"Type": {
"ns": "rekord",
"version": "0.1",
"spec": "https://github.com/projectrekor/rekor/rekord_spec.txt"
“URL": "https://example/release/my_release.tar.gz",
"SHA": "SHA256",
"PublicKey": "PUBLIC_KEY",
"Signature": "SIG"
}
Hash A
e908u09u093408yd
{
"Type": {
"ns": "rekord",
"version": "0.1",
"spec": "https://github.com/projectrekor/rekor/rekord_spec.txt"
“URL": "https://example/release/my_release.tar.gz",
"SHA": "SHA256",
"PublicKey": "PUBLIC_KEY",
"Signature": "SIG"
}
Hash B
dhu09u0d9u90fsu
{
"Type": {
"ns": "dd",
"version": "0.1",
"spec": "https://github.com/asdd/rekor/rekord_spec.txt"
“URL": "https://example/release/asd.tar.gz",
"SHA": "SHA256",
"PublicKey": "PUBLIC_KEY",
"Signature": "SIG"
}
Hash C
s09u09u09jupojde
{
"Type": {
"ns": "asddasd",
"version": "0.1",
"spec": "https://gi/rekord_spec.txt"
“URL": "https://example/release.tar.gz",
"SHA": "SHA256",
"PublicKey": "PUBLIC_KEY",
"Signature": "SIG"
}
Hash D
56gf9u09u309u9w
Hash(A+B)
a7a9u09usdfdr434tfd
Root Hash
(AB+CD)
09us09ud09jupoij3p49sd
Hash(C+D)
848jf0s099409f08us
● Used in git, blockchain, and
certificate transparency systems
● Append-only, “immutable”
● Changing a leaf would mean that the
hash stored at its parent would be
incorrect, as well as the path all the
way to the root of the tree
● SHA256 is relatively computationally
inexpensive