Welcome to the resource topic for 2002/190
Title:
Parallelizable Authentication Trees
Authors: Eric Hall, Charanjit S. Jutla
Abstract:We define a new authentication tree in the symmetric key setting,
which has the same computational time, storage
and security parameters as the well
known Merkle authentication tree, but which unlike the latter, allows
for all the cryptographic operations required for an update to be performed
in parallel. The cryptographic operations required for verification can
also be parallelized. In particular, we show a provably secure scheme for
incremental MAC with partial authentication secure against substitution and
replay attacks, which on total data of size 2^n blocks,
and given n cryptographic engines,
can compute incremental macs and perform
individual block authentication with
a critical path of only one cryptographic operation
ePrint: https://eprint.iacr.org/2002/190
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 .