Computation of the Reconstruction Probability of Secret Sharing Schemes based on the K-terminal Reliability

DOI10.1016/S1571-0653(04)00404-4zbMath1184.94259OpenAlexW2095552894MaRDI QIDQ3438991

Oda Sans, André Pönitz

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00404-4

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites Work

• How to share a secret
• An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks
• Computing the Reliability of Complex Networks
• An O(n*log(n)) algorithm to compute the all-terminal reliability of (K/sub 5/, K/sub 2.2.2/) free networks

This page was built for publication: Computation of the Reconstruction Probability of Secret Sharing Schemes based on the K-terminal Reliability