Paper 2016/1168

Generic Zero-Knowledge and Multivariate Quadratic Systems

Alan Szepieniec and Bart Preneel

Abstract

Zero-knowledge proofs are a core building block for a broad range of cryptographic protocols. This paper introduces a generic zero-knowledge proof system capable of proving the correct computation of any circuit. Our protocol draws on recent advancements in multiparty computation and its security relies only on the underlying commitment scheme. Furthermore, we optimize this protocol for use with multivariate quadratic systems of polynomials, leading to provably secure signatures from multivariate quadratic systems, with keys that scale linearly and signatures that scale quadratically with the security parameter.

Metadata
Available format(s)
-- withdrawn --
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
zero-knowledge proofpost-quantumsignaturemultivariate quadraticprovable securitymulti-party computation
Contact author(s)
alan szepieniec @ esat kuleuven be
History
2017-01-17: withdrawn
2016-12-28: received
See all versions
Short URL
https://ia.cr/2016/1168
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.