Pages that link to "Item:Q2820478"
From MaRDI portal
The following pages link to Essentially Optimal Robust Secret Sharing with Maximal Corruptions (Q2820478):
Displaying 10 items.
- Efficient robust secret sharing from expander graphs (Q680925) (← links)
- Nearly optimal robust secret sharing (Q1999899) (← links)
- Nearly optimal robust secret sharing against rushing adversaries (Q2102061) (← links)
- Constructing locally leakage-resilient linear secret-sharing schemes (Q2129019) (← links)
- Ramp secret sharing with cheater identification in presence of rushing cheaters (Q2178751) (← links)
- Source-location privacy full protection in wireless sensor networks (Q2195316) (← links)
- On one-round reliable message transmission (Q2414041) (← links)
- On fully-secure honest majority MPC without \(n^2\) round overhead (Q6619922) (← links)
- Constructing leakage-resilient Shamir's secret sharing: over composite order fields (Q6637528) (← links)
- Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing (Q6652971) (← links)
