Probabilistic secret sharing
From MaRDI portal
Publication:5005168
DOI10.4230/LIPIcs.MFCS.2018.64OpenAlexW2888920703MaRDI QIDQ5005168
Paolo D'Arco, Unnamed Author, Roberto De Prisco, Alfredo De Santis, Ugo Vaccaro
Publication date: 4 August 2021
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9646/pdf/LIPIcs-MFCS-2018-64.pdf/
Related Items (3)
Secret sharing schemes for infinite sets of participants: a new design technique ⋮ Secret sharing and duality ⋮ Evolving ramp secret sharing with a small gap
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On-line secret sharing
- Multiple assignment scheme for sharing secret
- On the size of shares for secret sharing schemes
- Tight bounds on the information rate of secret sharing schemes
- The size of a share must be large
- Evolving secret sharing: dynamic thresholds and robustness
- Infinite secret sharing -- examples
- Visual cryptography for general access structures
- Private Visual Share-Homomorphic Computation and Randomness Reduction in Visual Cryptography
- Security of Ramp Schemes
- Secret-Sharing Schemes: A Survey
- How to share a secret
- Threshold Secret Sharing Requires a Linear Size Alphabet
- How to Share a Secret, Infinitely
- Breaking the circuit-size barrier in secret sharing
- Bounds on the Threshold Gap in Secret Sharing and its Applications
- How to Share a Secret, Infinitely
- Secure Multiparty Computation and Secret Sharing
This page was built for publication: Probabilistic secret sharing
