A new verifiable multi-secret sharing scheme based on elliptic curves and pairings
From MaRDI portal
Publication:5228734
Recommendations
- An efficient threshold verifiable multi-secret sharing scheme using generalized Jacobian of elliptic curves
- A new verifiable \((t,n)\) multi-secret-sharing scheme
- New schemes for sharing points on an elliptic curve
- A verifiable threshold multi-secret sharing scheme
- New efficient and practical verifiable multi-secret sharing schemes
Cited in
(10)- A new fair multi-secret sharing scheme based on asymmetric bivariate polynomial
- scientific article; zbMATH DE number 5116699 (Why is no real title available?)
- scientific article; zbMATH DE number 5621976 (Why is no real title available?)
- New results and applications for multi-secret sharing schemes
- scientific article; zbMATH DE number 5811700 (Why is no real title available?)
- An efficient threshold verifiable multi-secret sharing scheme using generalized Jacobian of elliptic curves
- A new verifiable \((t,n)\) multi-secret-sharing scheme
- New schemes for sharing points on an elliptic curve
- Attacks to some verifiable multi-secret sharing schemes and two improved schemes
- Conjunctive hierarchical multi-secret sharing scheme using elliptic curves
This page was built for publication: A new verifiable multi-secret sharing scheme based on elliptic curves and pairings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5228734)