Signatures of knowledge for Boolean circuits under standard assumptions

Abstract

This paper constructs unbounded simulation sound proofs for boolean circuit satisfiability under standard assumptions with proof size O(n + d) bilinear group elements, where d is the depth and n is the input size of the circuit. Our technical contribution is to add unbounded simulation soundness to a recent NIZK of Gonzalez and Rafols (ASIACRYPT'19) with very small overhead. We give two different constructions: the first one is more efficient but not tight, and the second one is tight. Our new scheme can be used to construct Signatures of Knowledge based on standard assumptions that also can be composed universally with other cryptographic protocols/primitives.& nbsp;As an independent contribution we also detail a simple formula to encode Boolean circuits as Quadratic Arithmetic Programs. (C) 2022 The Author(s). Published by Elsevier B.V.& nbsp;