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

Journal of Jishou University

Secure Two-Party Scientific Computations

Li Xiang

Published Jan 1, 2003• 1 citation
OpenAlex

Abstract

Dr.W.DU has studied three secure two-party scientific computation problems: Linear systems of equations problems,Linear least squares problems and Linear programming problems.And he points out:there are some other interesting scientific computation problems that need to be studied,such as secure compute eigenvalues,eigenvales,eigenvectors,determinants,conditions,and factorization of a matrix.In this paper,the authors have been studied two scientific computation problems:eigenvalues and eigenvectora of matrix in secure two-party computation situation.Some secure two-party scientific computation protocols are given.

Related papers

The Secure Multi-Party Protocol of Matrix Product and Its Application

Luo Wen

Wenliang Du has been studied some secure two-party scientific computation problems [4] : Linear systems of equations problems, Linear least squares problems and Linear programming problems. And he point to: (1)There are some other interesting scientific computation problems that need to be studied, such as how secure compute eigenvalues of matrix. (2)Extension to the secure multi-party computation problem, and thought extension secure two-party computation protocols to the secure multi-party computation protocols is not trivial. In this paper, authors disscuss two scientific computation problems: eigenvalues of matrix in secure multi-party computation situation, and give some secure multi-party scientific computation protocols.

Chinese Journal of Computers•Jan 1, 2005•8 citations

Analysis and Improvement of a Multi-Party Protocol for Finding the Eigenvalues of Matrices

Yiqi Dai

LUO et al. presented a multi-party protocol of finding eigenvalues of matrix in a secure multi-party computation situation and studied the security of it. The authors of this paper points out that the protocol is insecure in most cases of scientific computation and technological applications. A new protocol solving the same problem and the discussion of its security are also given.

Journal of Beijing Electronic Science and Technology Institute•Jan 1, 2007•0 citations

Secure two-party protocol of inverse of matrices

Huanping Liu

Secure Multi-party Computation(SMC) about which people have got some research findings at home and abroad has been a research focus in international cryptographic community recently,and this paper proposes a new protocol for the inverse of n×n matrices by using Oblivious Transfer 1 out of p protocol in the secure two-party computation environment.The protocol can be used to solve the problem securely and more efficiently.Then gives a new protocol for secure two-party linear system of equations based on it.

Computer Engineering and Applications Journal•Jan 1, 2008•0 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

Research on the Secure Multi-Party Computation of some Linear Algebra Problems

Qiang Zheng, Shou Shan Luo, Yang Xin

Considering constant-round protocols for generating random shared values, for secure multiplication and for addition of shared values, etc are available and can be met by known techniques in all standard models of communication. Protocols are presented allowing the players to securely solve standard computational problems in linear algebra. In particular, securely, efficiently and in constant-round compute determinant of matrices product, rank of a matrix, and determine similarity between matrices. If the basic protocols (addition and multiplication, etc) are unconditionally secure, then so are our protocols. Furthermore our protocols offer more efficient solutions than previous techniques for secure linear algebra.

Applied Mechanics and Materials•Jan 1, 2010•4 citations

Secure outsourced computation of the characteristic polynomial and eigenvalues of matrix

Xing Hu, Chunming Tang

Linear algebra plays an important role in computer science, especially in cryptography. Numerous cryptographic protocols and scientific computations are based on linear algebra, which can be reduced to some core problems, such as matrix multiplication, determinant and the characteristic polynomial of a matrix. However, it is difficult to carry out these expensive computations independently for resource-limited cloud users. Outsourced computation, a service provided by cloud computing, enables a resources-constrained client to outsource his mass computing tasks to the cloud. In this paper, we use data hiding technique to design a secure and verifiable outsourcing protocol for computing the characteristic polynomial and eigenvalues of a matrix. Our protocols achieve several desired features, such as data privacy, verifiability and efficiency. Moreover, no cryptographic assumption is needed in our protocols.

Journal of Cloud Computing Advances Systems and Applications•Apr 9, 2015•26 citations
Dr.W.DU has studied three secure two-party scientific computation problems: Linear systems of equations problems,Linear least squares problems and Linear programming problems.And he points out:there are some other interesting scientific computation problems that need to be studied,such as secure compute eigenvalues,eigenvales,eigenvectors,determinants,conditions,and factorization of a matrix.In this paper,the authors have been studied two scientific computation problems:eigenvalues and eigenvectora of matrix in secure two-party computation situation.Some secure two-party scientific computation protocols are given.
Wenliang Du has been studied some secure two-party scientific computation problems [4] : Linear systems of equations problems, Linear least squares problems and Linear programming problems. And he point to: (1)There are some other interesting scientific computation problems that need to be studied, such as how secure compute eigenvalues of matrix. (2)Extension to the secure multi-party computation problem, and thought extension secure two-party computation protocols to the secure multi-party computation protocols is not trivial. In this paper, authors disscuss two scientific computation problems: eigenvalues of matrix in secure multi-party computation situation, and give some secure multi-party scientific computation protocols.
Secure Multi-party Computation(SMC) about which people have got some research findings at home and abroad has been a research focus in international cryptographic community recently,and this paper proposes a new protocol for the inverse of n×n matrices by using Oblivious Transfer 1 out of p protocol in the secure two-party computation environment.The protocol can be used to solve the problem securely and more efficiently.Then gives a new protocol for secure two-party linear system of equations based on it.
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.
Considering constant-round protocols for generating random shared values, for secure multiplication and for addition of shared values, etc are available and can be met by known techniques in all standard models of communication. Protocols are presented allowing the players to securely solve standard computational problems in linear algebra. In particular, securely, efficiently and in constant-round compute determinant of matrices product, rank of a matrix, and determine similarity between matrices. If the basic protocols (addition and multiplication, etc) are unconditionally secure, then so are our protocols. Furthermore our protocols offer more efficient solutions than previous techniques for secure linear algebra.
Linear algebra plays an important role in computer science, especially in cryptography. Numerous cryptographic protocols and scientific computations are based on linear algebra, which can be reduced to some core problems, such as matrix multiplication, determinant and the characteristic polynomial of a matrix. However, it is difficult to carry out these expensive computations independently for resource-limited cloud users. Outsourced computation, a service provided by cloud computing, enables a resources-constrained client to outsource his mass computing tasks to the cloud. In this paper, we use data hiding technique to design a secure and verifiable outsourcing protocol for computing the characteristic polynomial and eigenvalues of a matrix. Our protocols achieve several desired features, such as data privacy, verifiability and efficiency. Moreover, no cryptographic assumption is needed in our protocols.