A Digital Signature Based on a Conventional Encryption Function
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Authentic Third-party Data Publication
Proceedings of the IFIP TC11/ WG11.3 Fourteenth Annual Working Conference on Database Security: Data and Application Security, Development and Directions
On Optimal Hash Tree Traversal for Interval Time-Stamping
ISC '02 Proceedings of the 5th International Conference on Information Security
Efficient Certificate Revocation
Efficient Certificate Revocation
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Certificate revocation system implementation based on the Merkle hash tree
International Journal of Information Security
Almost optimal hash sequence traversal
FC'02 Proceedings of the 6th international conference on Financial cryptography
Fractal Merkle tree representation and traversal
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Merkle Tree Traversal Revisited
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Proceedings of the second ACM conference on Wireless network security
Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Performance of two one-time signature schemes in space/time constrained environments
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Authenticated data structures, generically
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 5.23 |
In this paper we describe optimal trade-offs between time and space complexity of Merkle tree traversals with their associated authentication paths, improving on the previous results of M. Jakobsson, T. Leighton, S. Micali, and M. Szydlo [Fractal Merkle tree representation and traversal, in: RSA Cryptographers Track, RSA Security Conference, 2003] and M. Szydlo [Merkle tree traversal in log space and time, in: Proc. Eurocrypt, in: LNCS, vol. 3027, 2004, pp. 541-554; Merkle tree traversal in log space and time, Preprint version 2003, available at http://www.szydlo.com]. In particular, we show that our algorithm requires 2logn/log^(^3^)n hash function computations and storage for less than (logn/log^(^3^)n+1)loglogn+2logn hash values, where n is the number of leaves in the Merkle tree. We also prove that these trade-offs are optimal, i.e. there is no algorithm that requires less than O(logn/logt) time and less than O(tlogn/logt) space for any choice of parameter t=2. Our algorithm could be of special interest in the case when both time and space are limited.