{"id":12223,"date":"2023-08-25T00:00:00","date_gmt":"2023-08-25T00:00:00","guid":{"rendered":"https:\/\/tech-lib.eu\/tech\/jak-bezpecne-ukladat-hesla-v-aplikaci\/"},"modified":"2023-08-25T00:00:00","modified_gmt":"2023-08-25T00:00:00","slug":"jak-bezpecne-ukladat-hesla-v-aplikaci","status":"publish","type":"post","link":"https:\/\/tech-lib.eu\/tech\/jak-bezpecne-ukladat-hesla-v-aplikaci\/","title":{"rendered":"Jak bezpe\u010dn\u011b ukl\u00e1dat hesla v aplikaci"},"content":{"rendered":"<div class=\"orig\">\n<div class=\"origqestion\">Kde jsou ulo\u017een\u00e1 hesla v mobilu?<\/div>\n<div class=\"origanswer\">Postup kontroly ulo\u017een\u00fdch hesel:<\/p>\n<ul>\n<li>V telefonu \u010di tabletu Android spus\u0165te Chrome .<\/li>\n<li>Vpravo naho\u0159e klepn\u011bte na ikonu mo\u017enost\u00ed Nastaven\u00ed.<\/li>\n<li>V sekci Kontrola hesel klepn\u011bte na Spr\u00e1vce hesel a pak na Zkontrolovat hesla.<\/li>\n<\/ul>\n<\/div>\n<div class=\"origurl\">\n\t\t\t\t\t<span> Dal\u0161\u00ed informace najdete na<\/span> <a href=\"https:\/\/support.google.com\/chrome\/answer\/95606?hl=cs&amp;co=GENIE.Platform%3DAndroid\">support.google.com<\/a>\n\t\t\t\t<\/div>\n<\/p><\/div>\n<div class=\"articlecontent\">Nejd\u0159\u00edve k v\u011bci: Ochrana osobn\u00edch \u00fadaj\u016f je v modern\u00edm digit\u00e1ln\u00edm v\u011bku nesm\u00edrn\u011b d\u016fle\u017eit\u00e1. Bezpe\u010dn\u00e9 ukl\u00e1d\u00e1n\u00ed hesel v aplikac\u00edch je jednou ze z\u00e1kladn\u00edch sou\u010d\u00e1st\u00ed zachov\u00e1n\u00ed bezpe\u010dnosti dat. P\u0159ijet\u00ed d\u016fkladn\u00fdch opat\u0159en\u00ed na ochranu u\u017eivatelsk\u00fdch hesel je vzhledem k n\u00e1r\u016fstu kybernetick\u00fdch hrozeb a pokus\u016f o hackersk\u00e9 \u00fatoky z\u00e1sadn\u00ed. Tento \u010dl\u00e1nek se zab\u00fdv\u00e1 nejlep\u0161\u00edmi postupy pro ukl\u00e1d\u00e1n\u00ed hesel a tak\u00e9 n\u011bkolika p\u0159\u00edstupy k ukl\u00e1d\u00e1n\u00ed hesel v aplikac\u00edch, jako jsou nap\u0159\u00edklad hashovac\u00ed algoritmy. <\/p>\n<div class=\"title\"> Pou\u017eit\u00ed hashovac\u00edch funkc\u00ed k ukl\u00e1d\u00e1n\u00ed hesel: <\/div>\n<p> Matematick\u00fd proces zn\u00e1m\u00fd jako hashovac\u00ed funkce pou\u017e\u00edv\u00e1 vstup (v tomto p\u0159\u00edpad\u011b heslo) k vytvo\u0159en\u00ed \u0159et\u011bzce znak\u016f pevn\u00e9 d\u00e9lky zn\u00e1m\u00e9ho jako hash. Aplikace pou\u017eije hashovac\u00ed funkci na heslo, kdy\u017e u\u017eivatel registruje \u00fa\u010det nebo m\u011bn\u00ed sv\u00e9 heslo, a v\u00fdsledn\u00fd hash ulo\u017e\u00ed do datab\u00e1ze. Kdy\u017e se u\u017eivatel pokus\u00ed p\u0159ihl\u00e1sit, aplikace zopakuje hashovac\u00ed funkci na zadan\u00e9 heslo a porovn\u00e1 ho s d\u0159\u00edve ulo\u017een\u00fdm hashem. Nejlep\u0161\u00ed zp\u016fsob ukl\u00e1d\u00e1n\u00ed hesel je: <\/p>\n<div class=\"newlinediv\"><\/div>\n<p> Mezi r\u016fzn\u00fdmi strategiemi ukl\u00e1d\u00e1n\u00ed hesel je za nejlep\u0161\u00ed postup pova\u017eov\u00e1no vyu\u017eit\u00ed hashovac\u00edch funkc\u00ed. Hesla jsou zabezpe\u010dena pomoc\u00ed hashov\u00e1n\u00ed, aby byla skryta i v p\u0159\u00edpad\u011b kompromitace datab\u00e1ze. Zp\u011btn\u00e9 zji\u0161t\u011bn\u00ed p\u016fvodn\u00edho hesla z ulo\u017een\u00e9ho hashe je v\u00fdpo\u010detn\u011b nemo\u017en\u00e9, proto\u017ee hashovac\u00ed funkce jsou jednosm\u011brn\u00e9 funkce. Pou\u017eit\u00ed jin\u00e9 hodnoty soli pro ka\u017ed\u00e9 heslo nab\u00edz\u00ed nav\u00edc dal\u0161\u00ed vrstvu zabezpe\u010den\u00ed, proto\u017ee br\u00e1n\u00ed \u00fato\u010dn\u00edk\u016fm v pou\u017eit\u00ed p\u0159edem vypo\u010dten\u00fdch tabulek (duhov\u00fdch tabulek) k prolomen\u00ed hash\u016f. Nejbezpe\u010dn\u011bj\u0161\u00ed m\u00edsto pro ulo\u017een\u00ed hesel je: Hesla mus\u00ed b\u00fdt spr\u00e1vn\u011b ulo\u017eena, aby se sn\u00ed\u017eilo riziko ne\u017e\u00e1douc\u00edho p\u0159\u00edstupu. Nejbezpe\u010dn\u011bj\u0161\u00ed a nejpou\u017e\u00edvan\u011bj\u0161\u00ed metodou je ukl\u00e1d\u00e1n\u00ed hesel do vhodn\u011b chr\u00e1n\u011bn\u00e9 datab\u00e1ze. V datab\u00e1zi by m\u011bla b\u00fdt p\u0159\u00edtomna siln\u00e1 kontrola p\u0159\u00edstupu, \u0161ifrov\u00e1n\u00ed a pravideln\u00e9 z\u00e1lohov\u00e1n\u00ed. Pro ochranu p\u0159ed zn\u00e1m\u00fdmi zranitelnostmi je tak\u00e9 z\u00e1sadn\u00ed udr\u017eovat datab\u00e1zov\u00fd server aktualizovan\u00fd pomoc\u00ed nejnov\u011bj\u0161\u00edch bezpe\u010dnostn\u00edch z\u00e1plat. Dal\u0161\u00edm zv\u00fd\u0161en\u00edm bezpe\u010dnosti hesel ulo\u017een\u00fdch v datab\u00e1zi je omezen\u00ed p\u0159\u00edstupu k n\u00ed na opr\u00e1vn\u011bn\u00e9 pracovn\u00edky. <\/p>\n<div class=\"title\"> Ukl\u00e1d\u00e1n\u00ed hesel v pap\u00edrov\u00e9 podob\u011b: <\/div>\n<p> M\u016f\u017ee se zd\u00e1t, \u017ee ukl\u00e1d\u00e1n\u00ed hesel v pap\u00edrov\u00e9 podob\u011b je bezpe\u010dn\u00e9, proto\u017ee nehroz\u00ed nebezpe\u010d\u00ed naru\u0161en\u00ed dat. Z \u0159ady d\u016fvod\u016f se v\u0161ak uchov\u00e1v\u00e1n\u00ed hesel na pap\u00ed\u0159e nedoporu\u010duje. P\u0159edev\u0161\u00edm se pap\u00edr snadno ztrat\u00ed nebo ztrat\u00ed, co\u017e by mohlo v\u00e9st k vyzrazen\u00ed cenn\u00fdch informac\u00ed. Za druh\u00e9, uchov\u00e1v\u00e1n\u00ed fyzick\u00e9 kopie hesel m\u016f\u017ee b\u00fdt \u010dasov\u011b n\u00e1ro\u010dn\u00e9, zejm\u00e9na pokud existuje n\u011bkolik \u00fa\u010dt\u016f a hesla se \u010dasto m\u011bn\u00ed. A kone\u010dn\u011b by bylo n\u00e1ro\u010dn\u00e9 identifikovat naru\u0161en\u00ed bezpe\u010dnosti, pokud by p\u0159ihla\u0161ovac\u00ed \u00fadaje pou\u017eila neopr\u00e1vn\u011bn\u00e1 osoba, pokud by z\u00edskala p\u0159\u00edstup k pap\u00edrov\u00e9 podob\u011b. Z\u00e1v\u011bre\u010dn\u00fd verdikt: <\/p>\n<div class=\"newlinediv\"><\/div>\n<p> Z\u00e1v\u011brem lze \u0159\u00edci, \u017ee pro ochranu u\u017eivatelsk\u00fdch dat je nezbytn\u00e9 ukl\u00e1dat hesla v programech bezpe\u010dn\u011b. Hesla se bezpe\u010dn\u011b ukl\u00e1daj\u00ed pomoc\u00ed hashovac\u00edch metod, jako je bcrypt nebo Argon2, kter\u00e9 zaji\u0161\u0165uj\u00ed jejich nevratnost. Nejlep\u0161\u00edm postupem pro v\u00fdvoj\u00e1\u0159e aplikac\u00ed je ukl\u00e1dat hesla do bezpe\u010dn\u00e9 datab\u00e1ze s odpov\u00eddaj\u00edc\u00edm omezen\u00edm p\u0159\u00edstupu. Datab\u00e1zov\u00fd server je t\u0159eba \u010dasto aktualizovat a dodr\u017eovat postupy bezpe\u010dn\u00e9ho \u0161ifrov\u00e1n\u00ed. A\u010dkoli uchov\u00e1v\u00e1n\u00ed hesel na pap\u00ed\u0159e m\u016f\u017ee zn\u00edt l\u00e1kav\u011b, nen\u00ed to dobr\u00fd n\u00e1pad kv\u016fli nebezpe\u010d\u00edm, kter\u00e1 z toho plynou. V\u00fdvoj\u00e1\u0159i mohou zlep\u0161it zabezpe\u010den\u00ed sv\u00fdch aplikac\u00ed dodr\u017eov\u00e1n\u00edm ur\u010dit\u00fdch osv\u011bd\u010den\u00fdch postup\u016f, kter\u00e9 zaru\u010d\u00ed utajen\u00ed a integritu u\u017eivatelsk\u00fdch hesel.<\/p><\/div>\n<div class=\"questions\">\n<div class=\"questionstitle\">FAQ<\/div>\n<div class=\"question\">\n<div class=\"qtitle\"> Je dobr\u00e9 ukl\u00e1dat hesla na pap\u00edr?<\/div>\n<p> Ukl\u00e1d\u00e1n\u00ed hesel na pap\u00ed\u0159e se obvykle nepova\u017euje za bezpe\u010dnou praxi. M\u00edt fyzickou kopii hesel se m\u016f\u017ee zd\u00e1t pohodln\u00e9, ale jsou s t\u00edm spojena r\u016fzn\u00e1 rizika. Pap\u00edr lze snadno ztratit, odcizit nebo odcizit, co\u017e m\u016f\u017ee n\u011bkomu umo\u017enit neopr\u00e1vn\u011bn\u00fd p\u0159\u00edstup k va\u0161im \u00fa\u010dt\u016fm. Pap\u00edr tak\u00e9 nen\u00ed \u0161k\u00e1lovateln\u00e9 \u0159e\u0161en\u00ed, proto\u017ee spr\u00e1va a aktualizace hesel v pr\u016fb\u011bhu \u010dasu m\u016f\u017ee b\u00fdt n\u00e1ro\u010dn\u00e1. <\/p>\n<div class=\"newlinediv\"><\/div>\n<p> M\u00edsto toho se doporu\u010duje pou\u017e\u00edvat spr\u00e1vce hesel nebo jin\u00e9 bezpe\u010dn\u00e9 digit\u00e1ln\u00ed syst\u00e9my pro spr\u00e1vu hesel, kter\u00e9 poskytuj\u00ed v\u011bt\u0161\u00ed bezpe\u010dnost a jednoduchost. Va\u0161e hesla jsou pomoc\u00ed t\u011bchto n\u00e1stroj\u016f za\u0161ifrov\u00e1na a n\u00e1sledn\u011b ulo\u017eena v trezoru zabezpe\u010den\u00e9m hlavn\u00edm heslem. T\u00edmto zp\u016fsobem si sta\u010d\u00ed pamatovat pouze jedno spolehliv\u00e9 heslo a spr\u00e1vce hesel dok\u00e1\u017ee vygenerovat a bezpe\u010dn\u011b ulo\u017eit ostatn\u00ed hesla. <\/p>\n<\/div>\n<div class=\"question\">\n<div class=\"qtitle\"> M\u011bla by b\u00fdt hesla zaheslov\u00e1na na klientovi nebo na serveru?<\/div>\n<p> M\u00edsto na klientovi by m\u011bl hesla hashovat server. Pomoc\u00ed kryptografick\u00e9 metody hashov\u00e1n\u00ed se heslo v prost\u00e9m textu p\u0159evede na speci\u00e1ln\u00ed \u0159et\u011bzec znak\u016f. Hesla jsou hashov\u00e1na na serveru, m\u00edsto aby byla p\u0159en\u00e1\u0161ena po s\u00edti, co\u017e sni\u017euje mo\u017enost odposlechu a necht\u011bn\u00e9ho p\u0159\u00edstupu. <\/p>\n<div class=\"newlinediv\"><\/div>\n<p> Dal\u0161\u00ed bezpe\u010dnostn\u00ed opat\u0159en\u00ed jsou rovn\u011b\u017e zaji\u0161t\u011bna pomoc\u00ed hashov\u00e1n\u00ed na serveru. S hashov\u00e1n\u00edm na stran\u011b serveru lze pou\u017e\u00edt siln\u011bj\u0161\u00ed algoritmy, nap\u0159\u00edklad bcrypt nebo Argon2, kter\u00e9 jsou vytvo\u0159eny p\u0159\u00edmo pro ukl\u00e1d\u00e1n\u00ed hesel. Tyto algoritmy zahrnuj\u00ed solen\u00ed, kter\u00e9 zvy\u0161uje slo\u017eitost a bezpe\u010dnost ulo\u017een\u00fdch hesel t\u00edm, \u017ee k heslu p\u0159ed hashov\u00e1n\u00edm p\u0159ipoj\u00ed n\u00e1hodn\u00fd \u0159et\u011bzec znak\u016f. <\/p>\n<div class=\"newlinediv\"><\/div>\n<p> P\u016fvodn\u00ed hesla budou v bezpe\u010d\u00ed i v p\u0159\u00edpad\u011b napaden\u00ed datab\u00e1ze serveru, proto\u017ee hashovan\u00e1 hesla jsou ulo\u017eena na serveru. \u00dato\u010dn\u00edci budou m\u00edt velmi t\u011b\u017ek\u00e9 hesla rozlu\u0161tit bez znalosti techniky hashov\u00e1n\u00ed a p\u0159esn\u00e9 soli, kter\u00e1 byla pou\u017eita. <\/p>\n<div class=\"newlinediv\"><\/div>\n<p> Hashov\u00e1n\u00ed hesel na stran\u011b klienta by v\u0161ak vy\u017eadovalo odesl\u00e1n\u00ed hesla v prost\u00e9m textu na server, co\u017e by p\u0159edstavovalo potenci\u00e1ln\u00ed bezpe\u010dnostn\u00ed nedostatky. Hashovan\u00e9 heslo by se p\u0159en\u00e1\u0161elo po s\u00edti, co\u017e by ho \u010dinilo zraniteln\u00fdm v\u016f\u010di odposlechu nebo \u00fatok\u016fm typu man-in-the-middle, proto hashov\u00e1n\u00ed na stran\u011b klienta nenab\u00edz\u00ed stejnou \u00farove\u0148 ochrany. <\/p>\n<div class=\"newlinediv\"><\/div>\n<p> Z\u00e1v\u011brem lze \u0159\u00edci, \u017ee se doporu\u010duje hashovat hesla na stran\u011b serveru, proto\u017ee to poskytuje vy\u0161\u0161\u00ed bezpe\u010dnostn\u00ed z\u00e1ruky, ochranu p\u0159ed naru\u0161en\u00edm dat a omezen\u00ed p\u0159enosu citliv\u00fdch informac\u00ed po s\u00edti.<\/p>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Kde jsou ulo\u017een\u00e1 hesla v mobilu? Postup kontroly ulo\u017een\u00fdch hesel: V telefonu \u010di tabletu Android spus\u0165te Chrome . Vpravo naho\u0159e klepn\u011bte na ikonu mo\u017enost\u00ed Nastaven\u00ed. V sekci Kontrola hesel klepn\u011bte na Spr\u00e1vce hesel a pak na Zkontrolovat hesla. Dal\u0161\u00ed informace najdete na support.google.com Nejd\u0159\u00edve k v\u011bci: Ochrana osobn\u00edch \u00fadaj\u016f je v modern\u00edm digit\u00e1ln\u00edm v\u011bku nesm\u00edrn\u011b &#8230; <a title=\"Jak bezpe\u010dn\u011b ukl\u00e1dat hesla v aplikaci\" class=\"read-more\" href=\"https:\/\/tech-lib.eu\/tech\/jak-bezpecne-ukladat-hesla-v-aplikaci\/\" aria-label=\"\u010c\u00edst v\u00edce o Jak bezpe\u010dn\u011b ukl\u00e1dat hesla v aplikaci\">\u010c\u00edst d\u00e1l<\/a><\/p>\n","protected":false},"author":391,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3953],"tags":[],"class_list":["post-12223","post","type-post","status-publish","format-standard","hentry","category-ukladani-hesel"],"_links":{"self":[{"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/posts\/12223","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/users\/391"}],"replies":[{"embeddable":true,"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/comments?post=12223"}],"version-history":[{"count":0,"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/posts\/12223\/revisions"}],"wp:attachment":[{"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/media?parent=12223"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/categories?post=12223"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/tags?post=12223"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}