{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T06:51:32Z","timestamp":1730271092653,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1109\/is.2018.8710590","type":"proceedings-article","created":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T21:58:26Z","timestamp":1557439106000},"page":"443-447","source":"Crossref","is-referenced-by-count":0,"title":["Time Bounded Incompressible Theorem Reversed"],"prefix":"10.1109","author":[{"given":"Andre","family":"Souto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90204-M"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0013-1_19"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1134\/S0081543811060125"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80043-1"},{"key":"ref15","first-page":"397","author":"souto","year":"2018","journal-title":"Witness Hiding Without Extractors or Simulators LNCS (10936)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1324215.1324225"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1991.160263"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-012-9418-z"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12521-2","article-title":"Modern cryptography, probabilistic proofs and pseudo-randomness","author":"goldreich","year":"1999","journal-title":"Algorithms and Combinatorics"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3390\/cryptography2020009"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258590"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891"},{"key":"ref2","first-page":"195","article-title":"Information theoretic security","author":"antunes","year":"2009","journal-title":"chapter Cryptographic Security of Individual Instances"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-011-0025-1"},{"key":"ref9","first-page":"659","article-title":"Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses","volume":"31","author":"klivans","year":"1998","journal-title":"SIAM Journal on Computing"}],"event":{"name":"2018 International Conference on Intelligent Systems (IS)","start":{"date-parts":[[2018,9,25]]},"location":"Funchal - Madeira, Portugal","end":{"date-parts":[[2018,9,27]]}},"container-title":["2018 International Conference on Intelligent Systems (IS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8703185\/8710451\/08710590.pdf?arnumber=8710590","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T23:32:59Z","timestamp":1558999979000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8710590\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/is.2018.8710590","relation":{},"subject":[],"published":{"date-parts":[[2018,9]]}}}