4 search results - page 1 / 1 » On the Cost of Reconstructing a Secret, or VSS with Optimal ... |
CRYPTO
2001
Springer
14 years 1 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
CRYPTO
2009
Springer
14 years 13 days ago
2009
Springer
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...
CRYPTO
2009
Springer
14 years 3 months ago
2009
Springer
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...