1. Signatures of knowledge for Boolean circuits under standard assumptions
- Author
-
Zaira Pindado, Carla Ràfols, Alonso González, and Karim Baghery
- Subjects
Scheme (programming language) ,Technology ,050101 languages & linguistics ,NIZK ,General Computer Science ,Computer science ,Boolean circuit ,QUASI-ADAPTIVE NIZK ,02 engineering and technology ,Mathematical proof ,Article ,Theoretical Computer Science ,Computer Science, Theory & Methods ,0202 electrical engineering, electronic engineering, information engineering ,Overhead (computing) ,0501 psychology and cognitive sciences ,CircuitSat ,computer.programming_language ,Discrete mathematics ,Soundness ,Science & Technology ,NONINTERACTIVE ZERO-KNOWLEDGE ,Signatures ,05 social sciences ,Construct (python library) ,Bilinear groups ,Cryptographic protocol ,Satisfiability ,Computer Science ,020201 artificial intelligence & image processing ,PROOFS ,computer - Abstract
Comunicació presentada al AFRICACRYPT 2020: 12th International Conference on Cryptology in Africa, celebrat del 20 al 22 de juliol de 2021 al Caire, Egipte. 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. Karim Baghery was supported by CyberSecurity Research Flanders with reference number VR20192203.
- Published
- 2022