Abstract
We present a protocol for the exchange of individually authenticated data streams among N parties. Our authentication procedure is fast, because it only requires the computation of hash functions – we do not need digital signatures, that are substantially less efficient. The authentication information is also short: two hash values for every block of data. Since there are no shared secrets, this information does not grow with N, the number of parties.
Cite
CITATION STYLE
Bergadano, F., Cavagnino, D., & Crispo, B. (2001). Chained stream authentication. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2012, pp. 144–157). Springer Verlag. https://doi.org/10.1007/3-540-44983-3_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
