{"id":"https://openalex.org/W2124183676","doi":"https://doi.org/10.1109/itw.2014.6970881","title":"How to securely compute the modulo-two sum of binary sources","display_name":"How to securely compute the modulo-two sum of binary sources","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W2124183676","doi":"https://doi.org/10.1109/itw.2014.6970881","mag":"2124183676"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2014.6970881","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2014.6970881","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Information Theory Workshop (ITW 2014)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1405.2555","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023777978","display_name":"Deepesh Data","orcid":"https://orcid.org/0000-0003-3544-8414"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Deepesh Data","raw_affiliation_strings":["TIFR, Mumbai","TIFR, Mumbai, India"],"affiliations":[{"raw_affiliation_string":"TIFR, Mumbai","institution_ids":["https://openalex.org/I11947397"]},{"raw_affiliation_string":"TIFR, Mumbai, India","institution_ids":["https://openalex.org/I11947397"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064926409","display_name":"Bikash Kumar Dey","orcid":"https://orcid.org/0000-0003-0333-2257"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Bikash K. Dey","raw_affiliation_strings":["IIT Bombay, Mumbai","IIT Bombay; Mumbai India"],"affiliations":[{"raw_affiliation_string":"IIT Bombay, Mumbai","institution_ids":["https://openalex.org/I162827531"]},{"raw_affiliation_string":"IIT Bombay; Mumbai India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101406465","display_name":"Manoj K. Mishra","orcid":"https://orcid.org/0000-0002-7927-8907"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Manoj Mishra","raw_affiliation_strings":["IIT Bombay, Mumbai","IIT Bombay; Mumbai India"],"affiliations":[{"raw_affiliation_string":"IIT Bombay, Mumbai","institution_ids":["https://openalex.org/I162827531"]},{"raw_affiliation_string":"IIT Bombay; Mumbai India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045516299","display_name":"Vinod M. Prabhakaran","orcid":"https://orcid.org/0000-0001-7505-5303"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Vinod M. Prabhakaran","raw_affiliation_strings":["TIFR, Mumbai","TIFR, Mumbai, India"],"affiliations":[{"raw_affiliation_string":"TIFR, Mumbai","institution_ids":["https://openalex.org/I11947397"]},{"raw_affiliation_string":"TIFR, Mumbai, India","institution_ids":["https://openalex.org/I11947397"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5023777978"],"corresponding_institution_ids":["https://openalex.org/I11947397"],"apc_list":null,"apc_paid":null,"fwci":2.1217,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.89979719,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"496","last_page":"500"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":1.0,"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":1.0,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9997000098228455,"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.9970999956130981,"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/correctness","display_name":"Correctness","score":0.7427442073822021},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.7228893637657166},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6825319528579712},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5752723217010498},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5632604360580444},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4598655700683594},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.44674527645111084},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4312155246734619},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.4172824025154114},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38489726185798645},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3734756410121918},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26020216941833496},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.16131451725959778},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09636685252189636}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7427442073822021},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.7228893637657166},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6825319528579712},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5752723217010498},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5632604360580444},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4598655700683594},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.44674527645111084},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4312155246734619},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.4172824025154114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38489726185798645},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3734756410121918},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26020216941833496},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.16131451725959778},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09636685252189636},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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":2,"locations":[{"id":"doi:10.1109/itw.2014.6970881","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2014.6970881","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Information Theory Workshop (ITW 2014)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1405.2555","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1405.2555","pdf_url":"https://arxiv.org/pdf/1405.2555","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1405.2555","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1405.2555","pdf_url":"https://arxiv.org/pdf/1405.2555","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1832515201","https://openalex.org/W1973599573","https://openalex.org/W2004283834","https://openalex.org/W2006453614","https://openalex.org/W2010527616","https://openalex.org/W2019307453","https://openalex.org/W2020316223","https://openalex.org/W2039320535","https://openalex.org/W2053362087","https://openalex.org/W2080911030","https://openalex.org/W2085125115","https://openalex.org/W2097831852","https://openalex.org/W2106345596","https://openalex.org/W2124183676","https://openalex.org/W2154175667","https://openalex.org/W2164651000","https://openalex.org/W2478708596","https://openalex.org/W2784889254","https://openalex.org/W2962686861","https://openalex.org/W3102581918","https://openalex.org/W6747970667"],"related_works":["https://openalex.org/W1667647204","https://openalex.org/W2404647514","https://openalex.org/W4247536566","https://openalex.org/W2018477250","https://openalex.org/W3119814709","https://openalex.org/W4241418540","https://openalex.org/W1508895727","https://openalex.org/W2725786787","https://openalex.org/W3034924094","https://openalex.org/W4283160672"],"abstract_inverted_index":{"In":[0,206],"secure":[1,107],"multiparty":[2],"computation,":[3],"mutually":[4],"distrusting":[5],"users":[6,25,121,194],"in":[7,223],"a":[8,74,87,106,123,182,230],"network":[9],"want":[10,215],"to":[11,13,136,220],"collaborate":[12],"compute":[14,137],"functions":[15,48],"of":[16,35,109,114,145,155,167,185,193,201,218,235],"data":[17,34,45],"which":[18],"is":[19,73,96,188,203,262],"distributed":[20],"among":[21],"the":[22,33,47,57,67,80,90,110,132,138,143,153,165,199,216,239],"users.":[23],"The":[24],"should":[26],"not":[27],"learn":[28],"any":[29,64],"additional":[30],"information":[31],"about":[32],"others":[36],"than":[37],"what":[38],"they":[39,49],"may":[40],"infer":[41],"from":[42],"their":[43],"own":[44],"and":[46,70,94,102,116,131,147,160,179,195,241],"are":[50,163,257],"computing.":[51],"Previous":[52],"works":[53],"have":[54],"mostly":[55],"considered":[56],"worst":[58],"case":[59,82],"context":[60],"(i.e.,":[61,83],"without":[62],"assuming":[63],"distribution":[65,88],"for":[66,237,242],"data);":[68],"Lee":[69],"Abbe":[71],"(2014)":[72,171],"notable":[75],"exception.":[76],"Here,":[77],"we":[78,84,104,208,213],"study":[79],"average":[81],"work":[85],"with":[86,128],"on":[89,152],"data)":[91],"where":[92,119],"correctness":[93,156],"privacy":[95,162,261],"only":[97,180,214,263],"desired":[98],"asymptotically.":[99,265],"For":[100],"concreteness":[101],"simplicity,":[103],"consider":[105],"version":[108],"function":[111],"computation":[112],"problem":[113],"K\u00f6rner":[115],"Marton":[117],"(1979)":[118],"two":[120],"observe":[122],"doubly":[124],"symmetric":[125],"binary":[126],"source":[127],"parameter":[129],"p":[130],"third":[133],"user":[134],"wants":[135],"XOR.":[139],"We":[140,250],"show":[141,172,209,252],"that":[142,173,253],"amount":[144],"communication":[146],"randomness":[148,197],"resources":[149],"required":[150,264],"depends":[151],"level":[154],"desired.":[157],"When":[158],"zero-error":[159],"perfect":[161,248],"required,":[164],"results":[166],"Data":[168],"et":[169],"al.":[170],"it":[174,225],"can":[175,226],"be":[176,227],"achieved":[177,228],"if":[178,181,212,260],"total":[183],"rate":[184,200,232],"1":[186,202],"bit":[187],"communicated":[189],"between":[190],"every":[191],"pair":[192],"private":[196,243],"at":[198],"used":[204],"up.":[205],"contrast,":[207],"here":[210],"that,":[211],"probability":[217],"error":[219],"vanish":[221],"asymptotically":[222],"blocklength,":[224],"by":[229],"lower":[231],"(binary":[233],"entropy":[234],"p)":[236],"all":[238],"links":[240],"randomness;":[244],"this":[245],"also":[246,251],"guarantees":[247],"privacy.":[249],"no":[254],"smaller":[255],"rates":[256],"possible":[258],"even":[259]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}
