2026-04-19T16:14:21Zhttps://recercat.cat/oai/request

oai:recercat.cat:10230/729252026-03-31T17:31:41Zcom_2072_6col_2072_452952

00925njm 22002777a 4500 dc Baghery, Karim author González, Alonso author Pindado, Zaira author Ràfols, Carla author 2026-03-30T10:34:52Z 2026-03-30T10:34:52Z 2022 2026-03-30T10:34:51Z 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 González and Ràfols (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. As an independent contribution we also detail a simple formula to encode Boolean circuits as Quadratic Arithmetic Programs. https://hdl.handle.net/10230/72925 NIZK Signatures Bilinear groups CircuitSat Signatures of knowledge for boolean circuits under standard assumptions