Signatures of Knowledge for Boolean Circuits Under Standard Assumptions

DOI10.1007/978-3-030-51938-4_2MaRDI QIDQ5048960zbMATH OpenOpenAlexFDO

Authors Karim Baghery, Alonso González, Zaira Pindado, 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

bilinear groupsBoolean circuitsNIZKsignatures

Mathematics Subject Classification ID

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

Recommendations

• Signatures of knowledge for Boolean circuits under standard assumptions
• Efficient signatures of knowledge and DAA in the standard model
• On Signatures of Knowledge
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• Zero-Knowledge Simulation of Boolean Circuits
• On the complexity and depth of circuits that realize partial Boolean functions
• The complexity of the descriptiveness of Boolean circuits over different sets of gates
• Beating exhaustive search for quantified Boolean formulas and connections to circuit complexity
• The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis
• Efficient proofs of knowledge for threshold relations

Cites work

• Advances in Cryptology - CRYPTO 2003
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient signatures of knowledge and DAA in the standard model
• scientific article; zbMATH DE number 176566 (Why is no real title available?)
• Identity-based encryption tightly secure under chosen-ciphertext attacks
• Linearly Homomorphic Structure-Preserving Signatures and Their Applications
• On Signatures of Knowledge
• On the size of pairing-based non-interactive arguments
• QA-NIZK arguments in asymmetric groups: new tools and new constructions
• Quadratic span programs and succinct NIZKs without PCPs
• Quasi-adaptive NIZK for linear subspaces revisited
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Shorter pairing-based arguments under standard assumptions
• Shorter quadratic QA-NIZK proofs
• Shorter quasi-adaptive NIZK proofs for linear subspaces
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• Stretching Groth-Sahai: NIZK proofs of partial satisfiability
• Subversion-resistant simulation (knowledge) sound NIZKs
• Universally composable two-party and multi-party secure computation

Cited in

(5)

• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• Signatures of knowledge for Boolean circuits under standard assumptions
• Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
• On Signatures of Knowledge
• Limits of using signatures for permutation independent Boolean comparison

This page was built for publication: Signatures of Knowledge for Boolean Circuits Under Standard Assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048960)