{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T00:49:52Z","timestamp":1779929392085,"version":"3.53.1"},"reference-count":38,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/bigdata47090.2019.9006000","type":"proceedings-article","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T06:05:34Z","timestamp":1582610734000},"page":"1312-1321","source":"Crossref","is-referenced-by-count":35,"title":["SecureGBM: Secure Multi-Party Gradient Boosting"],"prefix":"10.1109","author":[{"given":"Zhi","family":"Feng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haoyi","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chuanyuan","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sijia","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Baoxin","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Licheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zeyu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shengwen","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liping","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Huan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref38","first-page":"71","article-title":"Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes","author":"shamir","year":"2013","journal-title":"International Conference on Machine Learning"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516701"},{"key":"ref32","first-page":"724","article-title":"Actively secure ot extension with optimal overhead","author":"keller","year":"2015","journal-title":"Annual Cryptology Conference"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3154794"},{"key":"ref30","first-page":"797","article-title":"Faster private set intersection based on {OT} extension","author":"pinkas","year":"2014","journal-title":"23rd USENIX Security Symposium ( USENIX Security 14)"},{"key":"ref37","article-title":"Stochastic convex optimization","author":"shalev-shwartz","year":"2003","journal-title":"COLT"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BF02190104"},{"key":"ref35","first-page":"512","article-title":"Boosting algorithms as gradient descent","author":"mason","year":"2000","journal-title":"Advances in neural information processing systems"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813690"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483403"},{"key":"ref11","first-page":"81","article-title":"Asynchronous distributed learning of topic models","author":"smyth","year":"2009","journal-title":"Advances in neural information processing systems"},{"key":"ref12","first-page":"1189","article-title":"Greedy function approximation: a gradient boosting machine","author":"friedman","year":"2001","journal-title":"Annals of Statistics"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9473(01)00065-2"},{"key":"ref14","article-title":"Arcing the edge","author":"breiman","year":"1997","journal-title":"Technical Report 486 Statistics Department University of California at Tech Rep"},{"key":"ref15","article-title":"Predicting the future relevance of research institutions-the winning solution of the kdd cup 2016","author":"sandulescu","year":"2016","journal-title":"arXiv preprint arXiv 1609 04802"},{"key":"ref16","author":"nielsen","year":"2016","journal-title":"Tree boosting with xgboost-why does xgboost win every&#x201D; machine learning competition?"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"ref18","first-page":"3146","article-title":"Lightgbm: A highly efficient gradient boosting decision tree","author":"ke","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1666420.1666444"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"ref4","article-title":"Communication-efficient distributed sparse linear discriminant analysis","author":"tian","year":"2016","journal-title":"arXiv preprint arXiv 1610 09975"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/120868669"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.86"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2015.2472014"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554799"},{"key":"ref5","first-page":"6343","article-title":"Distributed learning without distress: Privacy-preserving empirical risk minimization","author":"jayaraman","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref8","first-page":"337","article-title":"Large-scale parallel collaborative filtering for the netflix prize","author":"zhou","year":"2008","journal-title":"International Conference onAlgorithmic Applications in Management"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.2858"},{"key":"ref2","first-page":"1876","article-title":"Multiparty differential privacy via aggregation of locally trained classifiers","author":"pathak","year":"2010","journal-title":"Advances in neural information processing systems"},{"key":"ref9","first-page":"1223","article-title":"Large scale distributed deep networks","author":"dean","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref1","first-page":"521","article-title":"Algebraic geometric secret sharing schemes and secure multi-party computations over small fields","author":"chen","year":"2006","journal-title":"Annual International Cryptology Conference"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.98"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-319-57048-8_5","article-title":"Homomorphic encryption","author":"halevi","year":"2017","journal-title":"Tutorials on the Foundations of Cryptography"},{"key":"ref21","first-page":"1192","article-title":"A guide to fully homomorphic encryption","volume":"2015","author":"armknecht","year":"2015","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref23","article-title":"Foundations of secure computation","author":"demillo","year":"1978","journal-title":"Georgia Institute of Technology"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"ref25","first-page":"24","article-title":"Fully homomorphic encryption over the integers","author":"van dijk","year":"2010","journal-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques"}],"event":{"name":"2019 IEEE International Conference on Big Data (Big Data)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2019,12,9]]},"end":{"date-parts":[[2019,12,12]]}},"container-title":["2019 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8986695\/9005444\/09006000.pdf?arnumber=9006000","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T21:46:56Z","timestamp":1658094416000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9006000\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/bigdata47090.2019.9006000","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}