Decentralised Hash Function

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F15%3APU115187" target="_blank" >RIV/00216305:26220/15:PU115187 - isvavai.cz</a>

Výsledek na webu

<a href="http://paper.ijcsns.org/07_book/201508/20150803.pdf" target="_blank" >http://paper.ijcsns.org/07_book/201508/20150803.pdf</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Decentralised Hash Function

Popis výsledku v původním jazyce

In this article, a new hash function is introduced. The hash function is calculated by several parties - the client and one or more servers. If a user or attacker wants to calculate the hash of any message, he has to query all the servers. This means that if the attacker wants to invert the hash function by brute-force attack, he has to query the servers frequently. Servers can detect a heavy load and deny queries submitted by the attacker, or limit them. The calculation is done in a way that no server can detect which message is hashed nor trick the client to calculate a wrong value. This new decentralised hash function is useful in the case of wanting to hide some information by hashing, but the information has relatively low entropy, so brute-force attack is possible. One example is hashing of passwords to store them.

Název v anglickém jazyce

Decentralised Hash Function

Popis výsledku anglicky

In this article, a new hash function is introduced. The hash function is calculated by several parties - the client and one or more servers. If a user or attacker wants to calculate the hash of any message, he has to query all the servers. This means that if the attacker wants to invert the hash function by brute-force attack, he has to query the servers frequently. Servers can detect a heavy load and deny queries submitted by the attacker, or limit them. The calculation is done in a way that no server can detect which message is hashed nor trick the client to calculate a wrong value. This new decentralised hash function is useful in the case of wanting to hide some information by hashing, but the information has relatively low entropy, so brute-force attack is possible. One example is hashing of passwords to store them.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

International Journal of Computer Science and Network Security

ISSN

1738-7906

e-ISSN

—

Svazek periodika

15

Číslo periodika v rámci svazku

8

Stát vydavatele periodika

KR - Korejská republika

Počet stran výsledku

5

Strana od-do

16-20

Kód UT WoS článku

000365531800003

EID výsledku v databázi Scopus

—