Cryptology ePrint Archive: Report 2002/190

Parallelizable Authentication Trees

Eric Hall and 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

Category / Keywords: incremental authentication encryption block cipher parallelizable Merkle tree

Date: received 12 Dec 2002, last revised 1 Feb 2005

Contact author: csjutla at watson ibm com

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation

Version: 20050201:232732 (All versions of this report)

Short URL: ia.cr/2002/190

Discussion forum: Show discussion | Start new discussion