{"id":"https://openalex.org/W2141593530","doi":"https://doi.org/10.1109/isit.2013.6620657","title":"Secure network coding for distributed secret sharing with low communication cost","display_name":"Secure network coding for distributed secret sharing with low communication cost","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2141593530","doi":"https://doi.org/10.1109/isit.2013.6620657","mag":"2141593530"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620657","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620657","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","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/A5034272491","display_name":"Nihar B. Shah","orcid":"https://orcid.org/0000-0001-5158-9677"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nihar B. Shah","raw_affiliation_strings":["Department of EECS, University of California, Berkeley, USA","Dept. of EECS, Univ. of California-Berkeley, Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of EECS, University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Dept. of EECS, Univ. of California-Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109919225","display_name":"K. V. Rashmi","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. V. Rashmi","raw_affiliation_strings":["Department of EECS, University of California, Berkeley, USA","Dept. of EECS, Univ. of California-Berkeley, Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of EECS, University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Dept. of EECS, Univ. of California-Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030620564","display_name":"Kannan Ramchandran","orcid":"https://orcid.org/0000-0002-4567-328X"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kannan Ramchandran","raw_affiliation_strings":["Department of EECS, University of California, Berkeley, USA","Dept. of EECS, Univ. of California-Berkeley, Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of EECS, University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Dept. of EECS, Univ. of California-Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034272491"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":3.016,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.92302915,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"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/T10237","display_name":"Cryptography and Data Security","score":0.9965000152587891,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9837999939918518,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/secret-sharing","display_name":"Secret sharing","score":0.8189666271209717},{"id":"https://openalex.org/keywords/eavesdropping","display_name":"Eavesdropping","score":0.7903270125389099},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7241390943527222},{"id":"https://openalex.org/keywords/secure-multi-party-computation","display_name":"Secure multi-party computation","score":0.6887491941452026},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.6773508191108704},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6713104248046875},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.6238012909889221},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.6124047636985779},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4654347002506256},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4565626382827759},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.45393574237823486},{"id":"https://openalex.org/keywords/verifiable-secret-sharing","display_name":"Verifiable secret sharing","score":0.437926322221756},{"id":"https://openalex.org/keywords/telecommunications-network","display_name":"Telecommunications network","score":0.43026962876319885},{"id":"https://openalex.org/keywords/secure-communication","display_name":"Secure communication","score":0.4242270290851593},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.4134824872016907},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.3257519602775574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24809524416923523},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.09985139966011047}],"concepts":[{"id":"https://openalex.org/C3087436","wikidata":"https://www.wikidata.org/wiki/Q1386603","display_name":"Secret sharing","level":3,"score":0.8189666271209717},{"id":"https://openalex.org/C2776788033","wikidata":"https://www.wikidata.org/wiki/Q320769","display_name":"Eavesdropping","level":2,"score":0.7903270125389099},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7241390943527222},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.6887491941452026},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.6773508191108704},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6713104248046875},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.6238012909889221},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.6124047636985779},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4654347002506256},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4565626382827759},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.45393574237823486},{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.437926322221756},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.43026962876319885},{"id":"https://openalex.org/C510870077","wikidata":"https://www.wikidata.org/wiki/Q7444868","display_name":"Secure communication","level":3,"score":0.4242270290851593},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.4134824872016907},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.3257519602775574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24809524416923523},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.09985139966011047},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2013.6620657","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620657","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.719.1668","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.719.1668","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eecs.berkeley.edu/%7Erashmikv/papers/secret_sharing_ISIT_2013.pdf","raw_type":"text"}],"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/W18139138","https://openalex.org/W1985405465","https://openalex.org/W2006453614","https://openalex.org/W2006947308","https://openalex.org/W2048235391","https://openalex.org/W2051529985","https://openalex.org/W2092148937","https://openalex.org/W2123562143","https://openalex.org/W2141420453","https://openalex.org/W2141593530","https://openalex.org/W2150777202","https://openalex.org/W2151964399","https://openalex.org/W2170561193","https://openalex.org/W2399610060","https://openalex.org/W2949476897","https://openalex.org/W3106482607","https://openalex.org/W6600739974","https://openalex.org/W6682305249"],"related_works":["https://openalex.org/W2368710903","https://openalex.org/W2772112465","https://openalex.org/W4386360526","https://openalex.org/W2157628738","https://openalex.org/W2376754011","https://openalex.org/W3022352698","https://openalex.org/W1616202922","https://openalex.org/W2810615277","https://openalex.org/W2141593530","https://openalex.org/W2363798811"],"abstract_inverted_index":{"Shamir's":[0],"(n,":[1],"k)":[2],"threshold":[3],"secret":[4,48,60,86,157],"sharing":[5,61,87,158],"is":[6,100,184,188,213,222],"an":[7,83,109],"important":[8],"component":[9],"of":[10,26,46,59,111,127,144,156,166,181,194,219,239,247],"several":[11,240],"cryptographic":[12,241],"protocols,":[13],"such":[14],"as":[15],"those":[16],"for":[17,85,172,215,236],"secure":[18],"multiparty-computation.":[19],"These":[20],"protocols":[21,242],"typically":[22],"assume":[23],"the":[24,31,39,44,47,57,63,95,106,125,138,141,145,153,175,178,195,207,229],"presence":[25],"direct":[27,68],"communication":[28,69,154,179],"links":[29,70],"from":[30],"dealer":[32,40,64],"to":[33,49,71,134,243],"all":[34,72],"participants,":[35,73],"in":[36,137,202,206,228],"which":[37,130,162],"case":[38,126],"can":[41],"directly":[42],"pass":[43],"shares":[45],"every":[50],"participant.":[51],"In":[52,140],"this":[53],"paper,":[54,146],"we":[55,93,147],"consider":[56],"problem":[58,115],"when":[62],"does":[65],"not":[66],"have":[67],"and":[74,103,119,122,186,221],"instead,":[75],"they":[76],"form":[77],"a":[78,112,117,191,210,216,244],"general":[79],"network.":[80],"We":[81,169,198],"present":[82],"algorithm":[84,99,183,233],"over":[88,159],"networks":[89,173],"that":[90,171,212],"satisfy":[91],"what":[92],"call":[94],"k-propagating-dealer":[96,176],"condition.":[97],"The":[98],"communication-efficient,":[101],"distributed":[102,118],"deterministic.":[104],"Interestingly,":[105],"solution":[107],"constitutes":[108],"instance":[110],"network":[113],"coding":[114],"admitting":[116],"deterministic":[120],"solution,":[121],"furthermore,":[123,187],"handles":[124],"nodal-eavesdropping,":[128],"about":[129],"very":[131],"little":[132],"appears":[133],"be":[135,165],"known":[136],"literature.":[139],"second":[142],"part":[143],"derive":[148],"information-theoretic":[149],"lower":[150,196],"bounds":[151],"on":[152],"complexity":[155,180],"any":[160],"network,":[161],"may":[163],"also":[164,199],"independent":[167],"interest.":[168],"show":[170,200],"satisfying":[174],"condition,":[177],"our":[182],"\u0398(n),":[185],"always":[189],"within":[190],"constant":[192],"factor":[193],"bound.":[197],"that,":[201],"contrast,":[203],"existing":[204],"solutions":[205],"literature":[208],"entail":[209],"communication-complexity":[211],"superlinear":[214],"wide":[217],"class":[218,246],"networks,":[220],"\u0398(n":[223],"<sup":[224],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[225],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[226],")":[227],"worst":[230],"case.":[231],"Our":[232],"thus":[234],"allows":[235],"efficient":[237],"generalization":[238],"large":[245],"networks.":[248]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}