Signatures of knowledge for Boolean circuits under standard assumptions

DOI10.1016/j.tcs.2022.03.006OpenAlexW3089385739WikidataQ114657690 ScholiaQ114657690MaRDI QIDQ2143135

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

Publication date: 31 May 2022

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

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

zbMATH Keywords

signaturesNIZKbilinear groupscircuitSat

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• An algebraic framework for Diffie-Hellman assumptions
• Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
• More efficient (almost) tightly secure structure-preserving signatures
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• Towards a classification of non-interactive computational assumptions in cyclic groups
• Identity-based encryption tightly secure under chosen-ciphertext attacks
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• On the efficiency of privacy-preserving smart contract systems
• Subversion-resistant simulation (knowledge) sound NIZKs
• Shorter QA-NIZK and SPS with tighter security
• Shorter pairing-based arguments under standard assumptions
• Shorter quadratic QA-NIZK proofs
• QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions
• An Algebraic Framework for Diffie-Hellman Assumptions
• 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
• Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces
• Square Span Programs with Applications to Succinct NIZK Arguments
• Quasi-Adaptive NIZK for Linear Subspaces Revisited
• The Kernel Matrix Diffie-Hellman Assumption
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Universally composable two-party and multi-party secure computation
• Perfect Non-interactive Zero Knowledge for NP
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
• Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
• Fine-Tuning Groth-Sahai Proofs
• 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

This page was built for publication: Signatures of knowledge for Boolean circuits under standard assumptions