Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
DOI10.1007/978-3-030-51938-4_2zbMATH Open1501.94065OpenAlexW3039840453MaRDI QIDQ5048960FDOQ5048960
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
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
Switching theory, applications of Boolean algebras to circuits and networks (94C11) Authentication, digital signatures and secret sharing (94A62) Networks and circuits as models of computation; circuit complexity (68Q06)
Cites Work
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Efficient signatures of knowledge and DAA in the standard model
- 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 Signatures of Knowledge
- Title not available (Why is that?)
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Universally composable two-party and multi-party secure computation
- Quadratic span programs and succinct NIZKs without PCPs
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Quasi-adaptive NIZK for linear subspaces revisited
- Identity-based encryption tightly secure under chosen-ciphertext attacks
- On the size of pairing-based non-interactive arguments
- Stretching Groth-Sahai: NIZK proofs of partial satisfiability
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- QA-NIZK arguments in asymmetric groups: new tools and new constructions
- Shorter quadratic QA-NIZK proofs
- Subversion-resistant simulation (knowledge) sound NIZKs
- Shorter pairing-based arguments under standard assumptions
Cited In (5)
- Limits of using signatures for permutation independent Boolean comparison
- Signatures of knowledge for Boolean circuits under standard assumptions
- On Signatures of Knowledge
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
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)
