International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Improving the Performance of the Picnic Signature Scheme

Authors:
Daniel Kales , Graz University of Technology, Graz, Austria
Greg Zaverucha , Microsoft Research, Redmond, WA, USA
Download:
DOI: 10.13154/tches.v2020.i4.154-188
URL: https://tches.iacr.org/index.php/TCHES/article/view/8680
Search ePrint
Search Google
Presentation: Slides
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.
Video from TCHES 2020
BibTeX
@article{tches-2020-30551,
  title={Improving the Performance of the Picnic Signature Scheme},
  journal={IACR Transactions on Cryptographic Hardware and Embedded Systems},
  publisher={Ruhr-Universität Bochum},
  volume={2020, Issue 4},
  pages={154-188},
  url={https://tches.iacr.org/index.php/TCHES/article/view/8680},
  doi={10.13154/tches.v2020.i4.154-188},
  author={Daniel Kales and Greg Zaverucha},
  year=2020
}