Randomness in distribution protocols
From MaRDI portal
Publication:675065
DOI10.1006/INCO.1996.0095zbMATH Open0872.68040OpenAlexW1980448894MaRDI QIDQ675065FDOQ675065
Authors: Carlo Blundo, Alfredo De Santis, Ugo Vaccaro
Publication date: 13 October 1997
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1996.0095
Recommendations
Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (13)
- Weighted decomposition construction for perfect secret sharing schemes
- ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK
- Randomness in secret sharing and visual cryptography schemes
- Title not available (Why is that?)
- On secret sharing schemes
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
- Probability of shares in secret sharing schemes
- High entropy random selection protocols
- A ramp model for distributed key distribution schemes
- Randomised Broadcasting: Memory vs. Randomness
- Pseudorandomness for network algorithms
- On derandomizing Yao's weak-to-strong OWF construction
- Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets
This page was built for publication: Randomness in distribution protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675065)