380 search results - page 60 / 76 » Intrusion-Resilient Secret Sharing |
IACR
2011
13 years 9 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...
ACNS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We examine the use of randomness extraction and expansion in key agreement (KA) protocols to generate uniformly random keys in the standard model. Although existing works...
ISW
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Applications typically rely on the operating system to enforce access control policies such as MAC, DAC, or other policies. However, in the face of a compromised operatin...
EUROCRYPT
2007
Springer
15 years 4 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
15 years 4 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...