{"id":"https://openalex.org/W4404132837","doi":"https://doi.org/10.1109/tcomm.2024.3493802","title":"Constructions and Lower Bounds for Evolving Two-Threshold Secret Sharing Schemes","display_name":"Constructions and Lower Bounds for Evolving Two-Threshold Secret Sharing Schemes","publication_year":2024,"publication_date":"2024-11-07","ids":{"openalex":"https://openalex.org/W4404132837","doi":"https://doi.org/10.1109/tcomm.2024.3493802"},"language":"en","primary_location":{"id":"doi:10.1109/tcomm.2024.3493802","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2024.3493802","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-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/A5066040641","display_name":"Paolo D\u2019Arco","orcid":"https://orcid.org/0000-0002-9271-4240"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Paolo D'Arco","raw_affiliation_strings":["Department of Computer Science, University of Salerno, Fisciano, Italy","Department of Computer Science, University of Salerno, via Giovanni Paolo II, Fisciano (SA), Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Salerno, Fisciano, Italy","institution_ids":["https://openalex.org/I131729948"]},{"raw_affiliation_string":"Department of Computer Science, University of Salerno, via Giovanni Paolo II, Fisciano (SA), Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026243357","display_name":"Roberto De Prisco","orcid":"https://orcid.org/0000-0003-0559-6897"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Roberto De Prisco","raw_affiliation_strings":["Department of Computer Science, University of Salerno, Fisciano, Italy","Department of Computer Science, University of Salerno, via Giovanni Paolo II, Fisciano (SA), Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Salerno, Fisciano, Italy","institution_ids":["https://openalex.org/I131729948"]},{"raw_affiliation_string":"Department of Computer Science, University of Salerno, via Giovanni Paolo II, Fisciano (SA), Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078114782","display_name":"Alfredo De Santis","orcid":"https://orcid.org/0000-0001-8962-1919"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alfredo De Santis","raw_affiliation_strings":["Department of Computer Science, University of Salerno, Fisciano, Italy","Department of Computer Science, University of Salerno, via Giovanni Paolo II, Fisciano (SA), Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Salerno, Fisciano, Italy","institution_ids":["https://openalex.org/I131729948"]},{"raw_affiliation_string":"Department of Computer Science, University of Salerno, via Giovanni Paolo II, Fisciano (SA), Italy","institution_ids":["https://openalex.org/I131729948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066040641"],"corresponding_institution_ids":["https://openalex.org/I131729948"],"apc_list":null,"apc_paid":null,"fwci":0.3637,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.68607001,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"73","issue":"5","first_page":"3240","last_page":"3253"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9948999881744385,"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.9948999881744385,"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/T11017","display_name":"Chaos-based Image/Signal Encryption","score":0.9728999733924866,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11504","display_name":"Advanced Authentication Protocols Security","score":0.9684000015258789,"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.5740764737129211},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4299360513687134},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39726367592811584},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3722662925720215},{"id":"https://openalex.org/keywords/electronic-engineering","display_name":"Electronic engineering","score":0.3342071771621704},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32692480087280273},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31716659665107727},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.24409440159797668}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5740764737129211},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4299360513687134},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39726367592811584},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3722662925720215},{"id":"https://openalex.org/C24326235","wikidata":"https://www.wikidata.org/wiki/Q126095","display_name":"Electronic engineering","level":1,"score":0.3342071771621704},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32692480087280273},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31716659665107727},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.24409440159797668},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcomm.2024.3493802","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2024.3493802","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1968182724","https://openalex.org/W2097407854","https://openalex.org/W2099000090","https://openalex.org/W2120551550","https://openalex.org/W2141420453","https://openalex.org/W2535739715","https://openalex.org/W2765985381","https://openalex.org/W2892384384","https://openalex.org/W2970097841","https://openalex.org/W3022074522","https://openalex.org/W3090813372","https://openalex.org/W3121126693","https://openalex.org/W4249267162","https://openalex.org/W4312571939","https://openalex.org/W4323338558","https://openalex.org/W4360770951","https://openalex.org/W4383900237"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2989452537","https://openalex.org/W2052122378","https://openalex.org/W2544423928","https://openalex.org/W2062023542"],"abstract_inverted_index":{"In":[0,10,292],"this":[1],"paper":[2,315],"we":[3,209,261,282,294],"consider":[4],"evolving":[5],"2-threshold":[6],"secret":[7,53,66,121,153,176],"sharing":[8,54,67,122,154,177],"schemes.":[9,55],"such":[11,128],"schemes,":[12],"the":[13,28,73,86,89,92,95,98,103,106,109,144,162,185,193,205,211,216,252,267,271,285,302,314],"number":[14,206],"of":[15,58,85,91,94,105,108,207,248,270,287,299,305],"participants":[16,26,101],"grows":[17],"over":[18,75,218],"time":[19],"and":[20,30,102,256,319],"is":[21,125,132,181,235],"potentially":[22],"unbounded,":[23],"any":[24,37,236],"two":[25],"reconstruct":[27],"secret,":[29],"no":[31],"single":[32],"participant":[33],"can":[34,69],"figure":[35],"out":[36],"partial":[38],"information":[39],"about":[40],"it.":[41],"They":[42],"are":[43],"referred":[44],"to":[45,242],"as":[46,72],"<inline-formula":[47,60,78,115,136,147,170,221,229,306],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[48,61,79,116,137,148,171,222,230,307],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">":[49,62,80,117,138,149,172,223,231,308],"<tex-math":[50,63,81,118,139,150,173,224,232,309],"notation=\"LaTeX\">$(2,\\infty)$":[51,64,151,174],"</tex-math></inline-formula>-threshold":[52,65,120,152,175],"The":[56],"cost":[57,130,157,180,212,254],"a":[59,112,129,168,201,258,296],"scheme":[68,155,178],"be":[70],"measured":[71],"maximum,":[74],"all":[76,219],"possible":[77,220],"notation=\"LaTeX\">$n\\ge":[82,225],"2$":[83],"</tex-math></inline-formula>,":[84,227],"ratio":[87],"between":[88],"sum":[90,104],"lengths":[93,107],"shares":[96,110],"for":[97,111,251,266,278],"first":[99],"n":[100],"(standard)":[113],"optimal":[114,249],"notation=\"LaTeX\">$(2,n)$":[119],"scheme.":[123,189],"It":[124],"known":[126,146,188],"that":[127,195],"measure":[131,255],"lower":[133,202,268,290,297,303],"bounded":[134],"by":[135,192,214],"notation=\"LaTeX\">$3/2$":[140,310],"</tex-math></inline-formula>.":[141,311],"Moreover,":[142],"currently,":[143],"best":[145,187],"has":[156],"1.59375.":[158],"Our":[159],"contribution":[160],"improves":[161],"state-of-the-art":[163],"in":[164,196],"several":[165],"ways:\u2022We":[166],"describe":[167],"new":[169],"whose":[179],"1.5859375,":[182],"improving":[183,301],"on":[184,204],"previous":[186],"\u2022":[190,244,273],"Motivated":[191],"fact":[194],"some":[197,263,321],"applications":[198],"one":[199],"knows":[200],"bound":[203,269,298,304],"participants,":[208],"generalize":[210],"measure,":[213],"considering":[215],"maximum":[217],"z_{0}$":[226],"where":[228],"notation=\"LaTeX\">$z_{0}$":[233],"</tex-math></inline-formula>":[234],"integer":[237],"greater":[238],"than":[239],"or":[240],"equal":[241],"2.":[243],"We":[245,312],"provide":[246],"constructions":[247],"schemes":[250],"generalized":[253],"through":[257],"theoretical":[259],"analysis":[260],"prove":[262],"interesting":[264],"properties":[265],"cost.":[272],"By":[274],"using":[275],"algorithmic":[276],"techniques,":[277],"reasonably":[279],"small":[280],"cases,":[281],"exhaustively":[283],"study":[284],"problem":[286],"finding":[288],"tight":[289],"bounds.":[291],"particular,":[293],"obtain":[295],"1.534375,":[300],"close":[313],"summarizing":[316],"our":[317],"findings":[318],"discussing":[320],"open":[322],"issues.":[323]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-22T23:10:17.713674","created_date":"2024-11-08T00:00:00"}