Secure Multi-Party Computation Protocol for Sorting Problem

李顺东 1; 张选平 2

您当前的位置：

首页 >

文章列表页 >

Secure Multi-Party Computation Protocol for Sorting Problem

更新时间：2025-12-08

- Secure Multi-Party Computation Protocol for Sorting Problem
- Vol. 42, Issue 2, Pages: 231-233+255(2008)
- 作者机构：
  
  陕西师范大学计算机科学学院,西安,710062
- 作者简介：
- 基金信息：
- DOI：
  CLC： TN918.2
- Online First：10 February 2008，
  
  Published：2008
- 稿件说明：
移动端阅览
李顺东 1, 张选平 2. Secure Multi-Party Computation Protocol for Sorting Problem[J]. 2008, 42(2): 231-233+255.
DOI：

李顺东 1, 张选平 2. Secure Multi-Party Computation Protocol for Sorting Problem[J]. 2008, 42(2): 231-233+255. DOI：

摘要

为了解决多方参与的保密排序问题

提出了基于保密排序的隐私保护解决方案.该方案首先假设多方保密计算的参与者为半诚实的

即参与者在协议执行过程中将忠实地执行协议

但可能保留计算的中间结果

以试图推导出其他参与者的输入

然后给定参与者与数据的对应集合关系

并利用离散对数方法计算数据数组以获取其置换结果

从而使得参与者知道且只知道自己的数据在置换后的数组中的位置.模拟范例证明了所提方案具有一定保密性

且特别适用于解决计算机网络中的隐私保护问题.

Abstract

In order to solve multi-party participating secure sort problem

schemes based on privacy-preserving are proposed

in which that all participants of a secure computation are semi-honest is first assumed

i.e. each participant will execute the protocol loyally

but he(or she)keeps a record of all his(her)intermediate computing results and might try to derive other participant's private inputs from the record. Afterwards

given a corresponding collective relation between participants and their data

and using the discrete logarithm method the array is calculated to obtain permutation result

such that a participant knows and only knows the position of his and her data in the permutation array. It is proved

by simulation paradigm

that the proposed schemes are secure

and particularly suitable for solving privacy preserving problems in network.

关键词

Keywords

references

YAO A C. Protocols for secure computations [C]∥Proceedings of the 23th IEEE Symposium on Foundations of Computer Science. Los Alamitos,USA: IEEE Computer Society Press, 1982:160-164.

GOLDWASSER S. Multi-party computations: past and present [C]∥Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing. New York: ACM Press, 1997:21-24.

CRAMER R, DAMGAARDL I. Introduction to secure multi-party computations [EB/OL]. [2005-12-10]. http:∥homepages.cwi.nl∧～cramer/.

GOLDREICH O, MICALI S, WIGDERSON A. How to play ANY mental game [C]∥Proceedings of the 19th Annual ACM Conference on Theory of Computing. New York: ACM Press, 1987:218-229.

GOLDREICH O. Foundations of cryptography: basic applications [M]. London: Cambridge University Press, 2004.

DU Wenliang, ATALLAH M J. Secure multi-party computation problems and their applications: a review and open problems [C]∥Proceedings of New Security Paradigms Workshop. New York: ACM Press, 2001:13-22.

SUSILO W, SAFAVI R, GYSIN M, et al. A new and efficient fail-stop signature scheme [J]. The Computer Journal, 2000, 43(5):430-437.

SCHNEIER B. Applied cryptography, protocol, algorithm and source code in C [M]. New York: John Wiley Sons Inc., 1996.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Fast Calculation Method for Thermal Flow Fields in Transformer Windings Based on PI-DeepONet

A Structure-Semantics-Residual Collaborative Image Compression Framework：Towards Privacy Protection and High-Fidelity Reconstruction

Numerical Simulation of Heat-Moisture Barrier Performance of a Horizontal Air Curtain in Cold Storage

Electrothermal Coupling Research on the Evolutionary Law of Anti-Corona Performance for High-Altitude Air-Cooled Generators

Study on the Thermodynamic Properties in the Anomalous Region of Supercritical Water

Related Author

No data

Related Institution

No data

⁰