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

  • Hristina Mihajloska
  • Danilo Gligoroski
  • Simona Samardjiska
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9591)

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.

Keywords

Incremental hashing SHA-3 SHAKE128 SHAKE256 iSHAKE128 iSHAKE256 Zettabyte era 

References

  1. 1.
    Amazon web services. An Amazon Company (2015). http://aws.amazon.com/ec2/instance-types/
  2. 2.
    Virtual machine and cloud service sizes for azure. Microsoft (2015). https://msdn.microsoft.com/en-us/library/azure/dn197896.aspx
  3. 3.
    Historical cost of computer memory and storage. hblok.net \(\bullet \) Freedom, Electronics and Tech, February 2013. http://hblok.net/blog/storage/
  4. 4.
    Bellare, M., Goldreich, O., Goldwasser, S.: Incremental cryptography: the case of hashing and signing. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 216–233. Springer, Heidelberg (1994)Google Scholar
  5. 5.
    Bellare, M., Micciancio, D.: A new paradigm for collision-free hashing: incrementality at reduced cost. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 163–192. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  6. 6.
    Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sakura: a flexible coding for tree hashing. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 217–234. Springer, Heidelberg (2014)Google Scholar
  7. 7.
    Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sufficient conditions for sound tree and sequential hashing modes. Int. J. Inf. Secur. 4, 335–353 (2014)CrossRefGoogle Scholar
  8. 8.
    Chang, F., Dean, J., Ghemawat, S., Hsieh, W.C., Wallach, D.A., Burrows, M., Chandra, T., Fikes, A., Gruber, R.E.: Bigtable: a distributed storage system for structured data. In: Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2006, Berkeley, CA, USA, vol. 7, p. 15. USENIX Association (2006)Google Scholar
  9. 9.
    Cisco. Cisco visual networking index: Forecast and methodology, 2012–2017. White Paper, May 2013Google Scholar
  10. 10.
    EMC. The EMC Digital Universe study with research and analysis by IDC. Open Report, April 2014Google Scholar
  11. 11.
    Gligoroski, D., Samardjiska, S.: iSHAKE: incremental hashing with SHAKE128 and SHAKE256 for the zettabyte era. In: SHA-3 Workshop (2014). http://csrc.nist.gov/groups/ST/hash/sha-3/Aug2014/documents/gligoroski_paper_sha3_2014_workshop.pdf
  12. 12.
    Hart, J.K., Martinez, K.: Environmental sensor networks: a revolution in the earth system science? Earth-Sci. Rev. 78(34), 177–191 (2006)CrossRefGoogle Scholar
  13. 13.
    Hornby, M.: Review of the best cloud storage services (2015). http://www.thetop10bestonlinebackup.com/cloud-storage. Accessed 01 Mar 2016
  14. 14.
    Kelsey, J.: What should be in a parallel hashing standard? In: NIST, 2014 SHA3 Workshop (2014). http://csrc.nist.gov/groups/ST/hash/sha-3/Aug2014/documents/kelsey_sha3_2014_panel.pdf
  15. 15.
    Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369–378. Springer, Heidelberg (1988)Google Scholar
  16. 16.
    Mike, S.: How are digital movies distributed and screened? every question answered! http://goo.gl/qLYoIV. Accessed 01 Mar 2016
  17. 17.
    NIST. DRAFT SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. FIPS 202, April 2014Google Scholar
  18. 18.
    National Centers for Environmental Information NOAA. Climate Forecast System Version 2 (CFSv2). https://www.ncdc.noaa.gov/data-access/model-data/model-datasets/climate-forecast-system-version2-cfsv2
  19. 19.
    Wagner, D.: A generalized birthday problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288–303. Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2016

Authors and Affiliations

  • Hristina Mihajloska
    • 1
  • Danilo Gligoroski
    • 2
  • Simona Samardjiska
    • 1
  1. 1.Faculty of Computer Science and EngineeringUKIMSkopjeMacedonia
  2. 2.Department of TelematicsNTNUTrondheimNorway

Personalised recommendations