{"id":"https://openalex.org/W4415367908","doi":"https://doi.org/10.1109/isit63088.2025.11195691","title":"Constrained Optimization of Access Functions in Uniform Secret Sharing","display_name":"Constrained Optimization of Access Functions in Uniform Secret Sharing","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367908","doi":"https://doi.org/10.1109/isit63088.2025.11195691"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195691","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195691","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","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/A5114513604","display_name":"Amirhosein Morteza","orcid":null},"institutions":[{"id":"https://openalex.org/I189196454","display_name":"The University of Texas at Arlington","ror":"https://ror.org/019kgqr73","country_code":"US","type":"education","lineage":["https://openalex.org/I189196454"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Amirhosein Morteza","raw_affiliation_strings":["University of Texas at Arlington,Department of Computer Science &#x0026; Engineering,Arlington,TX,76019"],"affiliations":[{"raw_affiliation_string":"University of Texas at Arlington,Department of Computer Science &#x0026; Engineering,Arlington,TX,76019","institution_ids":["https://openalex.org/I189196454"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047776960","display_name":"R\u00e9mi A. Chou","orcid":"https://orcid.org/0000-0003-4431-3175"},"institutions":[{"id":"https://openalex.org/I189196454","display_name":"The University of Texas at Arlington","ror":"https://ror.org/019kgqr73","country_code":"US","type":"education","lineage":["https://openalex.org/I189196454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R\u00e9mi A. Chou","raw_affiliation_strings":["University of Texas at Arlington,Department of Computer Science &#x0026; Engineering,Arlington,TX,76019"],"affiliations":[{"raw_affiliation_string":"University of Texas at Arlington,Department of Computer Science &#x0026; Engineering,Arlington,TX,76019","institution_ids":["https://openalex.org/I189196454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5114513604"],"corresponding_institution_ids":["https://openalex.org/I189196454"],"apc_list":null,"apc_paid":null,"fwci":2.8331,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.92799796,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9983999729156494,"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.9983999729156494,"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/T11504","display_name":"Advanced Authentication Protocols Security","score":0.9718000292778015,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9562000036239624,"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/function","display_name":"Function (biology)","score":0.6316999793052673},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5455999970436096},{"id":"https://openalex.org/keywords/concave-function","display_name":"Concave function","score":0.4156000018119812},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4041999876499176},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.3869999945163727},{"id":"https://openalex.org/keywords/secret-sharing","display_name":"Secret sharing","score":0.3869999945163727},{"id":"https://openalex.org/keywords/access-structure","display_name":"Access structure","score":0.3849000036716461},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.384799987077713},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.3578000068664551}],"concepts":[{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.6316999793052673},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5455999970436096},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4674000144004822},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44449999928474426},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4332999885082245},{"id":"https://openalex.org/C66690126","wikidata":"https://www.wikidata.org/wiki/Q2914302","display_name":"Concave function","level":3,"score":0.4156000018119812},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4041999876499176},{"id":"https://openalex.org/C3087436","wikidata":"https://www.wikidata.org/wiki/Q1386603","display_name":"Secret sharing","level":3,"score":0.3869999945163727},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3869999945163727},{"id":"https://openalex.org/C2778950925","wikidata":"https://www.wikidata.org/wiki/Q4672474","display_name":"Access structure","level":4,"score":0.3849000036716461},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.384799987077713},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.3578000068664551},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.35749998688697815},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3555999994277954},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.35420000553131104},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3336000144481659},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3253999948501587},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3125999867916107},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3107999861240387},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2897000014781952},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.2750999927520752},{"id":"https://openalex.org/C20538924","wikidata":"https://www.wikidata.org/wiki/Q822139","display_name":"Characteristic function (probability theory)","level":3,"score":0.2614000141620636},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.2565999925136566},{"id":"https://openalex.org/C70000936","wikidata":"https://www.wikidata.org/wiki/Q4672467","display_name":"Access method","level":2,"score":0.2549999952316284}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195691","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195691","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W51265332","https://openalex.org/W324663928","https://openalex.org/W1534695542","https://openalex.org/W1566541904","https://openalex.org/W1976615583","https://openalex.org/W1977854174","https://openalex.org/W2080911030","https://openalex.org/W2080975816","https://openalex.org/W2099111195","https://openalex.org/W2138033199","https://openalex.org/W2141420453","https://openalex.org/W2159401786","https://openalex.org/W2524272550","https://openalex.org/W2899869462","https://openalex.org/W2990885002","https://openalex.org/W3040061546","https://openalex.org/W4386066224","https://openalex.org/W4388667011","https://openalex.org/W4388767294","https://openalex.org/W4392502502","https://openalex.org/W4405182467"],"related_works":[],"abstract_inverted_index":{"For":[0],"uniform":[1,58],"secret":[2,26,59],"sharing,":[3],"the":[4,19,25,38,66,94,102,108,150],"access":[5,45,67,86,95,110,124],"function":[6,46,68,96,111,133],"takes":[7],"as":[8,17,135],"input,":[9],"an":[10],"integer":[11],"<tex":[12,28],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[13,29],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$i$</tex>":[14,30],"and":[15,88],"returns":[16],"output":[18],"fraction":[20],"of":[21,65,85,123,138,149],"information":[22],"leaked":[23],"about":[24],"by":[27,118],"shares.":[31],"Most":[32],"previous":[33],"works":[34],"aimed":[35],"to":[36,92,114],"characterize":[37,145],"minimum":[39,115],"share":[40,103,116,152],"size,":[41],"considering":[42],"a":[43,83,131,136,146],"fixed":[44],"with":[47],"all":[48,63],"outputs":[49,64],"predefined.":[50],"By":[51],"contrast,":[52],"in":[53,97],"this":[54,98,121],"paper,":[55],"we":[56,143],"consider":[57],"sharing":[60],"where":[61],"not":[62],"are":[69,75],"predefined,":[70],"instead,":[71],"only":[72],"upper":[73],"bounds":[74],"specified":[76],"for":[77],"some":[78],"outputs.":[79],"These":[80],"constraints":[81],"define":[82],"set":[84,99,122],"functions,":[87],"our":[89],"goal":[90],"is":[91,130],"find":[93],"that":[100,112,128],"minimizes":[101],"sizes.":[104,153],"We":[105,126],"(i)":[106],"determine":[107],"optimal":[109,151],"leads":[113],"sizes":[117],"optimizing":[119],"over":[120],"functions.":[125,141],"show":[127],"it":[129],"convex":[132],"expressed":[134],"combination":[137],"piece-wise":[139],"linear":[140],"Additionally,":[142],"(ii)":[144],"closed-form":[147],"expression":[148]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}