{"id":"https://openalex.org/W2944199752","doi":"https://doi.org/10.1109/is.2018.8710590","title":"Time Bounded Incompressible Theorem Reversed","display_name":"Time Bounded Incompressible Theorem Reversed","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2944199752","doi":"https://doi.org/10.1109/is.2018.8710590","mag":"2944199752"},"language":"en","primary_location":{"id":"doi:10.1109/is.2018.8710590","is_oa":false,"landing_page_url":"https://doi.org/10.1109/is.2018.8710590","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Intelligent Systems (IS)","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/A5054293792","display_name":"Andr\u00e9 Souto","orcid":"https://orcid.org/0000-0001-8792-959X"},"institutions":[{"id":"https://openalex.org/I4210120471","display_name":"Instituto de Telecomunica\u00e7\u00f5es","ror":"https://ror.org/02ht4fk33","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210120471"]},{"id":"https://openalex.org/I141596103","display_name":"University of Lisbon","ror":"https://ror.org/01c27hj86","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Andre Souto","raw_affiliation_strings":["Faculdade Ci\u00eancias Universidade de Lisboa Lasige, Instituto de Telecomunica\u00e7\u00f5es, Lisboa, Portugal"],"affiliations":[{"raw_affiliation_string":"Faculdade Ci\u00eancias Universidade de Lisboa Lasige, Instituto de Telecomunica\u00e7\u00f5es, Lisboa, Portugal","institution_ids":["https://openalex.org/I4210120471","https://openalex.org/I141596103"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5054293792"],"corresponding_institution_ids":["https://openalex.org/I141596103","https://openalex.org/I4210120471"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24295831,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"31","issue":null,"first_page":"443","last_page":"447"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9997000098228455,"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":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T10237","display_name":"Cryptography and Data Security","score":0.9994999766349792,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6286483407020569},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.5227863192558289},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5189499855041504},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5152435898780823},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.43040990829467773},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4063272476196289},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3372487425804138},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32277023792266846},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1208263635635376}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6286483407020569},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.5227863192558289},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5189499855041504},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5152435898780823},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.43040990829467773},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4063272476196289},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3372487425804138},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32277023792266846},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1208263635635376},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/is.2018.8710590","is_oa":false,"landing_page_url":"https://doi.org/10.1109/is.2018.8710590","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Intelligent Systems (IS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1517959386","https://openalex.org/W1548880861","https://openalex.org/W1569885018","https://openalex.org/W1638203394","https://openalex.org/W1979479253","https://openalex.org/W1998918799","https://openalex.org/W2006936891","https://openalex.org/W2021736779","https://openalex.org/W2054496431","https://openalex.org/W2079364662","https://openalex.org/W2083237534","https://openalex.org/W2137953452","https://openalex.org/W2178059285","https://openalex.org/W2399200320","https://openalex.org/W2504959571","https://openalex.org/W2582697902","https://openalex.org/W2611093107","https://openalex.org/W2802657683","https://openalex.org/W2963757884","https://openalex.org/W6633492210"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2075768550","https://openalex.org/W3022218857","https://openalex.org/W2369178846","https://openalex.org/W2370289839","https://openalex.org/W2082716031","https://openalex.org/W2933494595","https://openalex.org/W4313347705","https://openalex.org/W1568049691","https://openalex.org/W3048427291"],"abstract_inverted_index":{"Security":[0],"of":[1,9,25,28,36,45,53,55,85,115,120,124,151,170,177],"data":[2],"is":[3,48,66],"crucial":[4],"in":[5,92,100,185],"nowadays":[6],"societies.":[7],"One":[8],"the":[10,16,26,43,51,56,64,70,83,105,113,122,149,178,191],"most":[11],"basic":[12],"security":[13,44,65],"protocols":[14,18,47],"are":[15,203],"zero-knowledge":[17],"where":[19],"a":[20,23,29,129,146,167,204],"prover":[21],"convinces":[22],"verifier":[24],"knowledge":[27],"secret":[30],"information":[31,71],"without":[32],"revealing":[33],"that":[34,79,88,127,154],"piece":[35],"information.":[37],"The":[38],"tradicional":[39],"approach":[40],"to":[41,62,77,193,196,200],"prove":[42,63],"these":[46,93],"based":[49,67],"on":[50,69,104],"(im)possibility":[52],"simulation":[54],"interactions.":[57],"A":[58],"more":[59],"fundamental":[60],"way":[61],"solely":[68],"conveyed":[72],"about":[73],"proof.":[74],"In":[75,108],"order":[76],"establish":[78],"connection":[80],"and":[81,99,202],"quantifying":[82],"number":[84,123,150],"possible":[86],"transformations":[87],"one":[89],"can":[90],"use":[91,96],"protocols,":[94],"we":[95,102,111,143,173],"Kolmogorov":[97,181],"complexity":[98],"particular":[101],"focus":[103],"incompressibility":[106],"theorem.":[107],"this":[109,116,171],"paper":[110,172],"study":[112,144],"counterpart":[114],"theorem":[117],"by,":[118],"instead":[119],"providing":[121],"x":[125,152],"such":[126,153],"for":[128,145,207],"fixed":[130,147],"y,":[131],"K":[132,138,155,161],"<sup":[133,139,156,162],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[134,140,157,163],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">t</sup>":[135,141,158,164],"(x|y)":[136,159],"\u2248":[137,160],"(x),":[142],"y":[148],"(x).":[165],"As":[166],"second":[168],"contribution":[169],"present":[174],"an":[175],"extension":[176],"results":[179],"regarding":[180],"one-way":[182],"functions":[183],"started":[184],"[3].":[186],"This":[187],"cryptographic":[188],"primitives":[189],"have":[190],"property":[192],"be":[194],"easy":[195],"compute":[197],"but":[198],"hard":[199],"invert":[201],"basilar":[205],"ingredient":[206],"digital":[208],"security.":[209]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}