Pages that link to "Item:Q4924437"
From MaRDI portal
The following pages link to Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists (Q4924437):
Displaying 15 items.
- Lattice-based zero-knowledge arguments for additive and multiplicative relations (Q831178) (← links)
- Efficient lattice-based polynomial evaluation and batch ZK arguments (Q832321) (← links)
- Attribute-based versions of Schnorr and ElGamal (Q2634583) (← links)
- Succinct Diophantine-satisfiability arguments (Q2691605) (← links)
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness (Q2695641) (← links)
- Non-Interactive Zero-Knowledge Proofs of Non-Membership (Q2790035) (← links)
- New Techniques for Non-interactive Shuffle and Range Arguments (Q2822687) (← links)
- (Q4941882) (← links)
- Scalable Multi-party Private Set-Intersection (Q5738787) (← 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)
- Proofs for inner pairing products and applications (Q6157545) (← links)
- Lattice-based inner product argument (Q6160829) (← links)
- Lattice-Based Proof of a Shuffle (Q6166544) (← links)
- \textsf{ZKAttest}: ring and group signatures for existing ECDSA keys (Q6618583) (← links)
