92 search results - page 2 / 19 » Secure Two-party Protocols for Point Inclusion Problem |
83
Voted
CORR
2007
Springer
14 years 10 months ago
2007
Springer
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...
ISI
2005
Springer
15 years 3 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...
87
Voted
STOC
2010
ACM
15 years 3 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
64
Voted
CTRSA
2006
Springer
15 years 1 months ago
2006
Springer
This paper studies a new problem called fair identification: given two parties, how should they identify each other in a fair manner. More precisely, if both parties are honest the...
91
Voted
CCS
2011
ACM
13 years 10 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, ...