Verifiable Secret Sharing - Round-Optimal and Efficient Verifiable Secret Sharing

Round-Optimal and Efficient Verifiable Secret Sharing

The round complexity of a VSS protocol is defined as the number of communication rounds in its sharing phase; reconstruction can always be done in a single round. There is no 1-round VSS with t > 1, regardless of the number of players. The bounds on perfect and efficient VSS protocols is given below.

Number of rounds Security
1 t = 1, n > 4
2 n > 4t
3 n > 3t

Read more about this topic:  Verifiable Secret Sharing

Famous quotes containing the words efficient, verifiable, secret and/or sharing:

    I make no secret of the fact that I would rather lie on a sofa than sweep beneath it. But you have to be efficient if you’re going to be lazy.
    Shirley Conran (b. 1932)

    The entire construct of the “medical model” of “mental illness”Mwhat is it but an analogy? Between physical medicine and psychiatry: the mind is said to be subject to disease in the same manner as the body. But whereas in physical medicine there are verifiable physiological proofs—in damaged or affected tissue, bacteria, inflammation, cellular irregularity—in mental illness alleged socially unacceptable behavior is taken as a symptom, even as proof, of pathology.
    Kate Millett (b. 1934)

    But whenever you pray, go into your room and shut the door and pray to your Father who is in secret; and your Father who sees in secret will reward you.
    Bible: New Testament, Matthew 6:6.

    Jesus.

    The cup of blessing that we bless, is it not a sharing in the blood of Christ? The bread that we break, is it not a sharing in the body of Christ?
    Bible: New Testament, 1 Corinthians 10:16.