80 search results - page 3 / 16 » General Secure Multi-party Computation from any Linear Secre... |
FOCS
2007
IEEE
13 years 11 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 ...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Naor and Pinkas introduced metering schemes at Eurocrypt ’98 in order to decide on advertisement fees for web servers. In the schemes, any server should be able to cons...
ASIACRYPT
2005
Springer
13 years 11 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...
FOCS
2006
IEEE
13 years 11 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...