Signatures of knowledge for boolean circuits under standard assumptions
Signatures of knowledge for boolean circuits under standard assumptions
Citació
- Baghery K, González A, Pindado Z, Ràfols C. Signatures of knowledge for boolean circuits under standard assumptions. In: Nitaj A, Youssef A, editors. AFRICACRYPT 2020: 12th International Conference on Cryptology in Africa; 2020 Jul 20-22; Cairo, Egypt. Cham: Springer; 2020. p. 24-44. DOI: 10.1007/978-3-030-51938-4_2
Enllaç permanent
Descripció
Resum
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. Our new scheme can be used to construct the most efficient Signature-of-Knowledge based on standard assumptions that also can be composed universally with other cryptographic protocols/primitives.Descripció
Comunicació presentada al AFRICACRYPT 2020: 12th International Conference on Cryptology in Africa, celebrat del 20 al 22 de juliol de 2021 al Caire, Egipte.