CalcPath
Subjects
Dashboard
Diagnostic
Feedback
Search...
Secret Sharing and Secure Computation
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.
0/12 mastered
1 / 12
How many ciphertexts does a naive garbling place in the table of one two-input gate?
Review the explanation for this topic →
Your answer
Draw
Hint
Type your answer — press Enter to check
Enter your answer
( )
x
n
√
⌫
AC
7
8
9
+
4
5
6
−
1
2
3
×
0
.
a
b
Check
↵
÷
#12948
All topics
All Information Theory topics