26 search results - page 4 / 6 » Efficient Two Party and Multi Party Computation Against Cove... |
EUROCRYPT
2004
Springer
15 years 2 months ago
2004
Springer
Given two or more parties possessing large, confidential datasets, we consider the problem of securely computing the kth -ranked element of the union of the datasets, e.g. the med...
95
Voted
INDOCRYPT
2003
Springer
15 years 2 months ago
2003
Springer
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
90
Voted
ACNS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This paper examines secure two-party computation of functions which depend only on the Hamming distance of the inputs of the two parties. We present efficient protocols f...
ICDCS
2010
IEEE
15 years 1 months ago
2010
IEEE
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...