Signatures of Knowledge for Boolean Circuits Under Standard Assumptions

DOI10.1007/978-3-030-51938-4_2zbMath1501.94065OpenAlexW3039840453MaRDI QIDQ5048960

Alonso González, Zaira Pindado, Karim Baghery, Carla Ràfols

Publication date: 9 November 2022

Published in: Progress in Cryptology - AFRICACRYPT 2020 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-51938-4_2

zbMATH Keywords

signaturesBoolean circuitsNIZKbilinear groups

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items

Signatures of knowledge for Boolean circuits under standard assumptions, Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs

Cites Work

• Unnamed Item
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• Identity-based encryption tightly secure under chosen-ciphertext attacks
• Subversion-resistant simulation (knowledge) sound NIZKs
• Shorter pairing-based arguments under standard assumptions
• Shorter quadratic QA-NIZK proofs
• QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions
• Linearly Homomorphic Structure-Preserving Signatures and Their Applications
• Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
• Efficient Signatures of Knowledge and DAA in the Standard Model
• Quasi-Adaptive NIZK for Linear Subspaces Revisited
• Universally composable two-party and multi-party secure computation
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Advances in Cryptology - CRYPTO 2003
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• On the Size of Pairing-Based Non-interactive Arguments
• On Signatures of Knowledge