[Cryptography] Is ASN.1 still the thing?

[Tony Arcieri]

On Wed, Nov 15, 2017 at 8:47 AM, Nico Williams <nico at cryptonector.com>
wrote:

> I don't know of any cases where one does this, but I can imagine one:
> replicating a logical stream of operations on a Merkle hash tree DB,
> with a hash/MAC/signature of the final Merkle hash tree root.  The
> logical stream being a compression of the block-level stream, this is
> worthwhile just on account of that when the goal is to replicate the
> same Merkle hash tree on the recipient side.  (Of course, one should
> also integrity-protect the logical stream in this case.)  This would,
> indeed, be a legitimate application of canonical encodings.


You have pretty much just described the architecture of Google Trillian:

https://github.com/google/trillian/blob/master/docs/VerifiableDataStructures.pdf

Trillian's log-derived maps consist of two logs: a Merkle log of operations
to apply to a verifiable map (i.e. sparse Merkle tree), and another log
that checkpoints the new Merkle roots of an updated verifiable map after
the operations have been applied.

Ethereum does something similar with Merkle Patricia Trees:

https://github.com/ethereum/wiki/wiki/Patricia-Tree

-- 
Tony Arcieri
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.metzdowd.com/pipermail/cryptography/attachments/20171117/e03f7510/attachment.html>