Secure Determining of the k-th Greatest Element Among Distributed Private Values

2021 26th International Computer Conference, Computer Society of Iran (CSICC)(2021)

引用 0|浏览0
暂无评分
摘要
One of the basic operations over distributed data is to find the k-th greatest value among union of these numerical data. The challenge arises when the datasets are private and their owners cannot trust any third party. In this paper, we propose a new secure protocol to find the k-th greatest value by means of secure summation sub-protocol. We compare our proposed protocol with other similar proto...
更多
查看译文
关键词
Protocols,Computational modeling,Distributed databases,Computational efficiency,Complexity theory,Computer security
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要