Welcome to the resource topic for 2011/439
Title:
Optimal Data Authentication from Directed Transitive Signatures
Authors: Philippe Camacho
Abstract:An authenticated dictionary of size N is said to be optimal when an update operation or proof computation requires at most O(\log N) accesses to the data-structure, and the size of a proof is O(1) with respect to N. In this note we show that an optimal authenticated dictionary (OAD) can be built using transitive signatures for directed graphs (DTS). As the existence of DTS and OAD are both still open, our result can be interpreted as following: if optimal authenticated dictionaries do not exist then transitive signatures for directed graphs do not exist either.
ePrint: https://eprint.iacr.org/2011/439
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .