{"id":33517,"date":"2019-10-31T21:53:04","date_gmt":"2019-10-31T18:53:04","guid":{"rendered":"https:\/\/prohoster.info\/blog\/predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1\/"},"modified":"2019-10-31T21:53:04","modified_gmt":"2019-10-31T18:53:04","slug":"predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1","status":"publish","type":"post","link":"https:\/\/prohoster.info\/sv\/blog\/news\/predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1","title":{"rendered":"En mer effektiv metod f\u00f6r att best\u00e4mma kollisionens prefix f\u00f6r SHA-1 har presenterats","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"<p>Forskare fr\u00e5n det franska statliga institutet f\u00f6r forskning inom datavetenskap och automation (INRIA) och Nanyang Technological University (Singapore) <noindex><a rel=\"nofollow\" href=\"https:\/\/mailarchive.ietf.org\/arch\/msg\/cfrg\/NhiGvOFzcEw108YLwF_ndyfB1k4\">har utvecklat<\/a><\/noindex> ett f\u00f6rb\u00e4ttrat <noindex><a rel=\"nofollow\" href=\"https:\/\/eprint.iacr.org\/2019\/459\">metod<\/a><\/noindex> <noindex><a rel=\"nofollow\" href=\"https:\/\/eprint.iacr.org\/2019\/459.pdf\">attacker<\/a><\/noindex> SHA-1-algoritm som avsev\u00e4rt f\u00f6renklar skapandet av tv\u00e5 olika dokument med samma SHA-1-hashar. K\u00e4rnan i metoden g\u00e5r ut p\u00e5 att minska operationen f\u00f6r fullst\u00e4ndig s\u00f6kning av kollisioner i SHA-1 till <noindex><a rel=\"nofollow\" href=\"https:\/\/ru.wikipedia.org\/wiki\/%D0%9A%D0%BE%D0%BB%D0%BB%D0%B8%D0%B7%D0%B8%D0%BE%D0%BD%D0%BD%D0%B0%D1%8F_%D0%B0%D1%82%D0%B0%D0%BA%D0%B0#%D0%9A%D0%BE%D0%BB%D0%BB%D0%B8%D0%B7%D0%B8%D0%BE%D0%BD%D0%BD%D0%B0%D1%8F_%D0%B0%D1%82%D0%B0%D0%BA%D0%B0_%D1%81_%D0%B7%D0%B0%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D0%BC_%D0%BF%D1%80%D0%B5%D1%84%D0%B8%D0%BA%D1%81%D0%BE%D0%BC\">en kollisionattack med ett givet prefix<\/a><\/noindex>, d\u00e4r en kollision uppst\u00e5r vid f\u00f6rekomsten av vissa prefix, oavsett annan information i upps\u00e4ttningen. Med andra ord kan tv\u00e5 f\u00f6rdefinierade prefix ber\u00e4knas, och om ett ansluts till ett dokument och det andra till det andra \u2014 kommer de resulterande SHA-1-hasharna f\u00f6r dessa filer att vara identiska.<\/p>\n<p>Denna typ av attack kr\u00e4ver fortfarande enorma ber\u00e4kningar och att hitta prefix \u00e4r fortfarande mer komplicerat \u00e4n vanliga kollisioner, men den praktiska effektiviteten av resultatet \u00e4r avsev\u00e4rt h\u00f6gre. Om den snabbaste metoden f\u00f6r att hitta prefixkollisioner i SHA-1 hittills kr\u00e4vde 277,1 operationer, minskar den nya metoden antalet ber\u00e4kningar till intervallet 266,9 till 269,4. Vid s\u00e5dan niv\u00e5 av ber\u00e4kningar uppskattas kostnaden f\u00f6r attacken till mindre \u00e4n hundratusen dollar, vilket \u00e4r \u00f6verkomligt f\u00f6r underr\u00e4ttelsetj\u00e4nster och stora f\u00f6retag. F\u00f6r j\u00e4mf\u00f6relse kr\u00e4vs cirka 264,7 operationer f\u00f6r att hitta en vanlig kollision.<\/p>\n<p>I <noindex><a rel=\"nofollow\" href=\"https:\/\/www.opennet.ru\/opennews\/art.shtml?num=46091\">den f\u00f6rra<\/a><\/noindex> <noindex><a rel=\"nofollow\" href=\"https:\/\/shattered.it\/\">demonstrationer<\/a><\/noindex>  Google av m\u00f6jligheten att generera olika PDF-filer med samma SHA-1-hash <noindex><a rel=\"nofollow\" href=\"https:\/\/www.opennet.ru\/opennews\/art.shtml?num=46102\">anv\u00e4ndes<\/a><\/noindex> En trick f\u00f6r att kombinera tv\u00e5 dokument till en fil, genom att v\u00e4xla mellan de synliga lagren och f\u00f6rflytta markeringen av lagret till kollisionsomr\u00e5det. Med n\u00e4ra nog samma resurskostnader (f\u00f6r att hitta den f\u00f6rsta SHA-1-kollisionsen tillbringade Google ett \u00e5r med ber\u00e4kningar p\u00e5 en kluster av 110 GPU:er) g\u00f6r den nya metoden det m\u00f6jligt att uppn\u00e5 en SHA-1-matchning f\u00f6r tv\u00e5 slumpm\u00e4ssiga datam\u00e4ngder. Praktiskt sett kan man f\u00f6rbereda TLS-certifikat som n\u00e4mner olika dom\u00e4ner men har identiska SHA-1-hashar. Denna m\u00f6jlighet g\u00f6r det m\u00f6jligt f\u00f6r en o\u00e4rlig certifikatutf\u00e4rdare att skapa ett certifikat f\u00f6r en digital signatur som kan anv\u00e4ndas f\u00f6r att auktorisera falska certifikat f\u00f6r slumpm\u00e4ssiga dom\u00e4ner. Problemet kan ocks\u00e5 utnyttjas f\u00f6r att kompromettera protokoll som f\u00f6rlitar sig p\u00e5 att det inte finns n\u00e5gra kollisioner, s\u00e5som TLS, SSH och IPsec.<\/p>\n<p>Den f\u00f6reslagna strategin f\u00f6r prefixs\u00f6kning f\u00f6r kollisioner inneb\u00e4r att ber\u00e4kningarna delas upp i tv\u00e5 steg. I det f\u00f6rsta steget utf\u00f6rs s\u00f6kandet av block som ligger p\u00e5 gr\u00e4nsen till kollisioner genom att inf\u00f6ra slumpm\u00e4ssiga variabler i en f\u00f6rutbest\u00e4md m\u00e5lupps\u00e4ttning av skillnader. I det andra steget, p\u00e5 niv\u00e5n av individuella block, j\u00e4mf\u00f6rs de resulterande skillnaderna med kollisionspar av tillst\u00e5nd, med hj\u00e4lp av metoder f\u00f6r traditionella kollisionstest. <\/p>\n<p>Trots att den teoretiska m\u00f6jligheten till en attack p\u00e5 SHA-1 bevisades redan 2005, och att den f\u00f6rsta kollisionen i praktiken <noindex><a rel=\"nofollow\" href=\"https:\/\/www.opennet.ru\/opennews\/art.shtml?num=46091\">uppt\u00e4cktes<\/a><\/noindex> \u00e5r 2017, anv\u00e4nds SHA-1 fortfarande och omfattas av vissa standarder och teknologier (TLS 1.2, Git m.fl.). Huvudsyftet med det utf\u00f6rda arbetet var viljan att tillhandah\u00e5lla \u00e4nnu ett starkt argument f\u00f6r omedelbar upph\u00f6rande av anv\u00e4ndningen av SHA-1, s\u00e4rskilt i certifikat och digitala signaturer.<\/p>\n<p>Dessutom kan det n\u00e4mnas <noindex><a rel=\"nofollow\" href=\"https:\/\/eprint.iacr.org\/2019\/474\">publiceringen<\/a><\/noindex> <noindex>resultat<\/noindex> av kryptanalys av blockchiffer <noindex><a rel=\"nofollow\" href=\"https:\/\/en.wikipedia.org\/wiki\/Simon_(cipher)\">SIMON-32\/64<\/a><\/noindex>, utvecklade av NSA i USA och antagna som standard 2018 <noindex><a rel=\"nofollow\" href=\"https:\/\/www.iso.org\/ru\/standard\/70388.html\">ISO\/IEC 29167-21:2018<\/a><\/noindex>.<br \/>\nForskare har lyckats utveckla en metod f\u00f6r att \u00e5terst\u00e4lla den privata nyckeln baserat p\u00e5 tv\u00e5 k\u00e4nda par av klartext och ciphertext. Vid begr\u00e4nsade datorkapaciteter tar det mellan n\u00e5gra timmar och flera dagar att kn\u00e4cka nyckeln. Den teoretiska framg\u00e5ngskoefficienten f\u00f6r attacken uppskattas till 0,25, medan den praktiska f\u00f6r den befintliga prototypen \u00e4r 0,025.<\/p>\n<p><noindex><a rel=\"nofollow\" name=\"link\"><\/a><\/noindex><\/p>\n<p>K\u00e4lla: <a \ncontent=\"nofollow\" rel=\"nofollow\" href=\"https:\/\/www.opennet.ru\/opennews\/art.shtml?num=50674\">opennet.ru<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"<p>\u0418\u0441\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u0442\u0435\u043b\u0438 \u0438\u0437 \u0444\u0440\u0430\u043d\u0446\u0443\u0437\u0441\u043a\u043e\u0433\u043e \u0433\u043e\u0441\u0443\u0434\u0430\u0440\u0441\u0442\u0432\u0435\u043d\u043d\u043e\u0433\u043e \u0438\u043d\u0441\u0442\u0438\u0442\u0443\u0442\u0430 \u0438\u0441\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u043d\u0438\u0439 \u0432 \u0438\u043d\u0444\u043e\u0440\u043c\u0430\u0442\u0438\u043a\u0435 \u0438 \u0430\u0432\u0442\u043e\u043c\u0430\u0442\u0438\u043a\u0435 (INRIA) \u0438 \u041d\u0430\u043d\u044c\u044f\u043d\u0441\u043a\u043e\u0433\u043e \u0442\u0435\u0445\u043d\u043e\u043b\u043e\u0433\u0438\u0447\u0435\u0441\u043a\u043e\u0433\u043e \u0443\u043d\u0438\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442\u0430 (\u0421\u0438\u043d\u0433\u0430\u043f\u0443\u0440) \u0440\u0430\u0437\u0440\u0430\u0431\u043e\u0442\u0430\u043b\u0438 \u0443\u0441\u043e\u0432\u0435\u0440\u0448\u0435\u043d\u0441\u0442\u0432\u043e\u0432\u0430\u043d\u043d\u044b\u0439 \u043c\u0435\u0442\u043e\u0434 \u0430\u0442\u0430\u043a\u0438 \u043d\u0430 \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c SHA-1, \u0441\u0443\u0449\u0435\u0441\u0442\u0432\u0435\u043d\u043d\u043e \u0443\u043f\u0440\u043e\u0449\u0430\u044e\u0449\u0438\u0439 \u0441\u043e\u0437\u0434\u0430\u043d\u0438\u0435 \u0434\u0432\u0443\u0445 \u0440\u0430\u0437\u043d\u044b\u0445 \u0434\u043e\u043a\u0443\u043c\u0435\u043d\u0442\u043e\u0432 \u0441 \u043e\u0434\u0438\u043d\u0430\u043a\u043e\u0432\u044b\u043c\u0438 \u0445\u044d\u0448\u0430\u043c\u0438 SHA-1. \u0421\u0443\u0442\u044c \u043c\u0435\u0442\u043e\u0434\u0430 \u0432 \u0441\u0432\u0435\u0434\u0435\u043d\u0438\u0438 \u043e\u043f\u0435\u0440\u0430\u0446\u0438\u0438 \u043f\u043e\u043b\u043d\u043e\u0446\u0435\u043d\u043d\u043e\u0433\u043e \u043f\u043e\u0434\u0431\u043e\u0440\u0430 \u043a\u043e\u043b\u043b\u0438\u0437\u0438\u0438 \u0432 SHA-1 \u043a \u043a\u043e\u043b\u043b\u0438\u0437\u0438\u043e\u043d\u043d\u043e\u0439 \u0430\u0442\u0430\u043a\u0435 \u0441 \u0437\u0430\u0434\u0430\u043d\u043d\u044b\u043c \u043f\u0440\u0435\u0444\u0438\u043a\u0441\u043e\u043c, \u043f\u0440\u0438 \u043a\u043e\u0442\u043e\u0440\u043e\u0439 \u043a\u043e\u043b\u043b\u0438\u0437\u0438\u044f \u0432\u043e\u0437\u043d\u0438\u043a\u0430\u0435\u0442 \u043f\u0440\u0438 \u043d\u0430\u043b\u0438\u0447\u0438\u0438 [&hellip;]<\/p>\n","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[702],"tags":[],"class_list":["post-33517","post","type-post","status-publish","format-standard","hentry","category-news"],"aioseo_notices":[],"aioseo_head":"\n\t\t<!-- All in One SEO 5.0.4 - aioseo.com -->\n\t<meta name=\"description\" content=\"\u0418\u0441\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u0442\u0435\u043b\u0438 \u0438\u0437 \u0444\u0440\u0430\u043d\u0446\u0443\u0437\u0441\u043a\u043e\u0433\u043e \u0433\u043e\u0441\u0443\u0434\u0430\u0440\u0441\u0442\u0432\u0435\u043d\u043d\u043e\u0433\u043e \u0438\u043d\u0441\u0442\u0438\u0442\u0443\u0442\u0430 \u0438\u0441\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u043d\u0438\u0439 \u0432 \u0438\u043d\u0444\u043e\u0440\u043c\u0430\u0442\u0438\u043a\u0435 \u0438 \u0430\u0432\u0442\u043e\u043c\u0430\u0442\u0438\u043a\u0435 (INRIA) \u0438 \u041d\u0430\u043d\u044c\u044f\u043d\u0441\u043a\u043e\u0433\u043e \u0442\u0435\u0445\u043d\u043e\u043b\u043e\u0433\u0438\u0447\u0435\u0441\u043a\u043e\u0433\u043e \u0443\u043d\u0438\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442\u0430 (\u0421\u0438\u043d\u0433\u0430\u043f\u0443\u0440)\" \/>\n\t<meta name=\"robots\" content=\"max-image-preview:large\" \/>\n\t<meta name=\"author\" content=\"Yuri Gagarin\"\/>\n\t<link rel=\"canonical\" href=\"https:\/\/prohoster.info\/sv\/blog\/news\/predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1\" \/>\n\t\t<meta name=\"generator\" content=\"All in One SEO (AIOSEO) 5.0.4\" \/>\n\t\t<meta property=\"og:locale\" content=\"sv_SE\" \/>\n\t\t<meta property=\"og:site_name\" content=\"ProHoster | \u041a\u0443\u043f\u0438\u0442\u044c \u043d\u0430\u0434\u0435\u0436\u043d\u044b\u0439 \u0445\u043e\u0441\u0442\u0438\u043d\u0433 \u0434\u043b\u044f \u0441\u0430\u0439\u0442\u043e\u0432 \u0441 \u0437\u0430\u0449\u0438\u0442\u043e\u0439 \u043e\u0442 DDoS, VPS VDS \u0441\u0435\u0440\u0432\u0435\u0440\u044b\" \/>\n\t\t<meta property=\"og:type\" content=\"article\" \/>\n\t\t<meta property=\"og:title\" content=\"\ud83e\udd47\u041f\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043b\u0435\u043d \u0431\u043e\u043b\u0435\u0435 \u044d\u0444\u0444\u0435\u043a\u0442\u0438\u0432\u043d\u044b\u0439 \u043c\u0435\u0442\u043e\u0434 \u043e\u043f\u0440\u0435\u0434\u0435\u043b\u0435\u043d\u0438\u044f \u043f\u0440\u0435\u0444\u0438\u043a\u0441\u043e\u0432 \u043a\u043e\u043b\u043b\u0438\u0437\u0438\u0439 \u0434\u043b\u044f SHA-1 | ProHoster\" \/>\n\t\t<meta property=\"og:description\" content=\"\u0418\u0441\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u0442\u0435\u043b\u0438 \u0438\u0437 \u0444\u0440\u0430\u043d\u0446\u0443\u0437\u0441\u043a\u043e\u0433\u043e \u0433\u043e\u0441\u0443\u0434\u0430\u0440\u0441\u0442\u0432\u0435\u043d\u043d\u043e\u0433\u043e \u0438\u043d\u0441\u0442\u0438\u0442\u0443\u0442\u0430 \u0438\u0441\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u043d\u0438\u0439 \u0432 \u0438\u043d\u0444\u043e\u0440\u043c\u0430\u0442\u0438\u043a\u0435 \u0438 \u0430\u0432\u0442\u043e\u043c\u0430\u0442\u0438\u043a\u0435 (INRIA) \u0438 \u041d\u0430\u043d\u044c\u044f\u043d\u0441\u043a\u043e\u0433\u043e \u0442\u0435\u0445\u043d\u043e\u043b\u043e\u0433\u0438\u0447\u0435\u0441\u043a\u043e\u0433\u043e \u0443\u043d\u0438\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442\u0430 (\u0421\u0438\u043d\u0433\u0430\u043f\u0443\u0440)\" \/>\n\t\t<meta property=\"og:url\" content=\"https:\/\/prohoster.info\/sv\/blog\/news\/predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1\" \/>\n\t\t<meta property=\"og:image\" content=\"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg\" \/>\n\t\t<meta property=\"og:image:secure_url\" content=\"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg\" \/>\n\t\t<meta property=\"og:image:width\" content=\"350\" \/>\n\t\t<meta property=\"og:image:height\" content=\"350\" \/>\n\t\t<meta property=\"article:published_time\" content=\"2019-10-31T18:53:04+00:00\" \/>\n\t\t<meta property=\"article:modified_time\" content=\"2019-10-31T18:53:04+00:00\" \/>\n\t\t<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/prohoster\" \/>\n\t\t<meta property=\"article:author\" content=\"https:\/\/www.facebook.com\/prohoster\" \/>\n\t\t<!-- All in One SEO -->\n\n","aioseo_head_json":{"title":"\ud83e\udd47Ett mer effektivt s\u00e4tt att best\u00e4mma kollisionsprefix f\u00f6r SHA-1 har presenterats | ProHoster","description":"Forskare fr\u00e5n det franska statliga institutet f\u00f6r forskning inom datavetenskap och automation (INRIA) och Nanyang Technological University (Singapore)","canonical_url":"https:\/\/prohoster.info\/sv\/blog\/news\/predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"sv_SE","og:site_name":"ProHoster | \u041a\u0443\u043f\u0438\u0442\u044c \u043d\u0430\u0434\u0435\u0436\u043d\u044b\u0439 \u0445\u043e\u0441\u0442\u0438\u043d\u0433 \u0434\u043b\u044f \u0441\u0430\u0439\u0442\u043e\u0432 \u0441 \u0437\u0430\u0449\u0438\u0442\u043e\u0439 \u043e\u0442 DDoS, VPS VDS \u0441\u0435\u0440\u0432\u0435\u0440\u044b","og:type":"article","og:title":"\ud83e\udd47\u041f\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043b\u0435\u043d \u0431\u043e\u043b\u0435\u0435 \u044d\u0444\u0444\u0435\u043a\u0442\u0438\u0432\u043d\u044b\u0439 \u043c\u0435\u0442\u043e\u0434 \u043e\u043f\u0440\u0435\u0434\u0435\u043b\u0435\u043d\u0438\u044f \u043f\u0440\u0435\u0444\u0438\u043a\u0441\u043e\u0432 \u043a\u043e\u043b\u043b\u0438\u0437\u0438\u0439 \u0434\u043b\u044f SHA-1 | ProHoster","og:description":"\u0418\u0441\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u0442\u0435\u043b\u0438 \u0438\u0437 \u0444\u0440\u0430\u043d\u0446\u0443\u0437\u0441\u043a\u043e\u0433\u043e \u0433\u043e\u0441\u0443\u0434\u0430\u0440\u0441\u0442\u0432\u0435\u043d\u043d\u043e\u0433\u043e \u0438\u043d\u0441\u0442\u0438\u0442\u0443\u0442\u0430 \u0438\u0441\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u043d\u0438\u0439 \u0432 \u0438\u043d\u0444\u043e\u0440\u043c\u0430\u0442\u0438\u043a\u0435 \u0438 \u0430\u0432\u0442\u043e\u043c\u0430\u0442\u0438\u043a\u0435 (INRIA) \u0438 \u041d\u0430\u043d\u044c\u044f\u043d\u0441\u043a\u043e\u0433\u043e \u0442\u0435\u0445\u043d\u043e\u043b\u043e\u0433\u0438\u0447\u0435\u0441\u043a\u043e\u0433\u043e \u0443\u043d\u0438\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442\u0430 (\u0421\u0438\u043d\u0433\u0430\u043f\u0443\u0440)","og:url":"https:\/\/prohoster.info\/sv\/blog\/news\/predstavlen-bolee-effektivnyj-metod-opredeleniya-prefiksov-kollizij-dlya-sha-1","og:image":"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg","og:image:secure_url":"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg","og:image:width":350,"og:image:height":350,"article:published_time":"2019-10-31T18:53:04+00:00","article:modified_time":"2019-10-31T18:53:04+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"33517","title":null,"description":null,"keywords":null,"keyphrases":null,"primary_term":null,"canonical_url":null,"og_title":null,"og_description":null,"og_object_type":"default","og_image_type":"default","og_image_url":null,"og_image_width":null,"og_image_height":null,"og_image_custom_url":null,"og_image_custom_fields":null,"og_video":null,"og_custom_url":null,"og_article_section":null,"og_article_tags":null,"twitter_use_og":false,"twitter_card":"default","twitter_image_type":"default","twitter_image_url":null,"twitter_image_custom_url":null,"twitter_image_custom_fields":null,"twitter_title":null,"twitter_description":null,"schema":{"blockGraphs":[],"customGraphs":[],"default":{"data":{"Article":[],"Course":[],"Dataset":[],"FAQPage":[],"Movie":[],"Person":[],"Product":[],"ProductReview":[],"Car":[],"Recipe":[],"Service":[],"SoftwareApplication":[],"WebPage":[]},"graphName":"","isEnabled":true},"graphs":[]},"schema_type":null,"schema_type_options":null,"pillar_content":false,"robots_default":true,"robots_noindex":false,"robots_noarchive":false,"robots_nosnippet":false,"robots_nofollow":false,"robots_noimageindex":false,"robots_noodp":false,"robots_notranslate":false,"robots_max_snippet":null,"robots_max_videopreview":null,"robots_max_imagepreview":"large","priority":null,"frequency":null,"local_seo":null,"seo_analyzer_scan_date":"2026-01-21 15:37:19","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-03-01 02:39:23","updated":"2026-01-21 15:37:19","focus_keyword":null,"additional_keywords":null,"truseo_locale":null},"gt_translate_keys":[{"key":"link","format":"url"}],"_links":{"self":[{"href":"https:\/\/prohoster.info\/sv\/wp-json\/wp\/v2\/posts\/33517","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/sv\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/sv\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/sv\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/sv\/wp-json\/wp\/v2\/comments?post=33517"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/sv\/wp-json\/wp\/v2\/posts\/33517\/revisions"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/sv\/wp-json\/wp\/v2\/media?parent=33517"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/sv\/wp-json\/wp\/v2\/categories?post=33517"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/sv\/wp-json\/wp\/v2\/tags?post=33517"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}