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...

Full description

Saved in:
Bibliographic Details
Published inEnergy procedia Vol. 13; pp. 3065 - 3071
Main Authors Liu, Zhen, Pan, Feng, Yang, Xiao-Yuan
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 2011
Subjects
data perturbation assumption
matrix decomposition
oblivious transfer protocol
QR decomposition
secure multi-party computation
matrix decomposition
data perturbation assumption
oblivious transfer protocol
secure multi-party computation
QR decomposition
Online AccessGet full text
ISSN1876-6102
DOI10.1016/j.egypro.2011.11.444

Cover

Abstract 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.
AbstractList 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.
Author Pan, Feng
Yang, Xiao-Yuan
Liu, Zhen
Author_xml – sequence: 1
  givenname: Zhen
  surname: Liu
  fullname: Liu, Zhen
  email: lliuzheng@163.com
– sequence: 2
  givenname: Feng
  surname: Pan
  fullname: Pan, Feng
– sequence: 3
  givenname: Xiao-Yuan
  surname: Yang
  fullname: Yang, Xiao-Yuan
BookMark eNotUNtKAzEUzEMF2-of-JAf2DXZZLPriyDFS6Eglfoc0uTEZtkmyyZa_XuzVhg4Z2CYGWaBZj54QOiGkpISKm67Ej5-hjGUFaG0zOCcz9Ccto0oBCXVJVrE2BHSENLyOdruDoB18NYZ8MmpPpPj8JlUcsHj7JOCDj0OFh9VGt033r5hA5MmRPenObl0wOkU8KDG5CBeoQur-gjX_3eJ3p8ed6uXYvP6vF49bArIPXnBRaVUAzXVFpraCGa0JVzomprcuBKWGMUsZEaMsbYWd3vW5lcz1nCx52yJ7s--kEO-HIwyagdeg3Ej6CRNcJISOY0iO3keRU6jyIwcwX4BVVxeFw
ContentType Journal Article
Copyright 2012
Copyright_xml – notice: 2012
DBID 6I.
AAFTH
DOI 10.1016/j.egypro.2011.11.444
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Economics
Engineering
EndPage 3071
ExternalDocumentID S1876610211032607
GroupedDBID --K
0R~
1B1
1~5
4.4
457
4G.
5VS
6I.
7-5
71M
AAEDT
AAEDW
AAFTH
AAFWJ
AAIKJ
AALRI
AAQFI
AAXUO
AAYWO
ABMAC
ABWVN
ACGFS
ACRPL
ADBBV
ADEZE
ADMUD
ADNMO
ADVLN
AEXQZ
AFTJW
AGHFR
AGUBO
AITUG
AKRWK
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
E3Z
EBS
EJD
EP2
EP3
FDB
FEDTE
FIRID
FNPLU
HVGLF
HZ~
IXB
KQ8
M41
O-L
O9-
OK1
OKI
OZT
RIG
ROL
SES
SSZ
TR2
XH2
~S-
ID FETCH-LOGICAL-e1014-462aa7e51cfe75d63dcf046c51d44426f0da3fe1d40ddff569b380ddc33746b43
IEDL.DBID IXB
ISSN 1876-6102
IngestDate Tue May 20 10:00:22 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Keywords matrix decomposition
data perturbation assumption
oblivious transfer protocol
secure multi-party computation
QR decomposition
Language English
License http://creativecommons.org/licenses/by-nc-nd/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-e1014-462aa7e51cfe75d63dcf046c51d44426f0da3fe1d40ddff569b380ddc33746b43
OpenAccessLink https://www.sciencedirect.com/science/article/pii/S1876610211032607
PageCount 7
ParticipantIDs elsevier_sciencedirect_doi_10_1016_j_egypro_2011_11_444
PublicationCentury 2000
PublicationDate 2011
PublicationDateYYYYMMDD 2011-01-01
PublicationDate_xml – year: 2011
  text: 2011
PublicationDecade 2010
PublicationTitle Energy procedia
PublicationYear 2011
Publisher Elsevier Ltd
Publisher_xml – name: Elsevier Ltd
References Qin Jing, Zhang Zhenfeng, Feng Dengguo, Li (bib0015) 2004; 25
Du, Wenliang (bib0020) 2000
Luo Wen-jun, Li Xiang (bib0025) 2003; 24
Jia Heng-yue, Liu (bib0035) 2008; 44
XiaoYuan Yang, Zhen Liu.The security Matrix factorization agreement with two parties[C]. In:Proceedings of the 2009 International Conference on Computational Intelligence and Security,IEEE Press.USA, 2009.
Zhong Xu, Kai Yuan Zhang (bib0045) 2005
Golderich, Micali, Wigderson (bib0010) 1987
Luo Wen-jun, Li Xiang (bib0030) 2005; 28
Yao (bib0005) 1982
References_xml – start-page: 160
  year: 1982
  end-page: 164
  ident: bib0005
  article-title: Protocols for secure computations[C]
  publication-title: In: Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, Los Angeles:
– volume: 44
  start-page: 112
  year: 2008
  end-page: 114
  ident: bib0035
  article-title: Secure two-party computation protocol about Matrix inversion [J]
  publication-title: Computer Engineering and Applications
– volume: 25
  start-page: pp.35
  year: 2004
  end-page: pp.42
  ident: bib0015
  article-title: A special secure computation agreement with two parties[J]
  publication-title: Journal on Communications
– year: 2005
  ident: bib0045
  article-title: The concise Guide of Matrix theory (The second version)
– start-page: 218
  year: 1987
  end-page: 229
  ident: bib0010
  article-title: How to play any mental game[C]
  publication-title: In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York:
– volume: 28
  start-page: 1230
  year: 2005
  end-page: 1235
  ident: bib0030
  article-title: Multi-party secure matrix multiplication protocol and applications[J]
  publication-title: Chinese Journal of Computers
– year: 2000
  ident: bib0020
  article-title: A study of several specific secure two-party computation problems [D]
– volume: 24
  start-page: 31
  year: 2003
  end-page: 34
  ident: bib0025
  article-title: Secure two-party confident computation about the eigenvalue of matrix[J]
  publication-title: Journal of Jishou University
– reference: XiaoYuan Yang, Zhen Liu.The security Matrix factorization agreement with two parties[C]. In:Proceedings of the 2009 International Conference on Computational Intelligence and Security,IEEE Press.USA, 2009.
SSID ssj0070084
Score 1.8639411
Snippet We analyze the design method of the reference [8] who construct a the confidential computation protocol of matrix triangular decomposition with two parties,...
SourceID elsevier
SourceType Publisher
StartPage 3065
SubjectTerms data perturbation assumption
matrix decomposition
oblivious transfer protocol
QR decomposition
secure multi-party computation
Title The confidential computation protocol of matrix QR decomposition with two parties
URI https://dx.doi.org/10.1016/j.egypro.2011.11.444
Volume 13
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB5KL-pBtCq-2YPXpU13s2mOWizFg1C10FvY7AMqmJQ2RX--M5sE4lXYQx6zYXeGzO4s830D8CBUaoVPFU9zY7mUqeS5UZobabWexOgQ6yzfVzVfypdVvOrBtMXCUFpl4_trnx68dfNk2GhzuFmvh-8R_siKKlMTJ5wKiHJClRKIb_XUeuOECOMp6EJhTtItfC7keFGpr21ZE3lik1J21qTOOjM7geNmg8ge6zGcQs8VAzho8cO7ARx1KATPYIF2ZvjSrwPiFnuaUKchKJwRC0OJpmalZ19Exv_DFm_MOpJpsrUYncSy6rtkG5q3253Dcvb8MZ3zpkwCd1Rol0s11jpxcWS8S2KrhDUeo14TRxYnNFZ-ZLXwDu9G1nofqzQXE7w0QiRS5VJcQL8oC3cJTBiMv0yU4odx2ddjnevIEs7DoOHQbFeQtNrJ_lgpQwectQljn1mt14z0iiFGhsO4_nfPGzisz3Gp3UK_2u7dHW4Eqvw-WPoXp8mzDw
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEB5KPVQPolXxbQ5eQ7tNNts9arG0WgvVFnpbsnlABbulrejPd2YfUK9CDvuYLMkMO48w8w3AvVCxFT5WPE6N5VLGkqdGaW6k1bobokIssnzHajCTz_NwXoNeVQtDaZWl7i90eq6tyyetkput1WLReg_wR1bUmZow4RRVlO-hN6AIQH84f6zUcUSI8RR1ITUn8qp-Lk_yol5f66xA8sQhpdwxSjuGpn8Eh6WHyB6KRRxDzS2b0KgKiDdNONjBEDyBCQqa4Uu_yEtucabJGzXkHGcEw5ChrFnm2Seh8f-wyRuzjmjKdC1GR7Fs-52xFW3cbU5h1n-a9ga87JPAHXXa5VJ1tI5cGBjvotAqYY3HsNeEgcUNdZRvWy28w7u2td6HKk5FFy-NEJFUqRRnUF9mS3cOTBgMwEwQ44fR7uuOTnVgqdDDoORQbhcQVdxJ_ogpQQ2cVBljH0nB14T4ijFGgsu4_PfMO2gMpq-jZDQcv1zBfnGoS-Ma6tv1l7tBr2Cb3uZS_wXFWrYz
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+confidential+computation+protocol+of+matrix+QR+decomposition+with+two+parties&rft.jtitle=Energy+procedia&rft.au=Liu%2C+Zhen&rft.au=Pan%2C+Feng&rft.au=Yang%2C+Xiao-Yuan&rft.date=2011&rft.pub=Elsevier+Ltd&rft.issn=1876-6102&rft.volume=13&rft.spage=3065&rft.epage=3071&rft_id=info:doi/10.1016%2Fj.egypro.2011.11.444&rft.externalDocID=S1876610211032607
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1876-6102&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1876-6102&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1876-6102&client=summon