SSS
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Given a public-key infrastructure (PKI) and digital signatures, it is possible to construct broadcast protocols tolerating any number of corrupted parties. Almost all exi...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In secure multi-party computation n parties jointly evaluate an n-variate function f in the presence of an adversary which can corrupt up till t parties. All honest parties are req...
PKC
2010
Springer
13 years 8 months ago
2010
Springer
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
CRYPTO
2005
Springer
13 years 10 months ago
2005
Springer
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
TCC
2009
Springer
14 years 5 months ago
2009
Springer
We provide a simple protocol for secret reconstruction in any threshold secret sharing scheme, and prove that it is fair when executed with many rational parties together with a s...