Randomness in distribution protocols

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

zbMATH Keywords

secret sharing schemessecure key distribution schemes

Mathematics Subject Classification ID

Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Randomness in distribution protocols
• Randomness in Private Computations
• scientific article; zbMATH DE number 1088901
• On the dealer's randomness required in secret sharing schemes
• Randomness versus fault-tolerance

Cited in

(13)

• scientific article; zbMATH DE number 1857650 (Why is no real title available?)
• Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets
• On secret sharing schemes
• Randomised Broadcasting: Memory vs. Randomness
• High entropy random selection protocols
• Pseudorandomness for network algorithms
• Weighted decomposition construction for perfect secret sharing schemes
• Randomness in secret sharing and visual cryptography schemes
• On derandomizing Yao's weak-to-strong OWF construction
• Probability of shares in secret sharing schemes
• On the dealer's randomness required in perfect secret sharing schemes with access structures of constant rank
• A ramp model for distributed key distribution schemes
• Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures

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)