Reviving the Idea of Incremental Cryptography for the Zettabyte Era Use Case: Incremental Hash Functions Based on SHA-3

Abstract : According to several recent studies, the global IP communication and digital storage have already surpassed the zettabyte threshold ($$10^{21}$$ bytes). The Internet entered the zettabyte era in which fast and secure computations are important more than ever. One solution for certain types of computations, that may offer a speedup up to several orders of magnitude, is the incremental cryptography. While the idea of incremental crypto primitives is not new, so far its potential has not been fully exploited. In this paper, we define two incremental hash functions iSHAKE128 and iSHAKE256 based on the recent NIST proposal for SHA-3 Extendable-Output Functions SHAKE128 and SHAKE256. We describe two practical implementation scenarios of the newly introduced hash functions and compare them with the already known tree-based hash scheme. We show the trends of efficiency gains as the amount of data increases in comparison to the standard tree-based incremental schemes. Our proposals iSHAKE128 and iSHAKE256 provide security against collision attacks of 128 and 256 bits, respectively.
Type de document :
Communication dans un congrès
Jan Camenisch; Doğan Kesdoğan. International Workshop on Open Problems in Network Security (iNetSec), Oct 2015, Zurich, Switzerland. Lecture Notes in Computer Science, LNCS-9591, pp.97-111, 2016, Open Problems in Network Security. 〈10.1007/978-3-319-39028-4_8〉
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01445801
Contributeur : Hal Ifip <>
Soumis le : mercredi 25 janvier 2017 - 12:44:49
Dernière modification le : mercredi 25 janvier 2017 - 12:47:06
Document(s) archivé(s) le : mercredi 26 avril 2017 - 15:37:24

Fichier

 Accès restreint
Fichier visible le : 2019-01-01

Connectez-vous pour demander l'accès au fichier

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Hristina Mihajloska, Danilo Gligoroski, Simona Samardjiska. Reviving the Idea of Incremental Cryptography for the Zettabyte Era Use Case: Incremental Hash Functions Based on SHA-3. Jan Camenisch; Doğan Kesdoğan. International Workshop on Open Problems in Network Security (iNetSec), Oct 2015, Zurich, Switzerland. Lecture Notes in Computer Science, LNCS-9591, pp.97-111, 2016, Open Problems in Network Security. 〈10.1007/978-3-319-39028-4_8〉. 〈hal-01445801〉

Partager

Métriques

Consultations de la notice

51