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