General information dispersal algorithms

DOI10.1016/S0304-3975(97)00098-4zbMath0915.68080OpenAlexW2052375105MaRDI QIDQ1274915

Philippe Béguin, Antonella Cresti

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00098-4

zbMATH Keywords

cryptographyinformation dispersal algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• On the information rate of secret sharing schemes
• A new polynomial-time algorithm for linear programming
• On the classification of ideal secret sharing schemes
• On the size of shares for secret sharing schemes
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Decomposition constructions for secret-sharing schemes
• Optimal File Sharing in Distributed Networks
• On secret sharing systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: General information dispersal algorithms