Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials

DOI10.17223/20710410/59/2MaRDI QIDQ6168401

I. V. Martynenkov

Publication date: 8 August 2023

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

Full work available at URL: http://mathnet.ru/eng/pdm792

zbMATH Keywords

proof of knowledgezero knowledgesuccinct non-interactive argumentsreliability of calculations

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Pairings for cryptographers
• The hunting of the SNARK
• A new polynomial factorization algorithm and its implementation
• Distributed differential privacy via shuffling
• Fast garbling of circuits under standard assumptions
• Targeted malleability
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• Fully Homomorphic Message Authenticators
• Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
• Scalable Zero Knowledge via Cycles of Elliptic Curves
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
• How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
• Malleable Proof Systems and Applications
• Square Span Programs with Applications to Succinct NIZK Arguments
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
• Randomizable Proofs and Delegatable Anonymous Credentials
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Perfect Non-interactive Zero Knowledge for NP
• Compact Group Signatures Without Random Oracles
• An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Succinct Non-interactive Arguments via Linear Interactive Proofs
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Optimal Verification of Operations on Dynamic Sets
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
• P-signatures and Noninteractive Anonymous Credentials
• Privacy-Preserving Set Operations
• Recursive composition and bootstrapping for SNARKS and proof-carrying data
• On the Size of Pairing-Based Non-interactive Arguments

This page was built for publication: Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials