A new fair multi-secret sharing scheme based on asymmetric bivariate polynomial
From MaRDI portal
Publication:2088950
Recommendations
- An efficient and information theoretically secure rational secret sharing scheme based on symmetric bivariate polynomials
- Fair quantum secret sharing based on symmetric bivariate polynomial
- A secret share threshold scheme based on multivariate linear polynomial
- A new \((t,n)\) multi-secret sharing scheme based on Shamir's secret sharing
- Cheating identifiable secret sharing scheme using symmetric bivariate polynomial
- New results and applications for multi-secret sharing schemes
- scientific article; zbMATH DE number 7759464
- A new verifiable (t,n) multi-secret-sharing scheme
- A new verifiable multi-secret sharing scheme based on elliptic curves and pairings
- UNCONDITIONALLY SECURE FAIR (t-n)-SECRET SHARING SCHEME
Cites work
Cited in
(5)- Cheating identifiable secret sharing scheme using symmetric bivariate polynomial
- An information theoretically secure e-lottery scheme based on symmetric bivariate polynomials
- Fair quantum secret sharing based on symmetric bivariate polynomial
- Bivariate polynomial-based secret sharing schemes with secure secret reconstruction
- Quantum multi-secret sharing scheme with access structures and cheat identification
This page was built for publication: A new fair multi-secret sharing scheme based on asymmetric bivariate polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2088950)