Improving the Performance of the Picnic Signature Scheme

Daniel Kales, Greg Zaverucha

Research output: Contribution to journalConference articleResearchpeer-review

Abstract

Picnic is a digital signature algorithm designed to provide security against attacks by quantum computers. The design uses only symmetric-key primitives, and is an efficient instantiation of the MPC-in-the-head paradigm. In this work, we explore the Picnic design in great detail. We investigate and benchmark different parameter choices and show that there exist better parameter choices than those in the current specification. We also present improvements to the MPC protocol that shorten signatures and reduce signing time. The proposed MPC changes tailor the protocol to the circuit of interest in Picnic, but may also be of independent interest. Taken together, these changes give a new instantiation of Picnic that signs messages 7.9 to 13.9 times faster, and verifies signatures 4.5 to 5.5 times faster than the existing Picnic2 design, while having nearly the same signature sizes.
Original languageEnglish
Number of pages44
JournalIACR Transactions on Cryptographic Hardware and Embedded Systems
Volume2020
Issue number4
Publication statusAccepted/In press - 15 Jun 2020
EventCHES 2020 - Virtuell, Unknown
Duration: 14 Sep 202017 Sep 2020

Keywords

  • post-quantum cryptography
  • digital signatures
  • zero-knowledge
  • MPC-in-the-head
  • efficient implementation

Fields of Expertise

  • Information, Communication & Computing

Cite this