A simple and efficient framework of proof systems for NP

DOI10.1007/978-981-99-8724-5_6zbMATH Open1548.68086MaRDI QIDQ6562565

Yu Yu Wang, Chuanjie Su, Jia-xin Pan, Yu Chen

Publication date: 26 June 2024

zbMATH Keywords

pairing-based cryptographynon-interactive zero-knowledgeNP-languagebatch argument

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• More efficient (almost) tightly secure structure-preserving signatures
• The hunting of the SNARK
• Shorter quasi-adaptive NIZK proofs for linear subspaces
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
• Compact NIZKs from standard assumptions on bilinear maps
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• Non-interactive batch arguments for NP from standard assumptions
• Type 2 Structure-Preserving Signature Schemes Revisited
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming
• An Algebraic Framework for Diffie-Hellman Assumptions
• Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
• Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces
• Secure Two-Party Computation with Low Communication
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
• 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
• Short Non-interactive Zero-Knowledge Proofs
• The Knowledge Complexity of Interactive Proof Systems
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Computationally Sound Proofs
• Efficient Noninteractive Proof Systems for Bilinear Groups
• Succinct Non-interactive Arguments via Linear Interactive Proofs
• Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Leakage-Resilient Zero Knowledge
• How to delegate computations publicly
• On the existence of extractable one-way functions
• Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
• Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
• New Techniques for Noninteractive Zero-Knowledge
• On the Size of Pairing-Based Non-interactive Arguments
• Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
• Boosting batch arguments and RAM delegation

This page was built for publication: A simple and efficient framework of proof systems for NP