The confidential computation protocol of matrix QR decomposition with two parties
We analyze the design method of the reference [8] who construct a the confidential computation protocol of matrix triangular decomposition with two parties, and find that it can not realized the confidential computation protocol of matrix QR decomposition with two parties. Using a new decomposition...
Saved in:
Published in | Energy procedia Vol. 13; pp. 3065 - 3071 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Ltd
2011
|
Subjects | |
Online Access | Get full text |
ISSN | 1876-6102 |
DOI | 10.1016/j.egypro.2011.11.444 |
Cover
Summary: | We analyze the design method of the reference [8] who construct a the confidential computation protocol of matrix triangular decomposition with two parties, and find that it can not realized the confidential computation protocol of matrix QR decomposition with two parties. Using a new decomposition structure, the data perturbation assumption and oblivious transfer protocol, we skillfully constructed a confidential computation protocol of matrix QR decomposition with two parties, and proved it's the correctness and confidentiality. The efficiency of this protocol is as high as the literature [8] because we don’t using the time-consuming modular exponentiation computation. |
---|---|
ISSN: | 1876-6102 |
DOI: | 10.1016/j.egypro.2011.11.444 |