Secret Sharing and Secure Computation
0/90 solved1 / 90
Each question is graded on a single answer: a check that this chapter's methods work, not a test of the reasoning behind them.
In a -threshold scheme with and , what is the smallest number of shares that suffices to reconstruct the secret?
Your answer
info-secret-9All Information Theory chaptersAbout these 90 questions
Splitting a secret so that any t shares reveal it and any t−1 reveal nothing, and computing on data nobody is allowed to see. This set covers the chapter Secret Sharing and Secure Computation in Information Theory: 31 easy, 38 medium and 21 hard questions, each graded instantly with a hint and a full step-by-step solution. Progress is saved in this browser only.
- Threshold Secret Sharing — 12 questions
- Shamir's Polynomial Scheme — 14 questions
- Share Size, Verifiability, and Extensions — 12 questions
- The Secure Multiparty Computation Problem — 12 questions
- Yao's Garbled Circuits for Two Parties — 12 questions
- Information-Theoretic MPC with Secret Sharing (BGW) — 14 questions
- Security Models and Feasibility — 14 questions