Secure formation of public parameters and elimination of vulnerabilities of zero-knowledge succint non-interactive arguments of knowledge

DOI10.17223/20710410/61/3MaRDI QIDQ6495963

I. V. Martynenkov

Publication date: 2 May 2024

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

zbMATH Keywords

securitysuccinct non-interactive argumentscommon reference stringspublic parameters

Mathematics Subject Classification ID

Computer science (68-XX) Game theory, economics, finance, and other social and behavioral sciences (91-XX)

Cites Work

• Unnamed Item
• 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
• Twenty (short) questions
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• Scalable Zero Knowledge via Cycles of Elliptic Curves
• Square Span Programs with Applications to Succinct NIZK Arguments
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Access Control Encryption for Equality, Comparison, and More
• On the Size of Pairing-Based Non-interactive Arguments
• Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials

This page was built for publication: Secure formation of public parameters and elimination of vulnerabilities of zero-knowledge succint non-interactive arguments of knowledge