Pages that link to "Item:Q2697847"
From MaRDI portal
The following pages link to Dory: efficient, transparent arguments for generalised inner products and polynomial commitments (Q2697847):
Displaying 24 items.
- Practical non-interactive publicly verifiable secret sharing with thousands of parties (Q2170010) (← links)
- Practical dynamic group signatures without knowledge extractors (Q2692957) (← links)
- Efficient transparent polynomial commitments for zk-SNARKs (Q6558604) (← links)
- Sigma protocols from verifiable secret sharing and their applications (Q6562568) (← links)
- Predicate aggregate signatures and applications (Q6562570) (← links)
- Distributed-prover interactive proofs (Q6581784) (← links)
- From polynomial IOP and commitments to non-malleable zkSNARKs (Q6582227) (← links)
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency (Q6595849) (← links)
- Vector commitments with proofs of smallness: short range proofs and more (Q6635763) (← links)
- Succinct verification of compressed sigma protocols in the updatable SRS setting (Q6635775) (← links)
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin} (Q6636508) (← links)
- Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments (Q6637547) (← links)
- \textsf{Jolt}: SNARKs for virtual machines via lookups (Q6637560) (← links)
- Constant-size zk-SNARKs in ROM from falsifiable assumptions (Q6637561) (← links)
- Unlocking the lookup singularity with \textsf{Lasso} (Q6637567) (← links)
- SLAP: succinct lattice-based polynomial commitments from standard assumptions (Q6637716) (← links)
- \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments (Q6639502) (← links)
- Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation (Q6648200) (← links)
- On cycles of pairing-friendly abelian varieties (Q6653047) (← links)
- Polymath: Groth16 is not the limit (Q6660297) (← links)
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup (Q6660298) (← links)
- Greyhound: fast polynomial commitments from lattices (Q6660299) (← links)
- Concretely efficient lattice-based polynomial commitment from standard assumptions (Q6660308) (← links)
- How to prove statements obliviously? (Q6660309) (← links)
