{"id":"https://openalex.org/W2171323369","doi":"https://doi.org/10.1109/isit.2009.5205847","title":"Using Kolmogorov complexity for understanding some limitations on steganography","display_name":"Using Kolmogorov complexity for understanding some limitations on steganography","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2171323369","doi":"https://doi.org/10.1109/isit.2009.5205847","mag":"2171323369"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205847","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205847","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"preprint","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/A5028123461","display_name":"Boris Ryabko","orcid":"https://orcid.org/0000-0002-7232-9644"},"institutions":[{"id":"https://openalex.org/I4210137651","display_name":"Institute of Computational Technologies","ror":"https://ror.org/02x3mf211","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210097085","https://openalex.org/I4210137651"]},{"id":"https://openalex.org/I4210105890","display_name":"Siberian State University of Telecommunications and Informatics","ror":"https://ror.org/019vbp610","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210105890"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Boris Ryabko","raw_affiliation_strings":["Institute of Computational Technologies, Siberian State University of Telecommunications and Informatics, Novosibirsk, Russia"],"affiliations":[{"raw_affiliation_string":"Institute of Computational Technologies, Siberian State University of Telecommunications and Informatics, Novosibirsk, Russia","institution_ids":["https://openalex.org/I4210105890","https://openalex.org/I4210137651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064627349","display_name":"Daniil Ryabko","orcid":"https://orcid.org/0000-0001-5080-9930"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210138412","display_name":"Centre de recherche Inria Lille - Nord Europe","ror":"https://ror.org/04eej9726","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210138412"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Daniil Ryabko","raw_affiliation_strings":["INRIA Lille Nord Europe, France"],"affiliations":[{"raw_affiliation_string":"INRIA Lille Nord Europe, France","institution_ids":["https://openalex.org/I4210138412","https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028123461"],"corresponding_institution_ids":["https://openalex.org/I4210137651","https://openalex.org/I4210105890"],"apc_list":null,"apc_paid":null,"fwci":0.33415375,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.71019181,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"2733","last_page":"2736"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.998199999332428,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/steganography","display_name":"Steganography","score":0.844076931476593},{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.7173236608505249},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6464318633079529},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5983908176422119},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5499002933502197},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4777730703353882},{"id":"https://openalex.org/keywords/transmission","display_name":"Transmission (telecommunications)","score":0.4631146490573883},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44164031744003296},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4329512417316437},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4237402379512787},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32136350870132446},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.17074227333068848},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.13957345485687256},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13852378726005554},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.1347806751728058}],"concepts":[{"id":"https://openalex.org/C108801101","wikidata":"https://www.wikidata.org/wiki/Q15032","display_name":"Steganography","level":3,"score":0.844076931476593},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.7173236608505249},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6464318633079529},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5983908176422119},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5499002933502197},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4777730703353882},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.4631146490573883},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44164031744003296},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4329512417316437},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4237402379512787},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32136350870132446},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.17074227333068848},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.13957345485687256},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13852378726005554},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.1347806751728058},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2009.5205847","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205847","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1638203394","https://openalex.org/W1965487995","https://openalex.org/W1969965307","https://openalex.org/W1979734360","https://openalex.org/W2005097301","https://openalex.org/W2023140349","https://openalex.org/W2113832384","https://openalex.org/W2120078031","https://openalex.org/W2161439181","https://openalex.org/W2295425164","https://openalex.org/W4230960895","https://openalex.org/W4299918108"],"related_works":["https://openalex.org/W2521839693","https://openalex.org/W2969135852","https://openalex.org/W2188948172","https://openalex.org/W38533693","https://openalex.org/W2892069487","https://openalex.org/W2741842698","https://openalex.org/W1760333999","https://openalex.org/W1485395638","https://openalex.org/W2265739152","https://openalex.org/W2099977515"],"abstract_inverted_index":{"Perfectly":[0],"secure":[1],"steganographic":[2],"systems":[3],"have":[4,75],"been":[5],"recently":[6],"described":[7],"for":[8,23,45],"a":[9,64,69],"wide":[10],"class":[11],"of":[12,14,18,20,31,43,60,77],"sources":[13,42],"covertexts.":[15],"The":[16,52],"speed":[17],"transmission":[19],"secret":[21],"information":[22],"these":[24],"stegosystems":[25,48],"is":[26,55],"proportional":[27],"to":[28,74],"the":[29,32,58,78],"length":[30],"covertext.":[33],"In":[34],"this":[35],"work":[36],"we":[37],"show":[38],"that":[39,56],"there":[40],"are":[41],"covertexts":[44,62],"which":[46],"such":[47],"do":[49],"not":[50],"exist.":[51],"key":[53],"observation":[54],"if":[57],"set":[59],"possible":[61],"has":[63,73],"maximal":[65],"Kolmogorov":[66],"complexity,":[67],"then":[68],"high-speed":[70],"perfect":[71],"stegosystem":[72],"complexity":[76],"same":[79],"order.":[80]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}