Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty

DOI10.1007/978-3-540-30186-8_30zbMath1110.68333OpenAlexW2107272282MaRDI QIDQ5464207

Goran Konjevod, Rida A. Bazzi

Publication date: 17 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-30186-8_30

zbMATH Keywords

secret sharingsecure storageByzantine failures

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

This page was built for publication: Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty