Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations

Özgür Dagdelen, Daniele Venturi

Published Jan 1, 2015• 11 citations
Publisher
DOI
10.1007/978-3-319-21356-9_11

Related papers

Privacy-preserving large-scale systems of linear equations in outsourcing storage and computation

Dongmei Li, Xiaolei Dong, Zhenfu Cao +1 more

Science China Information Sciences•Feb 2, 2018•7 citations

Privacy for multi-party protocols

Takashi Satoh, Kaoru Kurosawa, Shigeo Tsujii

Lecture notes in computer science•Jan 1, 1993•0 citations

Privacy-Preserving Cooperative Linear System of Equations Protocol and its Application

Xuan Yang, Zhaoping Yu, Bin Kang

Privacy-preserving cooperative linear system of equations problem is an important scientific computation and widely used in many areas such as banking, manufacturing, and telecommunications. In this paper, we present a new privacy- preserving cooperative linear system of equations protocol under the semi-honest mode, which is more efficient as compared with existing schemes. The security of the newly devised protocol is also examined. Privacy-preserving cooperative linear system of equations protocol can be used to solve many privacy preserving scientific computation problems. As an example, a secure privacy-preserving polynomial interpolation protocol is developed based on the newly devised privacy-preserving cooperative linear system of equations protocol.

International Conference on Wireless Communications, Networking and Mobile Computing•Oct 1, 2008•3 citations

Privacy-preserving quantum multi-party computation based on circular structure

Zhiliang Deng, Ying Zhang, Xiaorui Zhang +1 more

Journal of Information Security and Applications•May 9, 2019•6 citations

General Secure Multi-party Computation from any Linear Secret-Sharing Scheme

Ronald Cramer, Ivan Damgård, Ueli M. Maurer

Lecture notes in computer science•Jan 1, 2000•548 citations

A Practical Privacy-Preserving Cooperative Computation Protocol without Oblivious Transfer for Linear Systems of Equations

Ju-Sung Kang, Dowon Hong

We propose several practical SMC protocols for privacy-preserving cooperative scientific computations. We consider two important scientific computations which involve linear equations: the linear systems of equations problem and the linear least-square problem. The protocols proposed in this paper achieve acceptable security in the sense of Du-Zhan's paradigm and t-wise collusion-resistance, and their communication complexity is O(tm), where t is a security parameter and m is the total number of participants. The complexity of our protocol is significantly better than the previous result O( $m^2/{\mu}$ ) of [4], in which the oblivious transfer protocol is used as an important building block.

Journal of Information Processing Systems•Jun 30, 2007•6 citations
Privacy-preserving cooperative linear system of equations problem is an important scientific computation and widely used in many areas such as banking, manufacturing, and telecommunications. In this paper, we present a new privacy- preserving cooperative linear system of equations protocol under the semi-honest mode, which is more efficient as compared with existing schemes. The security of the newly devised protocol is also examined. Privacy-preserving cooperative linear system of equations protocol can be used to solve many privacy preserving scientific computation problems. As an example, a secure privacy-preserving polynomial interpolation protocol is developed based on the newly devised privacy-preserving cooperative linear system of equations protocol.
We propose several practical SMC protocols for privacy-preserving cooperative scientific computations. We consider two important scientific computations which involve linear equations: the linear systems of equations problem and the linear least-square problem. The protocols proposed in this paper achieve acceptable security in the sense of Du-Zhan's paradigm and t-wise collusion-resistance, and their communication complexity is O(tm), where t is a security parameter and m is the total number of participants. The complexity of our protocol is significantly better than the previous result O( m2/μm^2/{\mu}m2/μ ) of [4], in which the oblivious transfer protocol is used as an important building block.