225 search results - page 40 / 45 » Nonperfect Secret Sharing Schemes |
EUROCRYPT
2007
Springer
14 years 1 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 ...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
IACR
2011
12 years 7 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
ASIACRYPT
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
NDSS
2003
IEEE
14 years 19 days ago
2003
IEEE
We study proactive two-party signature schemes in the context of user authentication. A proactive two-party signature scheme (P2SS) allows two parties—the client and the server...