{"id":"https://openalex.org/W2112711359","doi":"https://doi.org/10.1109/isit.2004.1365210","title":"A point-subset compression algorithm for fiber-based certificates of authenticity","display_name":"A point-subset compression algorithm for fiber-based certificates of authenticity","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2112711359","doi":"https://doi.org/10.1109/isit.2004.1365210","mag":"2112711359"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365210","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365210","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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/A5030613945","display_name":"Darko Kirovski","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"D. Kirovski","raw_affiliation_strings":["[Microsoft Research,Redmond,WA,USA]"],"affiliations":[{"raw_affiliation_string":"[Microsoft Research,Redmond,WA,USA]","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5030613945"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":0.5466,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.69934971,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"173","last_page":"173"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10388","display_name":"Advanced Steganography and Watermarking Techniques","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T10388","display_name":"Advanced Steganography and Watermarking Techniques","score":0.9984999895095825,"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/T10828","display_name":"Biometric Identification and Security","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9937999844551086,"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/computer-science","display_name":"Computer science","score":0.6622446179389954},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.6504963040351868},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5649612545967102},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.5452150106430054},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5356689691543579},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5235409736633301},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.4806070029735565},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46812546253204346},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4606362283229828},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4589482545852661},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.4541388154029846},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.42035746574401855},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.4172353148460388},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27143293619155884},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2195023000240326}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6622446179389954},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6504963040351868},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5649612545967102},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5452150106430054},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5356689691543579},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5235409736633301},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.4806070029735565},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46812546253204346},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4606362283229828},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4589482545852661},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.4541388154029846},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.42035746574401855},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.4172353148460388},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27143293619155884},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2195023000240326},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2004.1365210","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365210","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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":1,"referenced_works":["https://openalex.org/W1983754865"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2164188042","https://openalex.org/W2359992618","https://openalex.org/W4306878646","https://openalex.org/W2054495636","https://openalex.org/W3005108979","https://openalex.org/W2913191894","https://openalex.org/W4389782626","https://openalex.org/W4376138746"],"abstract_inverted_index":{"This":[0],"paper":[1],"discusses":[2],"the":[3,28,41,54,82,92,97,106,130],"certificates":[4],"of":[5,22,34,81,84,91],"authenticity":[6],"(COAs)":[7],"that":[8,30,123],"are":[9],"digitally":[10],"signed":[11],"physical":[12],"objects":[13],"with":[14,53,62],"a":[15,23,35],"unique":[16],"random":[17,20,86],"structure.":[18,87],"The":[19,69,88,111],"structure":[21],"fiber-based":[24],"COA":[25,46,58,98],"relies":[26],"on":[27],"fact":[29],"if":[31],"one":[32,43],"end-point":[33],"fiber":[36],"is":[37,48,60,76,121,133],"exposed":[38],"to":[39,77],"light,":[40],"other":[42],"illuminates.":[44],"A":[45,119],"instance":[47,59],"compressed":[49],"and":[50,103,129],"then":[51],"combined":[52],"cryptographic":[55],"hash.":[56],"Each":[57],"associated":[61],"message":[63],"recovery":[64],"using":[65,116],"issuer's":[66],"public":[67],"key.":[68],"key":[70,89],"optimization":[71],"goal":[72],"in":[73],"this":[74],"system":[75],"compress":[78],"as":[79],"much":[80,135],"entropy":[83],"COA's":[85],"parameter":[90],"point-compression":[93,127],"problem":[94,128],"is:":[95],"computing":[96],"model,":[99],"encoding":[100,112],"pixel-to-pixel":[101],"vectors,":[102],"heuristically":[104],"solving":[105,126],"asymmetric":[107],"traveling":[108],"salesman":[109],"problem.":[110],"can":[113],"be":[114],"done":[115],"arithmetic":[117],"vector.":[118],"heuristic":[120],"developed":[122],"aims":[124],"at":[125],"compression":[131],"rate":[132],"obtained":[134],"better.":[136]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}