71 search results - page 7 / 15 » Round-Optimal Secure Two-Party Computation |
CCS
2011
ACM
12 years 7 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, ...
GRC
2008
IEEE
13 years 8 months ago
2008
IEEE
—Secure multiparty computation is a very important research topic in cryptography. A secure multi-party computation involves N untrusful parties. It takes input xi from the ith p...
WPES
2003
ACM
14 years 24 days ago
2003
ACM
Secure Multi-Party Computation enables parties with private data to collaboratively compute a global function of their private data, without revealing that data. The increase in s...
ISI
2005
Springer
14 years 1 months ago
2005
Springer
This paper introduces a new approach to a problem of data sharing among multiple parties, without disclosing the data between the parties. Our focus is data sharing among two parti...
IACR
2011
12 years 7 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...