Unconditionally secure proactive secret sharing scheme with combinatorial structures
From MaRDI portal
Recommendations
- Selected Areas in Cryptography
- Unconditionally-secure robust secret sharing with compact shares
- On proactive verifiable secret sharing schemes
- Provably secure proactive secret sharing without the adjacent assumption
- UNCONDITIONALLY SECURE FAIR (t-n)-SECRET SHARING SCHEME
- Verifiable secret redistribution for proactive secret sharing schemes
- Secure publicly verifiable and proactive secret sharing schemes with general access structure
- A new proactive secret sharing scheme
- A rational secret sharing protocol with unconditional security in the synchronous setting
Cited in
(12)- Verifiable secret sharing based on hyperplane geometry with its applications to optimal resilient proactive cryptosystems
- An information theoretically secure e-lottery scheme based on symmetric bivariate polynomials
- Dynamic threshold secret reconstruction and its application to the threshold cryptography
- Long term confidentiality: a survey
- Properties and constraints of cheating-immune secret sharing schemes
- Unconditionally secure revocable storage: tight bounds, optimal construction, and robustness
- On proactive verifiable secret sharing schemes
- An efficient publicly verifiable and proactive secret sharing scheme
- UNCONDITIONALLY SECURE FAIR (t-n)-SECRET SHARING SCHEME
- VSS Made Simpler
- Practical robust DKG protocols for CSIDH
- Verifiable secret redistribution for proactive secret sharing schemes
This page was built for publication: Unconditionally secure proactive secret sharing scheme with combinatorial structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4949337)
