Hash-based cryptography: Difference between revisions

Revision as of 13:36, 5 May 2017

Revision as of 13:38, 5 May 2017

Line 10:

==References==

* J. Buchmann, E. Dahmen, and A. Hülsing,. "XMSS — A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions". PQCrypto 2011

* D. Bernstein, D. Hopwood, A. Hülsing, T. Lange, R. Niederhagen, L. Papachristodoulou, M. Schneider, P. Schwabe, Z. Wilcox-O'Hearn,. "SPHINCS: practical stateless hash-based signatures". EUROCRYPT 2015

* G. Becker. "Merkle Signature Schemes, Merkle Trees and Their Cryptanalysis", seminar 'Post Quantum Cryptology' at the Ruhr-University Bochum, Germany.

* E. Dahmen, M. Dring, E. Klintsevich, J. Buchmann, L.C. Coronado Garca. "CMSS -— an improved merkle signature scheme". Progress in Cryptology - Indocrypt 2006, 2006.

* E. Klintsevich, K. Okeya, C.Vuillaume, J. Buchmann, E.Dahmen. "Merkle signatures with virtually unlimited signature capacity". 5th International Conference on Applied Cryptography and Network Security - ACNS07, 2007.

* Ralph Merkle. "Secrecy, authentication and public key systems / A certified digital signature". Ph.D. dissertation, Dept. of Electrical Engineering, Stanford University, 1979. [http://www.merkle.com/papers/Thesis1979.pdf]

* Moni Naor, Moti Yung:. "Universal One-Way Hash Functions and their Cryptographic Applications ". STOC 1989: 33-43

* S. Micali, M. Jakobsson, T. Leighton, M. Szydlo. "Fractal merkleMerkle treeTree representationRepresentation and traversalTraversal". RSA-CT 03, 2003

==External links==