18 search results - page 2 / 4 » The Round Complexity of Verifiable Secret Sharing Revisited |
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
PKC
2007
Springer
14 years 1 months ago
2007
Springer
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
CISC
2007
Springer
13 years 11 months ago
2007
Springer
A multi-secret sharing scheme allows several secrets to be shared amongst a group of participants. In 2005, Shao and Cao developed a verifiable multi-secret sharing scheme where e...
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
ASIACRYPT
2008
Springer
13 years 9 months ago
2008
Springer
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...