Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

DOI

  • Melissa Chase
  • ,
  • David Derler
  • ,
  • Steven Goldfeder
  • ,
  • Claudio Orlandi
  • Sebastian Ramacher
  • ,
  • Christian Rechberger
  • ,
  • Daniel Slamanig
  • ,
  • Greg Zaverucha

We propose a new class of post-quantum digital signature schemes that: (a) derive their security entirely from the security of symmetric-key primitives, believed to be quantum-secure, and (b) have extremely small keypairs, and, (c) are highly parameterizable. In our signature constructions, the public key is an image y = f (x) of a one-way function f and secret key x. A signature is a non-interactive zero-knowledge proof of x, that incorporates a message to be signed. For this proof, we leverage recent progress of Giacomelli et al. (USENIX'16) in constructing an efficient Ó-protocol for statements over general circuits. We improve this Ó-protocol to reduce proof sizes by a factor of two, at no additional computational cost. While this is of independent interest as it yields more compact proofs for any circuit, it also decreases our signature sizes. We consider two possibilities to make the proof non-interactive: The Fiat-Shamir transform and Unruh's transform (EUROCRYPT'12, '15,'16). The former has smaller signatures, while the latter has a security analysis in the quantum-accessible random oracle model. By customizing Unruh's transform to our application, the overhead is reduced to 1.6x when compared to the Fiat-Shamir transform, which does not have a rigorous post-quantum security analysis. We implement and benchmark both approaches and explore the possible choice of f , taking advantage of the recent trend to strive for practical symmetric ciphers with a particularly low number of multiplications and end up using LowMC (EUROCRYPT'15).

Original languageEnglish
Title of host publicationCCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security
Number of pages18
Place of publicationNew York, NY, USA
PublisherAssociation for Computing Machinery
Publication year30 Oct 2017
Pages1825-1842
ISBN (print)978-1-4503-4946-8
ISBN (Electronic)9781450349468
DOIs
Publication statusPublished - 30 Oct 2017
EventACM SIGSAC Conference on Computer and Communications Security - Dallas, United States
Duration: 30 Oct 20173 Nov 2017
https://ccs2017.sigsac.org/

Conference

ConferenceACM SIGSAC Conference on Computer and Communications Security
LandUnited States
ByDallas
Periode30/10/201703/11/2017
Internetadresse
SeriesCCS '17

    Research areas

  • Block Cipher, Fiat-Shamir, Implementation, Post-quantum cryptography, Signatures, Unruh, Zero-Knowledge, block cipher, implementation, zero-knowledge, signatures

See relations at Aarhus University Citationformats

ID: 119469498