686 search results - page 10 / 138 » Secure Two-Party Computation Is Practical |
CCS
2011
ACM
12 years 9 months ago
2011
ACM
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
ICDE
2009
IEEE
14 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...
EUROCRYPT
2009
Springer
14 years 10 months ago
2009
Springer
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
CIS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. In the m-out-of-n oblivious transfer model, Alice has n messages, Bob has m choices. After the interaction between the two parties, Bob can get m but only m messages from...
AC
1998
Springer
14 years 2 months ago
1998
Springer
Abstract. In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of qua...