Paper 2020/1189 Original: eprint.iacr.org/2020/1189 ↗
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2020-09-30: last updated
- 2020-09-30: published
- Short URL
- https://ia.cr/2020/1189
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2020/1189,
author = {Karim Baghery and Alonso González and Zaira Pindado and Carla Ràfols},
title = {Signatures of Knowledge for Boolean Circuits under Standard Assumptions (Full version)},
howpublished = {Cryptology {ePrint} Archive, Paper 2020/1189},
year = {2020},
url = {https://eprint.iacr.org/2020/1189}
}