作者: Gagan Aggarwal , Nina Mishra , Benny Pinkas
DOI: 10.1007/978-3-540-24676-3_3
关键词:
摘要: Given two or more parties possessing large, confidential datasets, we consider the problem of securely computing k th -ranked element union e.g. median values in datasets. We investigate protocols with sublinear computation and communication costs. In two-party case, show that can be computed log rounds, where costs each round are O(log M), M is number bits needed to describe input data. The protocol made secure against a malicious adversary, hide sizes original multi-party setting, O(s M) overhead per round, s parties. used case also adversary.