To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
Decentralised Hash Function |
|
Author |
Petr Le??k |
| Citation |
Vol. 15 No. 8 pp. 16-20 |
|
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 |
|
URL |
