scientific article; zbMATH DE number 1302863
From MaRDI portal
Publication:4249348
communication complexitycommitment schemesinteractive proof systemRSA assumptionfinite prime fieldarithmetic circuits over finite prime fieldsBoolean circuit satisfiabilityefficient zero-knowledge proofsexistence of \(q\)-one way group homomorphismshardness of discrete logpolynomial security of Diffie-Hellman encryption
Recommendations
Cited in
(37)- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Zero-knowledge for multivariate polynomials
- Practical zero-knowledge proofs for circuit evaluation
- Zero-knowledge proofs for committed symmetric Boolean functions
- Rogue-instance security for batch knowledge proofs
- scientific article; zbMATH DE number 4191124 (Why is no real title available?)
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- On the amortized complexity of zero knowledge protocols for multiplicative relations
- Efficient NIZK arguments with straight-line simulation and extraction
- Non-interactive and non-malleable commitment scheme based on q-one way group homomorphisms
- An accurate, scalable and verifiable protocol for federated differentially private averaging
- Improved OR-composition of sigma-protocols
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Cryptographic reverse firewalls for interactive proof systems
- QA-NIZK arguments of same opening for bilateral commitments
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- How to deal with malicious users in privacy‐preserving distributed data mining
- Malleable commitments from group actions and zero-knowledge proofs for circuits based on isogenies
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Efficient zero-knowledge arguments from two-tiered homomorphic commitments
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Efficient generic zero-knowledge proofs from commitments (extended abstract)
- Zero-knowledge proofs from secure multiparty computation
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- Algebraic (trapdoor) one-way functions: constructions and applications
- HyperNova: recursive arguments for customizable constraint systems
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols
- Succinct Diophantine-satisfiability arguments
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Vector commitments over rings and compressed \(\varSigma \)-protocols
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- Zero-knowledge proofs via polynomial representations
- scientific article; zbMATH DE number 1559559 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249348)
