How to construct random functions
Journal of the ACM (JACM)
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
One-way functions are necessary and sufficient for secure signatures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
Simple forward-secure signatures from any signature scheme
Proceedings of the 7th ACM conference on Computer and communications security
Optimal Tree-Based One-Time Digital Signature Schemes
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
A Forward-Secure Digital Signature Scheme
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
One Way Hash Functions and DES
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Keying Hash Functions for Message Authentication
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Collision-Resistant Hashing: Towards Making UOWHFs Practical
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Pseudorandom functions revisited: the cascade construction and its concrete security
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of 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
Merkle Tree Traversal Revisited
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Digital Signatures Out of Second-Preimage Resistant Hash Functions
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Forward-security in private-key cryptography
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Fractal Merkle tree representation and traversal
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
On the security of the Winternitz one-time signature scheme
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
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
Practical lattice-based cryptography: a signature scheme for embedded systems
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
On the security of the Winternitz one-time signature scheme
International Journal of Applied Cryptography
| Hi-index | 0.00 |
We present the hash-based signature scheme XMSS. It is the first provably (forward) secure and practical signature scheme with minimal security requirements: a pseudorandom and a second preimage resistant (hash) function family. Its signature size is reduced to less than 25% compared to the best provably secure hash based signature scheme.