{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T05:43:31Z","timestamp":1781329411247,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1633282 1562888 1565208"],"award-info":[{"award-number":["CNS-1633282 1562888 1565208"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Deutsche Forschungsgemeinschaft","award":["GRK 1651 (SOAMED)"],"award-info":[{"award-number":["GRK 1651 (SOAMED)"]}]},{"name":"EPSRC","award":["EP\/N510129\/1"],"award-info":[{"award-number":["EP\/N510129\/1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3319535.3339816","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"1335-1350","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Make Some ROOM for the Zeros"],"prefix":"10.1145","author":[{"given":"Phillipp","family":"Schoppmann","sequence":"first","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adri\u00e0","family":"Gasc\u00f3n","sequence":"additional","affiliation":[{"name":"The Alan Turing Institute \/ University of Warwick, London, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mariana","family":"Raykova","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benny","family":"Pinkas","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat Gan, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"PIR with Compressed Queries and Amortized Query Processing. In IEEE Symposium on Security and Privacy. IEEE, 962--979","author":"Angel Sebastian"},{"key":"e_1_3_2_2_2_1","volume-title":"Sorting Networks and Their Applications. In AFIPS Spring Joint Computing Conference (AFIPS Conference Proceedings )","volume":"32","author":"Batcher Kenneth E.","year":"1968"},{"key":"e_1_3_2_2_3_1","volume-title":"CRYPTO (Lecture Notes in Computer Science)","author":"Beaver Donald"},{"key":"e_1_3_2_2_4_1","volume-title":"Proceedings of KDD cup and workshop","volume":"2007","author":"Bennett James","year":"2007"},{"key":"e_1_3_2_2_5_1","volume-title":"Stephen Tu, and Shafi Goldwasser.","author":"Bost Raphael","year":"2015"},{"key":"e_1_3_2_2_6_1","volume-title":"EUROCRYPT (2) (Lecture Notes in Computer Science)","author":"Boyle Elette"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243836"},{"key":"e_1_3_2_2_8_1","first-page":"3","article-title":"Private Information Retrieval by Keywords","volume":"1998","author":"Chor Benny","year":"1998","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_9_1","volume-title":"SCN (Lecture Notes in Computer Science)","author":"Ciampi Michele"},{"key":"e_1_3_2_2_10_1","volume-title":"mbox","author":"1000 Genomes Project Consortium et al","year":"2015"},{"key":"e_1_3_2_2_11_1","unstructured":"Kushal Datta Karthik Gururaj Mishali Naik Paolo Narvaez and Ming Rutar. 2017. GenomicsDB: Storing Genome Data as Sparse Columnar Arrays. White Paper. https:\/\/www.intel.com\/content\/dam\/www\/public\/us\/en\/documents\/white-papers\/genomics-storing-genome-data-paper.pdf  Kushal Datta Karthik Gururaj Mishali Naik Paolo Narvaez and Ming Rutar. 2017. GenomicsDB: Storing Genome Data as Sparse Columnar Arrays. White Paper. https:\/\/www.intel.com\/content\/dam\/www\/public\/us\/en\/documents\/white-papers\/genomics-storing-genome-data-paper.pdf"},{"key":"e_1_3_2_2_12_1","unstructured":"Jack Doerner. [n. d.]. The Absentminded Crypto Kit. https:\/\/bitbucket.org\/jackdoerner\/absentminded-crypto-kit\/  Jack Doerner. [n. d.]. The Absentminded Crypto Kit. https:\/\/bitbucket.org\/jackdoerner\/absentminded-crypto-kit\/"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/567806.567810"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1689"},{"key":"e_1_3_2_2_15_1","volume-title":"Foundations of Cryptography","author":"Goldreich Oded"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_2_17_1","unstructured":"Ga\u00ebl Guennebaud Beno\u00eet Jacob et almbox. [n. d.]. Eigen: Sparse matrix manipulations. https:\/\/eigen.tuxfamily.org\/dox\/group__TutorialSparse.html  Ga\u00ebl Guennebaud Beno\u00eet Jacob et almbox. [n. d.]. Eigen: Sparse matrix manipulations. https:\/\/eigen.tuxfamily.org\/dox\/group__TutorialSparse.html"},{"key":"e_1_3_2_2_18_1","volume-title":"et almbox","author":"Guennebaud Ga\u00ebl","year":"2010"},{"key":"e_1_3_2_2_19_1","unstructured":"Elad Hoffer Itay Hubara and Daniel Soudry. 2017. Train longer generalize better: closing the generalization gap in large batch training of neural networks. In NIPS. 1729--1739.  Elad Hoffer Itay Hubara and Daniel Soudry. 2017. Train longer generalize better: closing the generalization gap in large batch training of neural networks. In NIPS. 1729--1739."},{"key":"e_1_3_2_2_20_1","volume-title":"Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?","author":"Huang Yan"},{"key":"e_1_3_2_2_21_1","unstructured":"Eric Jones Travis Oliphant Pearu Peterson et almbox. [n. d.]. Sparse matrices (scipy.sparse) -- SciPy v1.1.0 Reference Guide. https:\/\/docs.scipy.org\/doc\/scipy\/reference\/sparse.html  Eric Jones Travis Oliphant Pearu Peterson et almbox. [n. d.]. Sparse matrices (scipy.sparse) -- SciPy v1.1.0 Reference Guide. https:\/\/docs.scipy.org\/doc\/scipy\/reference\/sparse.html"},{"key":"e_1_3_2_2_22_1","volume-title":"GAZELLE: A Low Latency Framework for Secure Neural Network Inference. In USENIX Security Symposium. USENIX Association, 1651--1669","author":"Juvekar Chiraag","year":"2018"},{"key":"e_1_3_2_2_23_1","volume-title":"ICALP (2) (Lecture Notes in Computer Science)","author":"Kolesnikov Vladimir"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1515\/popets-2015-0011","article-title":"Parallel Oblivious Array Access for Secure Multiparty Computation and Privacy-Preserving Minimum Spanning Trees","volume":"2015","author":"Laud Peeter","year":"2015","journal-title":"PoPETs"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"},{"key":"e_1_3_2_2_26_1","volume-title":"ACM Conference on Computer and Communications Security. ACM , 619--631","author":"Liu Jian"},{"key":"e_1_3_2_2_27_1","volume-title":"Learning Word Vectors for Sentiment Analysis","author":"Maas Andrew L."},{"key":"e_1_3_2_2_28_1","volume-title":"SWAT (FOCS)","author":"Moenck R."},{"key":"e_1_3_2_2_29_1","volume-title":"SecureML: A System for Scalable Privacy-Preserving Machine Learning. In IEEE Symposium on Security and Privacy. IEEE Computer Society, 19--38","author":"Mohassel Payman","year":"2017"},{"key":"e_1_3_2_2_30_1","volume-title":"GraphSC: Parallel Secure Computation Made Easy. In IEEE Symposium on Security and Privacy . IEEE Computer Society, 377--394","author":"Nayak Kartik","year":"2015"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516751"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154794"},{"key":"e_1_3_2_2_34_1","unstructured":"Jason Rennie and Ken Lang. 2008. The 20 Newsgroups data set. http:\/\/qwone.com\/ jason\/20Newsgroups\/  Jason Rennie and Ken Lang. 2008. The 20 Newsgroups data set. http:\/\/qwone.com\/ jason\/20Newsgroups\/"},{"key":"e_1_3_2_2_35_1","first-page":"289","article-title":"Secure and Scalable Document Similarity on Distributed Databases: Differential Privacy to the Rescue","volume":"2018","author":"Schoppmann Phillipp","year":"2018","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_36_1","unstructured":"The Scikit-learn authors. [n. d.]. Scikit-learn language identification dataset. https:\/\/github.com\/scikit-learn\/scikit-learn\/tree\/master\/doc\/tutorial\/text_analytics\/data\/languages  The Scikit-learn authors. [n. d.]. Scikit-learn language identification dataset. https:\/\/github.com\/scikit-learn\/scikit-learn\/tree\/master\/doc\/tutorial\/text_analytics\/data\/languages"},{"key":"e_1_3_2_2_37_1","unstructured":"Avishay Yanai. [n. d.]. FastPolynomial. https:\/\/github.com\/AvishayYanay\/FastPolynomial  Avishay Yanai. [n. d.]. FastPolynomial. https:\/\/github.com\/AvishayYanay\/FastPolynomial"},{"key":"e_1_3_2_2_38_1","volume-title":"How to Generate and Exchange Secrets (Extended Abstract)","author":"Chi-Chih Yao Andrew"},{"key":"e_1_3_2_2_39_1","first-page":"1153","article-title":"Obliv-C: A Language for Extensible Data-Oblivious Computation","volume":"2015","author":"Zahur Samee","year":"2015","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_40_1","volume-title":"Encyclopedia of Database Systems","author":"Zhou Jingren"}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","location":"London United Kingdom","acronym":"CCS '19","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3339816","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3339816","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3339816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:24:01Z","timestamp":1750202641000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3339816"}},"subtitle":["Data Sparsity in Secure Distributed Machine Learning"],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":40,"alternative-id":["10.1145\/3319535.3339816","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3339816","relation":{},"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"2019-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}