Transparency Logs via Append-only Authenticated Dictionaries
This is the LaTeX source code for our ACM CCS'19 paper on building asymptotically-optimal transparency logs from bilinear and RSA accumulators. This is a first step towards append-only logs that are efficient to search remotely in a provable manner.
All figures from the paper can be found here:
- AAS data structure overview
- An example forest evolution
- Trie and corresponding frontier
- Our ADS model
A thumbnail for the paper can be found here.