{"id":"https://openalex.org/W2956221135","doi":"https://doi.org/10.1109/icc.2019.8761275","title":"The Need for Alignment in Rate-Efficient Distributed Two-Sided Secure Matrix Computation","display_name":"The Need for Alignment in Rate-Efficient Distributed Two-Sided Secure Matrix Computation","publication_year":2019,"publication_date":"2019-05-01","ids":{"openalex":"https://openalex.org/W2956221135","doi":"https://doi.org/10.1109/icc.2019.8761275","mag":"2956221135"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2019.8761275","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2019.8761275","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2019 - 2019 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043669862","display_name":"Seyedhamed Ebadifar","orcid":null},"institutions":[{"id":"https://openalex.org/I904495901","display_name":"Ruhr University Bochum","ror":"https://ror.org/04tsk2644","country_code":"DE","type":"education","lineage":["https://openalex.org/I904495901"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Seyedhamed Ebadifar","raw_affiliation_strings":["Institute of Digital Communication Systems, Ruhr-Universit\u00e4t Bochum, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Digital Communication Systems, Ruhr-Universit\u00e4t Bochum, Germany","institution_ids":["https://openalex.org/I904495901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042085619","display_name":"Jaber Kakar","orcid":"https://orcid.org/0000-0003-1468-5250"},"institutions":[{"id":"https://openalex.org/I904495901","display_name":"Ruhr University Bochum","ror":"https://ror.org/04tsk2644","country_code":"DE","type":"education","lineage":["https://openalex.org/I904495901"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jaber Kakar","raw_affiliation_strings":["Institute of Digital Communication Systems, Ruhr-Universit\u00e4t Bochum, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Digital Communication Systems, Ruhr-Universit\u00e4t Bochum, Germany","institution_ids":["https://openalex.org/I904495901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034269994","display_name":"Aydin Sezgin","orcid":"https://orcid.org/0000-0003-3511-2662"},"institutions":[{"id":"https://openalex.org/I904495901","display_name":"Ruhr University Bochum","ror":"https://ror.org/04tsk2644","country_code":"DE","type":"education","lineage":["https://openalex.org/I904495901"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Aydin Sezgin","raw_affiliation_strings":["Institute of Digital Communication Systems, Ruhr-Universit\u00e4t Bochum, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Digital Communication Systems, Ruhr-Universit\u00e4t Bochum, Germany","institution_ids":["https://openalex.org/I904495901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5043669862"],"corresponding_institution_ids":["https://openalex.org/I904495901"],"apc_list":null,"apc_paid":null,"fwci":1.4002,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.86223869,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.875763475894928},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7568191289901733},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.6949999332427979},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5041886568069458},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47787991166114807},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.4699943959712982},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4634188711643219},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44711679220199585},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.44676318764686584},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4316525161266327},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4222617447376251},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2736714482307434},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17376625537872314},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16357547044754028}],"concepts":[{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.875763475894928},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7568191289901733},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.6949999332427979},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5041886568069458},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47787991166114807},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.4699943959712982},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4634188711643219},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44711679220199585},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.44676318764686584},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4316525161266327},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4222617447376251},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2736714482307434},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17376625537872314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16357547044754028},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2019.8761275","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2019.8761275","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2019 - 2019 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1528000468","https://openalex.org/W1985926973","https://openalex.org/W2003775517","https://openalex.org/W2087916455","https://openalex.org/W2092577788","https://openalex.org/W2207819601","https://openalex.org/W2583640592","https://openalex.org/W2625678480","https://openalex.org/W2735201225","https://openalex.org/W2885101524","https://openalex.org/W2899438474","https://openalex.org/W2962813697","https://openalex.org/W2962850796","https://openalex.org/W2963498933","https://openalex.org/W3102666199","https://openalex.org/W4289361937","https://openalex.org/W6738835244","https://openalex.org/W6755945239"],"related_works":["https://openalex.org/W3099313426","https://openalex.org/W4287593139","https://openalex.org/W752783541","https://openalex.org/W1506547947","https://openalex.org/W2995605830","https://openalex.org/W4206811032","https://openalex.org/W2086123442","https://openalex.org/W2596457687","https://openalex.org/W3212757063","https://openalex.org/W2093666864"],"abstract_inverted_index":{"Computationally":[0],"efficient":[1],"matrix":[2,26,55,65,92,139],"multiplication":[3,27,56],"is":[4,28,43,61,107],"a":[5,24,59,133,154],"fundamental":[6],"requirement":[7],"in":[8,14,63,160,187],"various":[9],"fields,":[10],"including":[11],"and":[12,75,138,151,158,185,200],"particularly":[13],"data":[15,37],"analytics.":[16],"To":[17,128],"do":[18],"so,":[19],"the":[20,40,52,64,80,83,91,99,103,110,146,164,180],"computation":[21],"task":[22],"of":[23,45,68,86,148,156,183,189,197],"large-scale":[25],"typically":[29,44],"outsourced":[30],"to":[31,36,89,97,108,121,126,162],"multiple":[32],"servers.":[33,104],"However,":[34],"due":[35],"misusage":[38],"at":[39],"servers,":[41],"security":[42],"concern.":[46],"In":[47,77],"this":[48,78,129],"paper,":[49],"we":[50,117,131,144],"study":[51],"two-sided":[53],"secure":[54],"problem,":[57,79],"where":[58,116],"user":[60,81],"interested":[62],"product":[66],"AB":[67],"two":[69],"finite":[70],"field":[71],"private":[72,100],"matrices":[73,101,149],"A":[74,150,167],"B.":[76],"exploits":[82],"computational":[84,202],"resources":[85],"N":[87,124,157],"servers":[88,125,199],"compute":[90],"product,":[93],"but":[94],"simultaneously":[95],"tries":[96],"conceal":[98],"from":[102],"Our":[105],"goal":[106],"maximize":[109,163],"communication":[111,191],"rate":[112],"while":[113],"preserving":[114],"security,":[115],"allow":[118],"for":[119,142],"up":[120],"\u2113":[122,159],"\u2264":[123],"collude.":[127],"end,":[130],"propose":[132],"general":[134],"aligned":[135],"secret":[136],"sharing":[137],"partition":[140,147],"scheme":[141,182],"which":[143,177],"optimize":[145],"B":[152],"as":[153],"function":[155],"order":[161],"achievable":[165],"rate.":[166],"proposed":[168],"inductive":[169],"approach":[170],"gives":[171],"us":[172],"an":[173],"analytical":[174],"close-to-optimal":[175],"solution":[176],"significantly":[178],"outperforms":[179],"existing":[181],"Chang":[184],"Tandon":[186],"terms":[188],"(i)":[190],"rate,":[192],"(ii)":[193],"maximum":[194],"tolerable":[195],"number":[196],"colluding":[198],"(iii)":[201],"complexity.":[203]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}