A Unified Framework for Non-universal SNARKs

DOI10.1007/978-3-030-97121-2_20zbMath1492.94141MaRDI QIDQ5087272

Helger Lipmaa

Publication date: 8 July 2022

Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-97121-2_20

zbMATH Keywords

SAP; SSP; QAP; SNARK; NIZK; QSP; simulation-extractability; subversion zero-knowledge

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

A Unified Framework for Non-universal SNARKs, CRS-updatable asymmetric quasi-adaptive NIZK arguments

Uses Software

• Pinocchio

Cites Work

• Unnamed Item
• Unnamed Item
• Updatable and universal common reference strings with applications to zk-SNARKs
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• A subversion-resistant SNARK
• An efficient pairing-based shuffle argument
• Subversion-zero-knowledge SNARKs
• The algebraic group model and its applications
• On subversion-resistant SNARKs
• Another look at extraction and randomization of Groth's zk-SNARK
• On the efficiency of privacy-preserving smart contract systems
• Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
• Square Span Programs with Applications to Succinct NIZK Arguments
• NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Efficient Public-Key Cryptography in the Presence of Key Leakage
• Succinct Non-interactive Arguments via Linear Interactive Proofs
• Quadratic Span Programs and Succinct NIZKs without PCPs
• On QA-NIZK in the BPK Model
• A Unified Framework for Non-universal SNARKs
• On the Size of Pairing-Based Non-interactive Arguments
• Snarky ceremonies