Research on the Problem of Secure Multi-party Ranking Under Semi-honest Model

XIAO Qian; LUO Shou-shan; CHEN Ping; WU Bo

您当前的位置：

首页 >

文章列表页 >

Research on the Problem of Secure Multi-party Ranking Under Semi-honest Model

更新时间：2025-07-16

- Research on the Problem of Secure Multi-party Ranking Under Semi-honest Model
- Acta Electronica Sinica Vol. 36, Issue 4, Pages: 709-714(2008)
- 作者机构：
  
  1. 北京邮电大学软件学院,北京,100876
  2. 北京邮电大学电信工程学院,北京,100876
  3. 西安电子科技大学综合业务网理论及关键技术国家重点实验室,陕西,西安,710071
  4. 北京邮电大学理学院,北京,100876
  5. 北京邮电大学软件学院北京,100876
  6. 北京邮电大学电信工程学院北京,100876
  7. 西安电子科技大学综合业务网理论及关键技术国家重点实验室陕西西安,710071
  8. 北京邮电大学理学院北京,100876
- 作者简介：
- 基金信息：
- DOI：
  CLC： TN918.1
- Published Online：25 April 2008，
  
  Published：2008
- 稿件说明：
移动端阅览
XIAO Qian, LUO Shou-shan, CHEN Ping, et al. Research on the Problem of Secure Multi-party Ranking Under Semi-honest Model[J]. Acta Electronica Sinica, 2008, 36(4): 709-714.
DOI：

XIAO Qian, LUO Shou-shan, CHEN Ping, et al. Research on the Problem of Secure Multi-party Ranking Under Semi-honest Model[J]. Acta Electronica Sinica, 2008, 36(4): 709-714. DOI：

摘要

安全多方排序问题是百万富翁问题的推广问题

用于

个参与方在不泄漏各方秘密输入的前提下比较出其输入在全体输入中按照一定顺序所处的位置.本文首先提出了半诚实模型下基于同态加密的安全两方排序协议.然后将该协议推广到多方排序的情况

并提出两种提高效率的改进算法.最后本文还提出了基于模糊贴近度的安全多方排序协议

并对这几个协议的安全性和效率做了分析、比较.

Abstract

Secure multi-party ranking is a problem generalized from the millionaires’ problem

which can be used by n people to know about their secrets’ order among all their inputs without leaking further information.Through the study on millionaires’ protocol

we presented a secure two-party ranking protocol under semi-honest model based on homomorphic encryption.Then we generalized it to secure multi-party ranking

and we presented two algorithms whose efficiency are both improved.Finally

we gave a secure multi-party ranking protocol based on fuzzy nearness degree

and we analyzed the efficiency and security of these protocols.

关键词

Keywords

references

Views

2032

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Secure Computation of Subsets from Tuple Sets

Blockchain-Based Privacy-Preserving Auditable Confidential Transaction Scheme

A Two-Party SM2 Signing Protocol with Strict Provable Security

Maximum Value of Sum of Intersection Elements of Secret Calculation

Blockchain Trusted Privacy Service Computing Model for CNN

Related Author

WU Chuan-yu

YU Jia-tong

DU Ji-xin

LI Shun-dong

ZHU Lie-huang

CHEN Si-yuan

GAI Ke-ke

CHENG Yi-fan

Related Institution

School of Computer Science, Shaanxi Normal University

School of Cyberspace Science and Technology, Beijing Institute of Technology

School of Computer Science and Technology, Beijing Institute of Technology

Laboratory of Cryptography， Oxford-Hainan Blockchain Research Institute， Chengmai

SSC Holding Company Ltd.， Chengmai

⁰