Paper 2019/1060

Sharing the LUOV: Threshold Post-Quantum Signatures

Daniele Cozzo and Nigel P. smart

Abstract

We examine all of the signature submissions to Round-2 of the NIST PQC ``competition'' in the context of whether one can transform them into threshold signature schemes in a relatively straight forward manner. We conclude that all schemes, except the ones in the MQ family, have significant issues when one wishes to convert them using relatively generic MPC techniques. The lattice based schemes are hampered by requiring a mix of operations which are suited to both linear secret shared schemes (LSSS)- and garbled circuits (GC)-based MPC techniques (thus requiring costly transfers between the two paradigms). The Picnic and SPHINCS+ algorithms are hampered by the need to compute a large number of hash function queries on secret data. Of the nine submissions the two which would appear to be most suitable for using in a threshold like manner are Rainbow and LUOV, with LUOV requiring less rounds and less data storage.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. MAJOR revision.IMA CC 2019
Contact author(s)
daniele cozzo @ kuleuven be
nigel smart @ kuleuven be
History
2019-09-19: last of 2 revisions
2019-09-18: received
See all versions
Short URL
https://ia.cr/2019/1060
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2019/1060,
      author = {Daniele Cozzo and Nigel P.  smart},
      title = {Sharing the LUOV: Threshold Post-Quantum Signatures},
      howpublished = {Cryptology ePrint Archive, Paper 2019/1060},
      year = {2019},
      note = {\url{https://eprint.iacr.org/2019/1060}},
      url = {https://eprint.iacr.org/2019/1060}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.