860 search results - page 9 / 172 » Completeness in two-party secure computation: a computationa... |
CRYPTO
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of com...
NOSSDAV
2009
Springer
15 years 2 months ago
2009
Springer
For scalability of business, multiparty multilevel digital rights management (DRM) architecture, where a multimedia content is delivered by an owner to a consumer through several ...
CCS
2008
ACM
14 years 11 months ago
2008
ACM
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptograp...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
168
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract-- In this paper, we propose secure protocols to perform Singular Value Decomposition (SVD) for two parties over horizontally and vertically partitioned data. We propose va...