194 search results - page 6 / 39 » Computing Roundness is Easy if the Set is Almost Round |
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
EUROCRYPT
2004
Springer
14 years 27 days 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...
ASIACRYPT
2000
Springer
13 years 12 months ago
2000
Springer
In this paper, we investigate the gap between auxiliary-input zero-knowledge (AIZK) and blackbox-simulation zero-knowledge (BSZK). It is an interesting open problem whether or not ...
CRYPTO
2000
Springer
13 years 12 months ago
2000
Springer
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
SACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem...