Pages that link to "Item:Q1753866"
From MaRDI portal
The following pages link to Efficient batch zero-knowledge arguments for low degree polynomials (Q1753866):
Displaying 10 items.
- Precise zero-knowledge arguments with poly-logarithmic efficiency (Q615245) (← links)
- Efficient lattice-based polynomial evaluation and batch ZK arguments (Q832321) (← links)
- High-threshold AVSS with optimal communication complexity (Q2147255) (← links)
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments (Q2697847) (← links)
- Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists (Q4924437) (← links)
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting (Q5739207) (← links)
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup (Q6132411) (← links)
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier (Q6132419) (← links)
- Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers (Q6134857) (← links)
- Concretely efficient lattice-based polynomial commitment from standard assumptions (Q6660308) (← links)
