Bivariate proximity test-based asynchronous verifiable secret sharing
From MaRDI portal
Cites work
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
- Asynchronous computational VSS with reduced communication complexity
- Asynchronous secure computation
- Constant-Size Commitments to Polynomials and Their Applications
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast Reed-Solomon interactive oracle proofs of proximity
- High-threshold AVSS with optimal communication complexity
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to share a secret
- scientific article; zbMATH DE number 7650353 (Why is no real title available?)
- Interactive oracle proofs
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Proximity gaps for Reed-Solomon codes
- Verifiable secret sharing from symmetric key cryptography with improved optimistic complexity
This page was built for publication: Bivariate proximity test-based asynchronous verifiable secret sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6877578)
