A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Optimal trade-off for Merkle tree traversal
Theoretical Computer Science
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Merkle Signatures with Virtually Unlimited Signature Capacity
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Fractal Merkle tree representation and traversal
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
CMSS: an improved merkle signature scheme
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Hash based digital signature schemes
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Verifiably Encrypted Signatures from RSA without NIZKs
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
A novel cryptoprocessor architecture for chained Merkle signature scheme
Microprocessors & Microsystems
Fighting against packet dropping misbehavior in multi-hop wireless ad hoc networks
Journal of Network and Computer Applications
XMSS - a practical forward secure signature scheme based on minimal security assumptions
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
| Hi-index | 0.00 |
We propose a new algorithm for computing authentication paths in the Merkle signature scheme. Compared to the best algorithm for this task, our algorithm reduces the worst case running time considerably.