Secret sharing with binary shares
From MaRDI portal
Recommendations
Cites work
- Affine extractors over prime fields
- An explication of secret sharing schemes
- Approximate bounded indistinguishability
- Bounded indistinguishability and the complexity of recovering secrets
- Bounds on the Threshold Gap in Secret Sharing and its Applications
- Broadcast channels with confidential messages
- Extracting all the randomness and reducing the error in Trevisan's extractors
- Extractors and pseudorandom generators
- How to share a secret
- scientific article; zbMATH DE number 1023999 (Why is no real title available?)
- Invertible Extractors and Wiretap Protocols
- List decoding from erasures: bounds and code constructions
- Near-optimal secret sharing and error correcting codes in \(\mathsf{AC}^0\)
- On the construction of affine extractors
- Optimal rate code constructions for computationally simple channels
- Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes
- Secure multiparty computation and secret sharing
- Semantic security for the wiretap channel
- The Wire-Tap Channel
- Threshold Secret Sharing Requires a Linear Size Alphabet
- Wire-Tap Channel II
Cited in
(9)- Secret sharing and duality
- Secret-shared shuffle
- Cryptography from one-way communication: on completeness of finite channels
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Short leakage resilient and non-malleable secret sharing schemes
- Full threshold change range of threshold changeable secret sharing
- Secret Sharing with Binary Shares
- A lower bound on the share size of leakage-resilient secret-sharing schemes
- Stochastic secret sharing with 1-bit shares and applications to MPC
This page was built for publication: Secret sharing with binary shares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090431)
