Privacy-preserving two-parties logistic regression on vertically partitioned data using asynchronous gradient sharing

The full application of machine learning has caused plenty of problems with privacy-preserving. Especially in multi-party machine learning, private data is often exposed in the aggregation,transmission, and communication phase, which leads to the problem of private data leakage. Existing works use s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Peer-to-peer networking and applications 2021-05, Vol.14 (3), p.1379-1387
Hauptverfasser: Wei, Qianjun, Li, Qiang, Zhou, Zhipeng, Ge, ZhengQiang, Zhang, Yonggang
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1387
container_issue 3
container_start_page 1379
container_title Peer-to-peer networking and applications
container_volume 14
creator Wei, Qianjun
Li, Qiang
Zhou, Zhipeng
Ge, ZhengQiang
Zhang, Yonggang
description The full application of machine learning has caused plenty of problems with privacy-preserving. Especially in multi-party machine learning, private data is often exposed in the aggregation,transmission, and communication phase, which leads to the problem of private data leakage. Existing works use secure multi-party computing (SMPC) or secret-sharing technology to ensure the privacy-preserving of multi-party machine learning. Nevertheless, it brings enormous cost and feasibility drawbacks. The partition method of datasets is one of the most critical factors affecting the performance of machine learning. Vertically partitioned data has the problems of incomplete feature information held by a single participant and complicated training process. Therefore, it has to be tackled urgently that how to efficiently and safely complete the multi-party training using vertically partitioned datasets. Moreover, training logistic regression models efficiently is one of the directions worth working on. In this paper, we propose a protocol using that can complete the logistic regression modeling of vertically partitioned data by asynchronous gradient sharing. At the same time, we use an efficient homomorphic encryption method to protect private data. The experiments show that our protocol can reduce the training time in the case of a small impact on the output results, and speedup can be over 10x. Meanwhile, it will ensure the security of the vertically partitioned dataset.
doi_str_mv 10.1007/s12083-020-01017-x
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2512387198</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2512387198</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-b3aa1b076e05ff5df804c51e82b7016a891038a2fc838c59bdc707fe36ff615e3</originalsourceid><addsrcrecordid>eNp9UEtLxDAQDqLguvoHPAU8RyfJtk2PsviCBT3oOaRp0u2yNjVJ1-2_N2tFb8LADPM9hvkQuqRwTQGKm0AZCE6AAQEKtCD7IzSjJc9Jvsjg-HdesFN0FsIGIKc8YzM0vPh2p_RIem-C8bu2a3D8dKRXPrYm4K1r2hBbjb1pEiO0rsOpdibBWm23I_5mxrQ3Na5VVHgIBxMVxk6vvevcEHDjVd2aLuKwVj6h5-jEqm0wFz99jt7u716Xj2T1_PC0vF0RzWkZScWVohUUuYHM2qy2AhY6o0awqgCaK1FS4EIxqwUXOiurWhdQWMNza3OaGT5HV5Nv793HYEKUGzf4Lp2ULKOMi4KWIrHYxNLeheCNlb1v35UfJQV5iFdO8coUr_yOV-6TiE-i0B8-Mv7P-h_VF6d_gZw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2512387198</pqid></control><display><type>article</type><title>Privacy-preserving two-parties logistic regression on vertically partitioned data using asynchronous gradient sharing</title><source>SpringerLink Journals - AutoHoldings</source><creator>Wei, Qianjun ; Li, Qiang ; Zhou, Zhipeng ; Ge, ZhengQiang ; Zhang, Yonggang</creator><creatorcontrib>Wei, Qianjun ; Li, Qiang ; Zhou, Zhipeng ; Ge, ZhengQiang ; Zhang, Yonggang</creatorcontrib><description>The full application of machine learning has caused plenty of problems with privacy-preserving. Especially in multi-party machine learning, private data is often exposed in the aggregation,transmission, and communication phase, which leads to the problem of private data leakage. Existing works use secure multi-party computing (SMPC) or secret-sharing technology to ensure the privacy-preserving of multi-party machine learning. Nevertheless, it brings enormous cost and feasibility drawbacks. The partition method of datasets is one of the most critical factors affecting the performance of machine learning. Vertically partitioned data has the problems of incomplete feature information held by a single participant and complicated training process. Therefore, it has to be tackled urgently that how to efficiently and safely complete the multi-party training using vertically partitioned datasets. Moreover, training logistic regression models efficiently is one of the directions worth working on. In this paper, we propose a protocol using that can complete the logistic regression modeling of vertically partitioned data by asynchronous gradient sharing. At the same time, we use an efficient homomorphic encryption method to protect private data. The experiments show that our protocol can reduce the training time in the case of a small impact on the output results, and speedup can be over 10x. Meanwhile, it will ensure the security of the vertically partitioned dataset.</description><identifier>ISSN: 1936-6442</identifier><identifier>EISSN: 1936-6450</identifier><identifier>DOI: 10.1007/s12083-020-01017-x</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Communications Engineering ; Computer Communication Networks ; Datasets ; Encryption ; Engineering ; Information Systems and Communication Service ; Machine learning ; Networks ; Privacy ; Regression models ; Signal,Image and Speech Processing ; Special Issue on Privacy-Preserving Computing ; Training</subject><ispartof>Peer-to-peer networking and applications, 2021-05, Vol.14 (3), p.1379-1387</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2020</rights><rights>Springer Science+Business Media, LLC, part of Springer Nature 2020.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-b3aa1b076e05ff5df804c51e82b7016a891038a2fc838c59bdc707fe36ff615e3</citedby><cites>FETCH-LOGICAL-c319t-b3aa1b076e05ff5df804c51e82b7016a891038a2fc838c59bdc707fe36ff615e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s12083-020-01017-x$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s12083-020-01017-x$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Wei, Qianjun</creatorcontrib><creatorcontrib>Li, Qiang</creatorcontrib><creatorcontrib>Zhou, Zhipeng</creatorcontrib><creatorcontrib>Ge, ZhengQiang</creatorcontrib><creatorcontrib>Zhang, Yonggang</creatorcontrib><title>Privacy-preserving two-parties logistic regression on vertically partitioned data using asynchronous gradient sharing</title><title>Peer-to-peer networking and applications</title><addtitle>Peer-to-Peer Netw. Appl</addtitle><description>The full application of machine learning has caused plenty of problems with privacy-preserving. Especially in multi-party machine learning, private data is often exposed in the aggregation,transmission, and communication phase, which leads to the problem of private data leakage. Existing works use secure multi-party computing (SMPC) or secret-sharing technology to ensure the privacy-preserving of multi-party machine learning. Nevertheless, it brings enormous cost and feasibility drawbacks. The partition method of datasets is one of the most critical factors affecting the performance of machine learning. Vertically partitioned data has the problems of incomplete feature information held by a single participant and complicated training process. Therefore, it has to be tackled urgently that how to efficiently and safely complete the multi-party training using vertically partitioned datasets. Moreover, training logistic regression models efficiently is one of the directions worth working on. In this paper, we propose a protocol using that can complete the logistic regression modeling of vertically partitioned data by asynchronous gradient sharing. At the same time, we use an efficient homomorphic encryption method to protect private data. The experiments show that our protocol can reduce the training time in the case of a small impact on the output results, and speedup can be over 10x. Meanwhile, it will ensure the security of the vertically partitioned dataset.</description><subject>Communications Engineering</subject><subject>Computer Communication Networks</subject><subject>Datasets</subject><subject>Encryption</subject><subject>Engineering</subject><subject>Information Systems and Communication Service</subject><subject>Machine learning</subject><subject>Networks</subject><subject>Privacy</subject><subject>Regression models</subject><subject>Signal,Image and Speech Processing</subject><subject>Special Issue on Privacy-Preserving Computing</subject><subject>Training</subject><issn>1936-6442</issn><issn>1936-6450</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNp9UEtLxDAQDqLguvoHPAU8RyfJtk2PsviCBT3oOaRp0u2yNjVJ1-2_N2tFb8LADPM9hvkQuqRwTQGKm0AZCE6AAQEKtCD7IzSjJc9Jvsjg-HdesFN0FsIGIKc8YzM0vPh2p_RIem-C8bu2a3D8dKRXPrYm4K1r2hBbjb1pEiO0rsOpdibBWm23I_5mxrQ3Na5VVHgIBxMVxk6vvevcEHDjVd2aLuKwVj6h5-jEqm0wFz99jt7u716Xj2T1_PC0vF0RzWkZScWVohUUuYHM2qy2AhY6o0awqgCaK1FS4EIxqwUXOiurWhdQWMNza3OaGT5HV5Nv793HYEKUGzf4Lp2ULKOMi4KWIrHYxNLeheCNlb1v35UfJQV5iFdO8coUr_yOV-6TiE-i0B8-Mv7P-h_VF6d_gZw</recordid><startdate>20210501</startdate><enddate>20210501</enddate><creator>Wei, Qianjun</creator><creator>Li, Qiang</creator><creator>Zhou, Zhipeng</creator><creator>Ge, ZhengQiang</creator><creator>Zhang, Yonggang</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8G5</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>M2O</scope><scope>M2P</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>20210501</creationdate><title>Privacy-preserving two-parties logistic regression on vertically partitioned data using asynchronous gradient sharing</title><author>Wei, Qianjun ; Li, Qiang ; Zhou, Zhipeng ; Ge, ZhengQiang ; Zhang, Yonggang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-b3aa1b076e05ff5df804c51e82b7016a891038a2fc838c59bdc707fe36ff615e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Communications Engineering</topic><topic>Computer Communication Networks</topic><topic>Datasets</topic><topic>Encryption</topic><topic>Engineering</topic><topic>Information Systems and Communication Service</topic><topic>Machine learning</topic><topic>Networks</topic><topic>Privacy</topic><topic>Regression models</topic><topic>Signal,Image and Speech Processing</topic><topic>Special Issue on Privacy-Preserving Computing</topic><topic>Training</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wei, Qianjun</creatorcontrib><creatorcontrib>Li, Qiang</creatorcontrib><creatorcontrib>Zhou, Zhipeng</creatorcontrib><creatorcontrib>Ge, ZhengQiang</creatorcontrib><creatorcontrib>Zhang, Yonggang</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Research Library (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Research Library</collection><collection>Science Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Peer-to-peer networking and applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wei, Qianjun</au><au>Li, Qiang</au><au>Zhou, Zhipeng</au><au>Ge, ZhengQiang</au><au>Zhang, Yonggang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Privacy-preserving two-parties logistic regression on vertically partitioned data using asynchronous gradient sharing</atitle><jtitle>Peer-to-peer networking and applications</jtitle><stitle>Peer-to-Peer Netw. Appl</stitle><date>2021-05-01</date><risdate>2021</risdate><volume>14</volume><issue>3</issue><spage>1379</spage><epage>1387</epage><pages>1379-1387</pages><issn>1936-6442</issn><eissn>1936-6450</eissn><abstract>The full application of machine learning has caused plenty of problems with privacy-preserving. Especially in multi-party machine learning, private data is often exposed in the aggregation,transmission, and communication phase, which leads to the problem of private data leakage. Existing works use secure multi-party computing (SMPC) or secret-sharing technology to ensure the privacy-preserving of multi-party machine learning. Nevertheless, it brings enormous cost and feasibility drawbacks. The partition method of datasets is one of the most critical factors affecting the performance of machine learning. Vertically partitioned data has the problems of incomplete feature information held by a single participant and complicated training process. Therefore, it has to be tackled urgently that how to efficiently and safely complete the multi-party training using vertically partitioned datasets. Moreover, training logistic regression models efficiently is one of the directions worth working on. In this paper, we propose a protocol using that can complete the logistic regression modeling of vertically partitioned data by asynchronous gradient sharing. At the same time, we use an efficient homomorphic encryption method to protect private data. The experiments show that our protocol can reduce the training time in the case of a small impact on the output results, and speedup can be over 10x. Meanwhile, it will ensure the security of the vertically partitioned dataset.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s12083-020-01017-x</doi><tpages>9</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1936-6442
ispartof Peer-to-peer networking and applications, 2021-05, Vol.14 (3), p.1379-1387
issn 1936-6442
1936-6450
language eng
recordid cdi_proquest_journals_2512387198
source SpringerLink Journals - AutoHoldings
subjects Communications Engineering
Computer Communication Networks
Datasets
Encryption
Engineering
Information Systems and Communication Service
Machine learning
Networks
Privacy
Regression models
Signal,Image and Speech Processing
Special Issue on Privacy-Preserving Computing
Training
title Privacy-preserving two-parties logistic regression on vertically partitioned data using asynchronous gradient sharing
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T13%3A02%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Privacy-preserving%20two-parties%20logistic%20regression%20on%20vertically%20partitioned%20data%20using%20asynchronous%20gradient%20sharing&rft.jtitle=Peer-to-peer%20networking%20and%20applications&rft.au=Wei,%20Qianjun&rft.date=2021-05-01&rft.volume=14&rft.issue=3&rft.spage=1379&rft.epage=1387&rft.pages=1379-1387&rft.issn=1936-6442&rft.eissn=1936-6450&rft_id=info:doi/10.1007/s12083-020-01017-x&rft_dat=%3Cproquest_cross%3E2512387198%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2512387198&rft_id=info:pmid/&rfr_iscdi=true