Skip to Main content Skip to Navigation
Conference papers

Signatures of Knowledge for Boolean Circuits under Standard Assumptions (Full version)

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 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Alonso González Connect in order to contact the contributor
Submitted on : Friday, January 22, 2021 - 10:32:09 AM
Last modification on : Thursday, January 20, 2022 - 4:14:16 PM
Long-term archiving on: : Friday, April 23, 2021 - 7:00:13 PM


Files produced by the author(s)




Karim Baghery, Alonso González, Zaira Pindado, Carla Ràfols. Signatures of Knowledge for Boolean Circuits under Standard Assumptions (Full version). AFRICACRYPT 2020 - 12th International Conference on Cryptology in Africa, Jul 2020, Cairo / Virtual, Egypt. pp.24-44, ⟨10.1007/978-3-030-51938-4_2⟩. ⟨hal-03118271⟩



Les métriques sont temporairement indisponibles