{"id":"https://openalex.org/W2951880388","doi":null,"title":"Protocols for Reliable and Secure Message Transmission.","display_name":"Protocols for Reliable and Secure Message Transmission.","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2951880388","mag":"2951880388"},"language":"en","primary_location":{"id":"mag:2951880388","doi":null,"is_oa":false,"landing_page_url":"https://eprint.iacr.org/2010/281.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S2764847869","display_name":"IACR Cryptology ePrint Archive","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":["https://openalex.org/P4322614454"],"host_organization_lineage_names":["Cryptology ePrint Archive"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IACR Cryptology ePrint Archive","raw_type":null},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":[],"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/A5040182958","display_name":"Ashish Choudhury","orcid":"https://orcid.org/0000-0002-2428-9537","observed_orcids":["https://orcid.org/0000-0002-2428-9537"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ashish Choudhury","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-2428-9537","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5040182958"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"2010","issue":null,"first_page":"281","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9564999938011169,"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"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9564999938011169,"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"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.011599999852478504,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.004699999932199717,"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/secure-message-transmission","display_name":"secure message transmission","score":1.0},{"id":"https://openalex.org/keywords/information-theoretic-security","display_name":"information-theoretic security","score":0.7820000052452087},{"id":"https://openalex.org/keywords/byzantine-faults","display_name":"Byzantine faults","score":0.5789999961853027},{"id":"https://openalex.org/keywords/mobile-adversary","display_name":"mobile adversary","score":0.49900001287460327},{"id":"https://openalex.org/keywords/communication-complexity-lower-bounds","display_name":"communication complexity lower bounds","score":0.6460000276565552},{"id":"https://openalex.org/keywords/distributed-networks","display_name":"distributed networks","score":0.3440000116825104},{"id":"https://openalex.org/keywords/fault-tolerant-protocols","display_name":"fault-tolerant protocols","score":0.6539999842643738},{"id":"https://openalex.org/keywords/synchronous-and-asynchronous-communication","display_name":"synchronous and asynchronous communication","score":0.6610000133514404},{"id":"https://openalex.org/keywords/finite-fields","display_name":"finite fields","score":0.39500001072883606},{"id":"https://openalex.org/keywords/byzantine-agreement","display_name":"Byzantine agreement","score":0.3160000145435333},{"id":"https://openalex.org/keywords/consensus-algorithms","display_name":"consensus algorithms","score":0.4169999957084656},{"id":"https://openalex.org/keywords/byzantine-fault-tolerance","display_name":"Byzantine fault tolerance","score":0.3269999921321869}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7782254219055176},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.6918666958808899},{"id":"https://openalex.org/C47191418","wikidata":"https://www.wikidata.org/wiki/Q3510462","display_name":"Information-theoretic security","level":3,"score":0.5492758750915527},{"id":"https://openalex.org/C198104137","wikidata":"https://www.wikidata.org/wiki/Q974688","display_name":"Communication source","level":2,"score":0.5454330444335938},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.49220576882362366},{"id":"https://openalex.org/C7606001","wikidata":"https://www.wikidata.org/wiki/Q4686702","display_name":"Adversary model","level":3,"score":0.4751555621623993},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.4561164081096649},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44256144762039185},{"id":"https://openalex.org/C141492731","wikidata":"https://www.wikidata.org/wiki/Q1052621","display_name":"Message authentication code","level":3,"score":0.43900689482688904},{"id":"https://openalex.org/C118463975","wikidata":"https://www.wikidata.org/wiki/Q220849","display_name":"Digital signature","level":3,"score":0.42198094725608826},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3961135745048523},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.16044026613235474}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2951880388","doi":null,"is_oa":false,"landing_page_url":"https://eprint.iacr.org/2010/281.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S2764847869","display_name":"IACR Cryptology ePrint Archive","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":["https://openalex.org/P4322614454"],"host_organization_lineage_names":["Cryptology ePrint Archive"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IACR Cryptology ePrint Archive","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":85,"referenced_works":["https://openalex.org/W48039395","https://openalex.org/W59079490","https://openalex.org/W120930527","https://openalex.org/W295092886","https://openalex.org/W1484047614","https://openalex.org/W1494058650","https://openalex.org/W1499281737","https://openalex.org/W1502676516","https://openalex.org/W1505726608","https://openalex.org/W1509903572","https://openalex.org/W1518294377","https://openalex.org/W1524288918","https://openalex.org/W1526522601","https://openalex.org/W1526970571","https://openalex.org/W1528330226","https://openalex.org/W1533432398","https://openalex.org/W1549890695","https://openalex.org/W1559343931","https://openalex.org/W1564893486","https://openalex.org/W1568549486","https://openalex.org/W1573913405","https://openalex.org/W1582636766","https://openalex.org/W1598963584","https://openalex.org/W1604064347","https://openalex.org/W1605507583","https://openalex.org/W1606480398","https://openalex.org/W1808659847","https://openalex.org/W1850163700","https://openalex.org/W1875501004","https://openalex.org/W1964378537","https://openalex.org/W1965492831","https://openalex.org/W1967263393","https://openalex.org/W1980206771","https://openalex.org/W1980461136","https://openalex.org/W1983762057","https://openalex.org/W1988224180","https://openalex.org/W1990304797","https://openalex.org/W1995875735","https://openalex.org/W1995989679","https://openalex.org/W1996360405","https://openalex.org/W1998777945","https://openalex.org/W2006453614","https://openalex.org/W2006699751","https://openalex.org/W2006864080","https://openalex.org/W2009013415","https://openalex.org/W2011463728","https://openalex.org/W2011665720","https://openalex.org/W2012366430","https://openalex.org/W2013568176","https://openalex.org/W2014772227","https://openalex.org/W2027471022","https://openalex.org/W2033376960","https://openalex.org/W2035362408","https://openalex.org/W2060169610","https://openalex.org/W2073917679","https://openalex.org/W2074928311","https://openalex.org/W2080970448","https://openalex.org/W2083650689","https://openalex.org/W2092148937","https://openalex.org/W2092422002","https://openalex.org/W2095378187","https://openalex.org/W2096024255","https://openalex.org/W2099111195","https://openalex.org/W2126924915","https://openalex.org/W2127165607","https://openalex.org/W2135083604","https://openalex.org/W2141420453","https://openalex.org/W2143067599","https://openalex.org/W2148024839","https://openalex.org/W2152879038","https://openalex.org/W2156186849","https://openalex.org/W2158654475","https://openalex.org/W2162167488","https://openalex.org/W2180989652","https://openalex.org/W2181759024","https://openalex.org/W2399610060","https://openalex.org/W2404699115","https://openalex.org/W2483269697","https://openalex.org/W2611515161","https://openalex.org/W2612747803","https://openalex.org/W2895239415","https://openalex.org/W2913982177","https://openalex.org/W3023478445","https://openalex.org/W3145128584","https://openalex.org/W4234572373"],"related_works":["https://openalex.org/W596930132","https://openalex.org/W2181759024","https://openalex.org/W2474404021","https://openalex.org/W7099014221","https://openalex.org/W2950808142","https://openalex.org/W2408372415","https://openalex.org/W2950440699","https://openalex.org/W2950704336","https://openalex.org/W7096922274","https://openalex.org/W7098520430"],"abstract_inverted_index":{"Consider":[0],"the":[1,22,42,45,96,112,117,145,153,186,194,223,257,308,315,324,334,338,353,364,376,389,402,418,422,433,461],"following":[2,258,316],"problem:":[3],"a":[4,8,52,62,77,86,345,356,360,382,408],"sender":[5],"S":[6,48,56,93],"and":[7,36,49,183,204,241,251,326,404,440,457],"receiver":[9],"R":[10,61,98],"are":[11,318,323],"part":[12],"of":[13,41,44,54,67,111,132,189,225,269,280,299,307,340,348,355,384],"an":[14,27,141,166,233,372],"unreliable,":[15],"connected,":[16],"distributed":[17],"network.":[18],"The":[19,81,130],"distrust":[20],"in":[21,51,128,138,158,247,310,359,436],"network":[23,46,249,336,361,438],"is":[24,83,121,172,185,313,362,388],"modelled":[25],"by":[26,116,207,333,396],"entity":[28],"called":[29,122],"adversary,":[30],"who":[31,37],"has":[32,196],"unbounded":[33,197],"computing":[34,170,198,238],"power":[35,171],"can":[38,244],"corrupt":[39],"some":[40],"nodes":[43],"(excluding":[47],"R)":[50],"variety":[53],"ways.":[55],"wishes":[57],"to":[58,60,84,260,330,400,406,452,466],"send":[59],"message":[63,124,134,154,383,403],"m":[64,101],"that":[65,89,144,192],"consists":[66],"l":[68,71],"elements,":[69],"where":[70],"\u2265":[72],"1,":[73],"selected":[74],"uniformly":[75],"from":[76],"finite":[78],"field":[79],"F.":[80],"challenge":[82],"design":[85,407],"protocol,":[87,97,343],"such":[88,212],"after":[90],"interacting":[91],"with":[92,168],"as":[94,175,213,222],"per":[95],"should":[99,147],"output":[100],"without":[102],"any":[103,150,341,397],"error":[104],"(perfect":[105,162],"reliability).":[106],"Moreover,":[107],"this":[108,184,428],"hold":[109],"irrespective":[110],"disruptive":[113],"actions":[114],"done":[115],"adversary.":[118],"This":[119,443],"problem":[120,131,206,243],"reliable":[123],"transmission":[125,135],"or":[126,136,177,180],"RMT":[127,203,240],"short.":[129],"secure":[133],"SMT":[137,205,242],"short":[139],"requires":[140],"additional":[142],"constraint":[143],"adversary":[146,167,195,234],"not":[148,460],"get":[149],"information":[151,159,178],"about":[152],"what":[155,387],"so":[156],"ever":[157],"theoretic":[160,179],"sense":[161],"secrecy).":[163],"Security":[164],"against":[165,232],"infinite":[169],"also":[173],"known":[174],"non-cryptographic":[176],"Shannon":[181],"security":[182,224],"strongest":[187],"notion":[188],"security.":[190],"Notice":[191],"since":[193],"power,":[199],"we":[200,430],"cannot":[201],"solve":[202],"using":[208],"classical":[209],"cryptographic":[210],"primitives":[211,228],"public":[214],"key":[215],"cryptography,":[216],"digital":[217],"signatures,":[218],"authentication":[219],"schemes,":[220],"etc":[221],"all":[226],"these":[227],"holds":[229],"good":[230],"only":[231],"having":[235],"polynomially":[236],"bounded":[237],"power.":[239],"be":[245,331],"studied":[246],"various":[248],"models":[250,439],"adversarial":[252,441],"settings.":[253,442],"We":[254],"may":[255],"use":[256],"parameters":[259],"describe":[261],"different":[262],"settings/models":[263],"for":[264,337],"studying":[265],"RMT/SMT:":[266],"1.":[267,320],"Type":[268,279,298],"Underlying":[270],"Network":[271],"\u2014":[272,282,288,301],"Undirected":[273],"Graph,":[274,276],"Directed":[275],"Hypergraph.":[277],"2.":[278,350],"Communication":[281],"Synchronous,":[283],"Asynchronous.":[284],"3.":[285,379],"Adversary":[286],"capacity":[287],"Threshold":[289,291],"Static,":[290,294],"Mobile,":[292],"Non-threshold":[293,295],"Mobile.":[296],"4.":[297],"Faults":[300],"Fail-stop,":[302],"Passive,":[303],"Byzantine,":[304],"Mixed.":[305],"Irrespective":[306],"settings":[309],"which":[311],"RMT/SMT":[312,342,357,398,411],"studied,":[314],"issues":[317,435],"common:":[319],"Possibility:":[321],"What":[322],"necessary":[325],"sufficient":[327],"structural":[328],"conditions":[329],"satisfied":[332],"underlying":[335],"existence":[339,354],"tolerating":[344],"given":[346,377],"type":[347],"adversary?":[349],"Feasibility:":[351],"Once":[352],"protocol":[358,374,399,412],"ascertained,":[363],"next":[365],"natural":[366],"question":[367],"is,":[368],"does":[369],"there":[370],"exist":[371],"efficient":[373],"on":[375,421],"network?":[378],"Optimality:":[380],"Given":[381],"specific":[385],"length,":[386],"minimum":[390],"communication":[391,415,423],"complexity":[392,416,424],"(lower":[393],"bound)":[394],"needed":[395],"transmit":[401],"how":[405],"polynomial":[409],"time":[410],"whose":[413],"total":[414],"matches":[417],"lower":[419],"bound":[420],"(optimal":[425],"protocol)?":[426],"In":[427],"dissertation,":[429],"look":[431],"into":[432],"above":[434],"several":[437,446,453,467],"thesis":[444],"reports":[445],"new/improved/efficient/optimal":[447],"solutions,":[448],"gives":[449],"affirmative/negative":[450],"answers":[451],"significant":[454],"open":[455],"problems":[456],"last":[458],"but":[459],"least,":[462],"provides":[463],"first":[464],"solutions":[465],"newly":[468],"formulated":[469],"problems.":[470]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2019-06-27T00:00:00"}