{"id":"https://openalex.org/W2075593748","doi":"https://doi.org/10.1109/isit.2014.6874905","title":"Reliable, deniable, and hidable communication over multipath networks","display_name":"Reliable, deniable, and hidable communication over multipath networks","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2075593748","doi":"https://doi.org/10.1109/isit.2014.6874905","mag":"2075593748"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6874905","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6874905","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/1983/0732350c-312a-47ea-b3ee-56c12b3c7f7d","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053049612","display_name":"Swanand Kadhe","orcid":"https://orcid.org/0000-0003-2006-1030"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Swanand Kadhe","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Texas A&M University","Dept. of Electr. & Comput. Eng, Texas A&M Univ., College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A&M University","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng, Texas A&M Univ., College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108615688","display_name":"Sidharth Jaggi","orcid":null},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Sidharth Jaggi","raw_affiliation_strings":["Department of Information Engineering at the Chinese University of Hong Kong","[Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong, China]"],"affiliations":[{"raw_affiliation_string":"Department of Information Engineering at the Chinese University of Hong Kong","institution_ids":["https://openalex.org/I177725633"]},{"raw_affiliation_string":"[Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong, China]","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080893953","display_name":"Mayank Bakshi","orcid":"https://orcid.org/0000-0002-6051-923X"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Mayank Bakshi","raw_affiliation_strings":["Institute of Network Coding at the Chinese University of Hong Kong",", Institute of Network Coding, Chinese University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Institute of Network Coding at the Chinese University of Hong Kong","institution_ids":["https://openalex.org/I177725633"]},{"raw_affiliation_string":", Institute of Network Coding, Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054178465","display_name":"Alex Sprintson","orcid":"https://orcid.org/0000-0002-5768-5800"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alex Sprintson","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Texas A&M University","Dept. of Electr. & Comput. Eng, Texas A&M Univ., College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A&M University","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng, Texas A&M Univ., College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5053049612"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.6383,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.74337184,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9968000054359436,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9907000064849854,"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/secrecy","display_name":"Secrecy","score":0.8693781495094299},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7433443069458008},{"id":"https://openalex.org/keywords/covert","display_name":"Covert","score":0.6819533109664917},{"id":"https://openalex.org/keywords/multipath-propagation","display_name":"Multipath propagation","score":0.6136766076087952},{"id":"https://openalex.org/keywords/alice","display_name":"Alice (programming language)","score":0.6124131083488464},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5863877534866333},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.5696073770523071},{"id":"https://openalex.org/keywords/transmitter","display_name":"Transmitter","score":0.5158102512359619},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.4195139408111572},{"id":"https://openalex.org/keywords/secure-communication","display_name":"Secure communication","score":0.41015326976776123},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.1494559645652771},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.07002514600753784}],"concepts":[{"id":"https://openalex.org/C2776452267","wikidata":"https://www.wikidata.org/wiki/Q1503443","display_name":"Secrecy","level":2,"score":0.8693781495094299},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7433443069458008},{"id":"https://openalex.org/C2779338814","wikidata":"https://www.wikidata.org/wiki/Q5179285","display_name":"Covert","level":2,"score":0.6819533109664917},{"id":"https://openalex.org/C161218011","wikidata":"https://www.wikidata.org/wiki/Q11827794","display_name":"Multipath propagation","level":3,"score":0.6136766076087952},{"id":"https://openalex.org/C2778222013","wikidata":"https://www.wikidata.org/wiki/Q1136926","display_name":"Alice (programming language)","level":2,"score":0.6124131083488464},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5863877534866333},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.5696073770523071},{"id":"https://openalex.org/C47798520","wikidata":"https://www.wikidata.org/wiki/Q190157","display_name":"Transmitter","level":3,"score":0.5158102512359619},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.4195139408111572},{"id":"https://openalex.org/C510870077","wikidata":"https://www.wikidata.org/wiki/Q7444868","display_name":"Secure communication","level":3,"score":0.41015326976776123},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.1494559645652771},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.07002514600753784},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"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/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"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/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/isit.2014.6874905","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6874905","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.755.6415","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.755.6415","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1401.4451.pdf","raw_type":"text"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire/0732350c-312a-47ea-b3ee-56c12b3c7f7d","is_oa":true,"landing_page_url":"https://hdl.handle.net/1983/0732350c-312a-47ea-b3ee-56c12b3c7f7d","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kadhe, S, Jaggi, S, Bakshi, M & Sprintson, A 2014, Reliable, deniable, and hidable communication over multipath networks. in 2014 IEEE International Symposium on Information Theory, ISIT 2014., 6874905, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers (IEEE), pp. 611-615. https://doi.org/10.1109/ISIT.2014.6874905","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/0732350c-312a-47ea-b3ee-56c12b3c7f7d","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/0732350c-312a-47ea-b3ee-56c12b3c7f7d","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kadhe, S, Jaggi, S, Bakshi, M & Sprintson, A 2014, Reliable, deniable, and hidable communication over multipath networks. in 2014 IEEE International Symposium on Information Theory, ISIT 2014., 6874905, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers (IEEE), pp. 611-615. https://doi.org/10.1109/ISIT.2014.6874905","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:research-information.bris.ac.uk:openaire/0732350c-312a-47ea-b3ee-56c12b3c7f7d","is_oa":true,"landing_page_url":"https://hdl.handle.net/1983/0732350c-312a-47ea-b3ee-56c12b3c7f7d","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kadhe, S, Jaggi, S, Bakshi, M & Sprintson, A 2014, Reliable, deniable, and hidable communication over multipath networks. in 2014 IEEE International Symposium on Information Theory, ISIT 2014., 6874905, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers (IEEE), pp. 611-615. https://doi.org/10.1109/ISIT.2014.6874905","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W12544235","https://openalex.org/W182801106","https://openalex.org/W1527181506","https://openalex.org/W1545050218","https://openalex.org/W1875021344","https://openalex.org/W2015204845","https://openalex.org/W2022381648","https://openalex.org/W2084796966","https://openalex.org/W2085467937","https://openalex.org/W2103013014","https://openalex.org/W2144007657","https://openalex.org/W2154651642","https://openalex.org/W2164918537","https://openalex.org/W2254512934","https://openalex.org/W2597388719","https://openalex.org/W2963645489","https://openalex.org/W3121904864","https://openalex.org/W4302366875","https://openalex.org/W6607508979","https://openalex.org/W6639227257"],"related_works":["https://openalex.org/W4232165261","https://openalex.org/W4251817561","https://openalex.org/W4238337057","https://openalex.org/W2079676826","https://openalex.org/W2387602844","https://openalex.org/W1548585588","https://openalex.org/W641281763","https://openalex.org/W632085907","https://openalex.org/W4389151493","https://openalex.org/W2946164306"],"abstract_inverted_index":{"We":[0,127,148],"consider":[1],"the":[2,13,30,54,92,117,125,156],"scenario":[3],"wherein":[4],"a":[5,18,22,33],"transmitter":[6],"Alice":[7,69,79],"wants":[8],"to":[9,12,52,63,75,106],"(potentially)":[10],"communicate":[11],"intended":[14],"receiver":[15],"Bob":[16,107],"over":[17,163],"multipath":[19,164],"network,":[20],"i.e.,":[21,57],"network":[23],"consisting":[24],"of":[25,32,42,47,111,119],"multiple":[26],"parallel":[27],"links,":[28],"in":[29,91,124],"presence":[31],"passive":[34],"eavesdropper":[35],"Willie,":[36],"who":[37],"observes":[38],"an":[39],"unknown":[40],"subset":[41],"links.":[43],"A":[44],"primary":[45],"goal":[46],"our":[48,109],"communication":[49,55,162],"protocol":[50],"is":[51,70,80,113],"make":[53],"\u201cdeniable\u201d,":[56],"Willie":[58],"should":[59,87,97],"not":[60,68,98,132],"be":[61,88],"able":[62],"reliably":[64],"estimate":[65],"whether":[66],"or":[67,136,138],"transmitting":[71],"any":[72,100],"covert":[73,85],"information":[74,101],"Bob.":[76],"Moreover,":[77],"if":[78],"indeed":[81],"actively":[82],"communicating,":[83],"her":[84],"messages":[86],"information-theoretically":[89],"\u201chidable\u201d":[90],"sense":[93],"that":[94,129],"Willie's":[95],"observations":[96],"leak":[99],"about":[102],"Alice's":[103],"(potential)":[104],"message":[105],"-":[108],"notion":[110,118],"hidability":[112,135],"slightly":[114],"stronger":[115],"than":[116],"information-theoretic":[120,140,144],"strong":[121],"secrecy":[122,145],"well-studied":[123],"literature.":[126],"demonstrate":[128],"deniability":[130],"does":[131,143],"imply":[133,146],"either":[134],"(weak":[137],"strong)":[139],"secrecy;":[141],"nor":[142],"deniability.":[147],"present":[149],"matching":[150],"inner":[151],"and":[152,160],"outer":[153],"bounds":[154],"on":[155],"capacity":[157],"for":[158],"deniable":[159],"hidable":[161],"networks.":[165]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}