Publication detail

Decentralised Hash Function

LEŽÁK, P.

Original Title

Decentralised Hash Function

Czech Title

Decentralizovaná hešovací funkce

English Title

Decentralised Hash Function

Type

journal article

Language

en

Original Abstract

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.

Czech abstract

Článek obsahuje popis nové hešovací funkce. Tato funkce je počítána více stranami - klientem a několika servery. Tím je zajištěna možnost řídit schopnost výpočtu funkce. Funkce je tak vhodná pro hešování předloh s nízkou entropií, například hesel.

English abstract

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.

Keywords

Hash function, security, confidentiality, decentralisation

RIV year

2015

Released

30.08.2015

Publisher

IJCSNS International Journal of Computer Science and Network Security

Location

Korea

Pages from

16

Pages to

20

Pages count

5

URL

BibTex


@article{BUT115936,
  author="Petr {Ležák}",
  title="Decentralised Hash Function",
  annote="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.",
  address="IJCSNS International Journal of Computer Science and Network Security",
  chapter="115936",
  howpublished="online",
  institution="IJCSNS International Journal of Computer Science and Network Security",
  number="8",
  volume="15",
  year="2015",
  month="august",
  pages="16--20",
  publisher="IJCSNS International Journal of Computer Science and Network Security",
  type="journal article"
}