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

DOI10.17223/20710410/59/2MaRDI QIDQ6168401FDOQ6168401

Authors: 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

Recommendations

• On succinct non-interactive arguments in relativized worlds
• zk-SNARKs from codes with rank metrics
• Scalable zero knowledge via cycles of elliptic curves
• Scalable zero knowledge via cycles of elliptic curves

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)

Cites Work

• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
• Snarks for C: verifying program executions succinctly and in zero knowledge
• An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
• Optimal verification of operations on dynamic sets
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Privacy-Preserving Set Operations
• Pairings for cryptographers
• Malleable proof systems and applications
• Compact Group Signatures Without Random Oracles
• P-signatures and Noninteractive Anonymous Credentials
• Randomizable Proofs and Delegatable Anonymous Credentials
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Perfect Non-interactive Zero Knowledge for NP
• Short pairing-based non-interactive zero-knowledge arguments
• A new polynomial factorization algorithm and its implementation
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• How to delegate and verify in public: verifiable computation from attribute-based encryption
• Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
• Succinct non-interactive arguments via linear interactive proofs
• Quadratic span programs and succinct NIZKs without PCPs
• Fully homomorphic message authenticators
• Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
• On the size of pairing-based non-interactive arguments
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
• Targeted malleability: homomorphic encryption for restricted computations
• Scalable zero knowledge via cycles of elliptic curves
• Square span programs with applications to succinct NIZK arguments
• Recursive composition and bootstrapping for SNARKs and proof-carrying data
• The hunting of the SNARK
• Fast garbling of circuits under standard assumptions
• Distributed differential privacy via shuffling
• Title not available (Why is that?)

Cited In (6)

• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• Title not available (Why is that?)
• Precise zero-knowledge arguments with poly-logarithmic efficiency
• Secure formation of public parameters and elimination of vulnerabilities of zero-knowledge succint non-interactive arguments of knowledge
• zk-Bench: a toolset for comparative evaluation and performance benchmarking of SNARKs
• Zero-Knowledge Accumulators and Set Algebra

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168401)