{"id":"https://openalex.org/W2962702172","doi":"https://doi.org/10.1145/3293611.3331571","title":"Multiparty Interactive Communication with Private Channels","display_name":"Multiparty Interactive Communication with Private Channels","publication_year":2019,"publication_date":"2019-07-16","ids":{"openalex":"https://openalex.org/W2962702172","doi":"https://doi.org/10.1145/3293611.3331571","mag":"2962702172"},"language":"en","primary_location":{"id":"doi:10.1145/3293611.3331571","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3293611.3331571","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3293611.3331571","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3293611.3331571","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104083401","display_name":"Abhinav Aggarwal","orcid":null},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abhinav Aggarwal","raw_affiliation_strings":["University of New Mexico, Albuquerque, NM, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of New Mexico, Albuquerque, NM, USA","institution_ids":["https://openalex.org/I169521973"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055553753","display_name":"Varsha Dani","orcid":"https://orcid.org/0009-0008-1651-1987"},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Varsha Dani","raw_affiliation_strings":["University of New Mexico, Albuquerque, NM, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of New Mexico, Albuquerque, NM, USA","institution_ids":["https://openalex.org/I169521973"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026424164","display_name":"Thomas P. Hayes","orcid":"https://orcid.org/0009-0003-2718-572X"},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas P. Hayes","raw_affiliation_strings":["University of New Mexico, Albuquerque, NM, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of New Mexico, Albuquerque, NM, USA","institution_ids":["https://openalex.org/I169521973"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039997672","display_name":"Jared Saia","orcid":"https://orcid.org/0000-0002-3376-7334"},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jared Saia","raw_affiliation_strings":["University of New Mexico, Albuquerque, NM, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of New Mexico, Albuquerque, NM, USA","institution_ids":["https://openalex.org/I169521973"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I169521973"],"apc_list":null,"apc_paid":null,"fwci":0.4339,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71608246,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"147","last_page":"149"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.7396242618560791},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7075197696685791},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6077616214752197},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.5731714963912964},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.5648684501647949},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5207007527351379},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4929389953613281},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.43657487630844116},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40625452995300293},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.27217304706573486},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.22323116660118103},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2203560173511505}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7396242618560791},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7075197696685791},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6077616214752197},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.5731714963912964},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.5648684501647949},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5207007527351379},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4929389953613281},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43657487630844116},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40625452995300293},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.27217304706573486},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.22323116660118103},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2203560173511505},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3293611.3331571","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3293611.3331571","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3293611.3331571","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3293611.3331571","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3293611.3331571","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3293611.3331571","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2146226675","display_name":null,"funder_award_id":"CCF 1613772","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3123792845","display_name":"TWC: Small: Collaborative: Cost-Competitve Analysis - A New Tool for Designing Secure Systems","funder_award_id":"1318880","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3382960263","display_name":"AF:Small:Resource-Competitive Algorithms for Building Robust Distributed Systems","funder_award_id":"1613772","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4242360063","display_name":null,"funder_award_id":"CNS 1816250","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6438526116","display_name":null,"funder_award_id":"CNS 1318880","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6752590106","display_name":null,"funder_award_id":"CCF 1320994","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7939478772","display_name":"SaTC: CORE: Small: Collaborative: Proof of Work Without All the Work","funder_award_id":"1816250","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8622584681","display_name":"AF: SMALL: Quorums Quicken Queries - Towards Practical Secure Multiparty Computation","funder_award_id":"1320994","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2962702172.pdf","grobid_xml":"https://content.openalex.org/works/W2962702172.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W26087452","https://openalex.org/W1490273987","https://openalex.org/W1892798954","https://openalex.org/W2077242989","https://openalex.org/W2115551261","https://openalex.org/W2123903520","https://openalex.org/W2483713254","https://openalex.org/W2790390012","https://openalex.org/W2962702172","https://openalex.org/W2963520301","https://openalex.org/W4300349690"],"related_works":["https://openalex.org/W4388150944","https://openalex.org/W2116677773","https://openalex.org/W2155261584","https://openalex.org/W2584231425","https://openalex.org/W4242235492","https://openalex.org/W2150611273","https://openalex.org/W4237162029","https://openalex.org/W2367268135","https://openalex.org/W4207086172","https://openalex.org/W1974895073"],"abstract_inverted_index":{"A":[0],"group":[1],"of":[2,30,57,73,94,148],"n":[3],"players":[4],"wants":[5],"to":[6,39,89],"run":[7,167],"a":[8,13,91,145,169],"distributed":[9],"protocol":[10,164],"\u2118":[11,26,35,96,136,155,165],"over":[12],"network":[14,161],"where":[15],"communication":[16],"occurs":[17],"via":[18],"private":[19],"point-to-point":[20],"channels.":[21],"Can":[22],"we":[23,86],"efficiently":[24],"simulate":[25],"in":[27,60,67,82,158,168],"the":[28,44,55,62,71,77],"presence":[29],"an":[31,159],"adversary":[32,78],"who":[33],"knows":[34],"and":[36,69,110,141,162],"is":[37,50,130,142],"able":[38],"maliciously":[40],"flip":[41],"bits":[42,58,74],"on":[43],"channels?":[45],"We":[46,125],"show":[47,87],"that":[48,98,127,154],"this":[49],"possible,":[51],"even":[52],"when":[53],"L,":[54],"number":[56,72],"sent":[59],"\u2118,":[61,68,95],"average":[63],"message":[64],"size":[65],"\u03b1":[66,129],"T,":[70],"flipped":[75],"by":[76],"are":[79],"not":[80],"known":[81],"advance.":[83],"In":[84],"particular,":[85],"how":[88],"create":[90],"robust":[92],"version":[93],"such":[97],"1)":[99],"\u2118'":[100,112],"fails":[101],"with":[102],"probability":[103],"at":[104],"most":[105],"\u03b4,":[106],"for":[107],"any":[108],"\u03b4>0;":[109],"2)":[111],"sends":[113,137],"O(":[114],"L":[115],"(1":[116],"+":[117,122],"(1/\u03b1)":[118],"\u0142og":[119],"(n":[120,133],"L/\u03b4))":[121],"T)":[123],"bits.":[124],"note":[126],"if":[128],"\u03a9":[131],"(log":[132],"L/\u03b4),":[134],"then":[135],"only":[138],"O(L+T)":[139],"bits,":[140],"therefore":[143],"within":[144],"constant":[146],"factor":[147],"optimal.":[149],"Critically,":[150],"our":[151,163],"result":[152],"requires":[153],"runs":[156],"correctly":[157],"asynchronous":[160],"must":[166],"synchronous":[170],"network.":[171]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}