Detail publikace

Decentralised Hash Function

LEŽÁK, P.

Originální název

Decentralised Hash Function

Typ

článek v časopise ve Web of Science, Jimp

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

Hash function, security, confidentiality, decentralisation

Autoři

LEŽÁK, P.

Rok RIV

2015

Vydáno

30. 8. 2015

Nakladatel

IJCSNS International Journal of Computer Science and Network Security

Místo

Korea

ISSN

1738-7906

Periodikum

International Journal of Computer Science and Network Security

Ročník

15

Číslo

8

Stát

Korejská republika

Strany od

16

Strany do

20

Strany počet

5

URL

http://paper.ijcsns.org/07_book/201508/20150803.pdf

BibTex

@article{BUT115936,
  author="Petr {Ležák}",
  title="Decentralised Hash Function",
  journal="International Journal of Computer Science and Network Security",
  year="2015",
  volume="15",
  number="8",
  pages="16--20",
  issn="1738-7906",
  url="http://paper.ijcsns.org/07_book/201508/20150803.pdf"
}