{"id":"https://openalex.org/W4415368280","doi":"https://doi.org/10.1109/isit63088.2025.11195603","title":"Secure Convertible Codes for Passive Eavesdroppers","display_name":"Secure Convertible Codes for Passive Eavesdroppers","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368280","doi":"https://doi.org/10.1109/isit63088.2025.11195603"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195603","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195603","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/A5032628695","display_name":"Zuopeng Zhang","orcid":"https://orcid.org/0000-0002-4074-9505"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Justin Zhang","raw_affiliation_strings":["Purdue University,Department of Computer Science,West Lafayette,IN,USA"],"affiliations":[{"raw_affiliation_string":"Purdue University,Department of Computer Science,West Lafayette,IN,USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109919225","display_name":"K. V. Rashmi","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K.V. Rashmi","raw_affiliation_strings":["Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032628695"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":2.3568,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.91489908,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":98},"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9936000108718872,"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9936000108718872,"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/T10237","display_name":"Cryptography and Data Security","score":0.9850999712944031,"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.9775000214576721,"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/information-theoretic-security","display_name":"Information-theoretic security","score":0.5430999994277954},{"id":"https://openalex.org/keywords/convertible","display_name":"Convertible","score":0.5340999960899353},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.5200999975204468},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.4706000089645386},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4404999911785126},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.4189000129699707},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.40709999203681946},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.3817000091075897},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.3465000092983246}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6618000268936157},{"id":"https://openalex.org/C47191418","wikidata":"https://www.wikidata.org/wiki/Q3510462","display_name":"Information-theoretic security","level":3,"score":0.5430999994277954},{"id":"https://openalex.org/C2776116443","wikidata":"https://www.wikidata.org/wiki/Q55989","display_name":"Convertible","level":2,"score":0.5340999960899353},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.5200999975204468},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4832000136375427},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.4706000089645386},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4404999911785126},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.4189000129699707},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.40709999203681946},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.3817000091075897},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3531000018119812},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3465000092983246},{"id":"https://openalex.org/C103093684","wikidata":"https://www.wikidata.org/wiki/Q7094069","display_name":"Online codes","level":5,"score":0.3449999988079071},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.3434999883174896},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.34299999475479126},{"id":"https://openalex.org/C2776452267","wikidata":"https://www.wikidata.org/wiki/Q1503443","display_name":"Secrecy","level":2,"score":0.3384999930858612},{"id":"https://openalex.org/C24885549","wikidata":"https://www.wikidata.org/wiki/Q339678","display_name":"Distributed data store","level":2,"score":0.32510000467300415},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.31290000677108765},{"id":"https://openalex.org/C65058987","wikidata":"https://www.wikidata.org/wiki/Q7826005","display_name":"Tornado code","level":5,"score":0.2971999943256378},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29120001196861267},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.2639999985694885},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.26010000705718994},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.2533999979496002},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C3087436","wikidata":"https://www.wikidata.org/wiki/Q1386603","display_name":"Secret sharing","level":3,"score":0.25189998745918274},{"id":"https://openalex.org/C16320812","wikidata":"https://www.wikidata.org/wiki/Q1812200","display_name":"Idle","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195603","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195603","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":[{"id":"https://openalex.org/G5786708790","display_name":null,"funder_award_id":"19434090","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2118925326","https://openalex.org/W2119565742","https://openalex.org/W3081411738","https://openalex.org/W4214835034","https://openalex.org/W4280601544","https://openalex.org/W4362714550","https://openalex.org/W4401692584"],"related_works":[],"abstract_inverted_index":{"Large-scale":[0],"distributed":[1],"storage":[2,36],"systems":[3],"rely":[4],"on":[5,111,124],"erasure":[6,53],"codes":[7,54,73,87,156,177],"to":[8,16,34,94],"ensure":[9],"fault":[10],"tolerance":[11],"against":[12],"node":[13],"failures.":[14],"Due":[15],"the":[17,68,75,98,105,120,125],"observed":[18],"changing":[19],"failure":[20],"rates":[21],"within":[22],"these":[23],"systems,":[24],"code":[25,29],"redundancy":[26],"tuning,":[27],"or":[28,58],"conversion":[30,151],"has":[31,40],"been":[32],"shown":[33],"reduce":[35],"cost.":[37],"Previous":[38],"work":[39],"developed":[41],"theoretical":[42],"bounds":[43],"and":[44,116,182],"constructions":[45],"for":[46,85,179],"convertible":[47,72,86,114,159,169,176],"codes,":[48,115,170],"a":[49,95],"specialized":[50],"class":[51],"of":[52,70,77,97,127,154],"optimizing":[55],"either":[56],"access":[57,93],"bandwidth":[59],"costs":[60],"during":[61],"conversion.":[62],"In":[63],"this":[64,144],"paper,":[65],"we":[66,117,136,171],"address":[67],"challenge":[69],"securing":[71],"in":[74],"presence":[76],"an":[78,82,89,138],"eavesdropper.":[79],"We":[80,108],"introduce":[81],"eavesdropper-secrecy":[83],"model":[84],"wherein":[88],"eavesdropper":[90],"gaining":[91],"read":[92],"subset":[96],"codeword":[99,183],"symbols":[100,129],"learns":[101],"nothing":[102],"(information-theoretically)":[103],"about":[104],"underlying":[106],"message.":[107],"then":[109,118],"focus":[110],"access-cost":[112],"optimal":[113,150],"derive":[119],"information-theoretic":[121],"upper":[122],"bound":[123,146],"number":[126],"message":[128,181],"that":[130,141,173],"can":[131],"be":[132],"stored":[133],"securely.":[134],"Finally,":[135],"provide":[137],"explicit":[139],"construction":[140,163],"simultaneously":[142],"reaches":[143],"secrecy":[145],"while":[147],"admitting":[148],"accesscost":[149],"using":[152],"concatenation":[153],"nested":[155],"with":[157,165],"traditional":[158,167],"codes.":[160],"Since":[161],"our":[162],"works":[164],"all":[166,180],"access-optimal":[168,174],"show":[172],"secure":[175],"exist":[178],"length":[184],"parameters.":[185]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-21T00:00:00"}