Signatures of knowledge for Boolean circuits under standard assumptions

DOI10.1016/J.TCS.2022.03.006MaRDI QIDQ2143135zbMATH OpenOpenAlexWikidataFDO

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

Publication date 31 May 2022

Published in Theoretical Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.tcs.2022.03.006

zbMATH Keywords

bilinear groupscircuitSatNIZKsignatures

Mathematics Subject Classification ID

Theory of computing (68Qxx)

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
• An algebraic framework for Diffie-Hellman assumptions
• An algebraic framework for Diffie-Hellman assumptions
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient signatures of knowledge and DAA in the standard model
• Fine-Tuning Groth-Sahai Proofs
• scientific article; zbMATH DE number 176566 (Why is no real title available?)
• Identity-based encryption tightly secure under chosen-ciphertext attacks
• Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
• Linearly Homomorphic Structure-Preserving Signatures and Their Applications
• More efficient (almost) tightly secure structure-preserving signatures
• On Signatures of Knowledge
• On the efficiency of privacy-preserving smart contract systems
• On the size of pairing-based non-interactive arguments
• Perfect Non-interactive Zero Knowledge for NP
• 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
• Short pairing-based non-interactive zero-knowledge arguments
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• Shorter pairing-based arguments under standard assumptions
• Shorter QA-NIZK and SPS with tighter security
• Shorter quadratic QA-NIZK proofs
• Shorter quasi-adaptive NIZK proofs for linear subspaces
• Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
• Simulation Extractable Versions of Groth’s zk-SNARK Revisited
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• Square span programs with applications to succinct NIZK arguments
• Stretching Groth-Sahai: NIZK proofs of partial satisfiability
• Subversion-resistant simulation (knowledge) sound NIZKs
• Switching lemma for bilinear tests and constant-size NIZK proofs for linear subspaces
• The kernel matrix Diffie-Hellman assumption
• Towards a classification of non-interactive computational assumptions in cyclic groups
• Universally composable two-party and multi-party secure computation

Cited in

(3)

• Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
• 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 Q2143135)