%0 Conference Proceedings
%T Optimal Parameters for XMSSMT
%+ Cryptography and Computeralgebra, Department of Computer Science
%+ Department of Computer Science
%A Hülsing, Andreas
%A Rausch, Lea
%A Buchmann, Johannes
%Z Part 2: Security Engineering
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 1st Cross-Domain Conference and Workshop on Availability, Reliability, and Security in Information Systems (CD-ARES)
%C Regensburg, Germany
%Y Alfredo Cuzzocrea
%Y Christian Kittl
%Y Dimitris E. Simos
%Y Edgar Weippl
%Y Lida Xu
%I Springer
%3 Security Engineering and Intelligence Informatics
%V LNCS-8128
%P 194-208
%8 2013-09-02
%D 2013
%K hash-based signatures
%K parameter selection
%K linear optimization
%K forward secure signatures
%K implementation
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X We introduce Multi Tree XMSS (XMSSMT), a hash-based signature scheme that can be used to sign a virtually unlimited number of messages. It is provably forward and hence EU-CMA secure in the standard model and improves key and signature generation times compared to previous schemes. XMSSMT has — like all practical hash-based signature schemes — a lot of parameters that control different trade-offs between security, runtimes and sizes. Using linear optimization, we show how to select provably optimal parameter sets for different use cases.
%G English
%2 https://inria.hal.science/hal-01506577/document
%2 https://inria.hal.science/hal-01506577/file/978-3-642-40588-4_14_Chapter.pdf
%L hal-01506577
%U https://inria.hal.science/hal-01506577
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC5
%~ IFIP-WG
%~ IFIP-TC8
%~ IFIP-CD-ARES
%~ IFIP-WG8-4
%~ IFIP-WG8-9
%~ IFIP-LNCS-8128