57 search results - page 5 / 12 » On Multiplicative Linear Secret Sharing Schemes |
163
Voted
STOC
2000
ACM
15 years 7 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
134
Voted
TCC
2005
Springer
15 years 9 months ago
2005
Springer
Weighted threshold secret sharing was introduced by Shamir in his seminal work on secret sharing. In such settings, there is a set of users where each user is assigned a positive w...
134
click to vote
EUROCRYPT
2007
Springer
15 years 9 months ago
2007
Springer
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical ...
113
Voted
ASIACRYPT
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against a...
134
Voted
ASIACRYPT
2010
Springer
15 years 1 months ago
2010
Springer
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...