×

Hash function design for cloud storage data auditing. (English) Zbl 1436.68091

Summary: Cloud based storage is being widely used as a viable solution to the problem of data storage in contexts where financial and practical considerations prohibit the use of locally based hardware and software resources. User reservations and legal constraints however have given rise to questions about the verifiability of the integrity of the stored data, especially in the case of public cloud infrastructure. A new problem has hence arisen, that of auditing stored files in order to obtain Proof of Retrievability. Secure cloud storage systems are limited by the overheads they require in order to provide the required security levels. Combined use of cloud and local computational resources is necessary in order to enable the desirable user experiences. With increasing local processing capacities, the most significant relevance is encountered in the Big Data Processing paradigm. The volumes of data that need to be processed are overwhelming to such an extent that approaches which use unlimited amounts of power, for processing and storage are not feasible. This paper focuses on a recent study of hash function requirements for big data applications and an associated key-based hash function design technique that makes the real-time collection, summarization, analysis and decision making based on streaming data. A file auditing technique is proposed that uses fundamental big data mass processing operations in order to develop an efficient and reliable proof of recoverability algorithm.

MSC:

68P20 Information storage and retrieval of data
68P05 Data structures
68P25 Data encryption (aspects in computer science)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Berman, F.; Bock, M. E.; Dittert, E.; O’Donnel, M. J.; Plank, D., Collections of function of perfect hashing, SIAM J. Comput., 15, 2, 604-618 (1986) · Zbl 0591.68059
[2] Juels, Ari; Kaliski, Burton S., PORs: Proofs of Retrievability for Large Files, Proceedings of the 14th ACM Conference on Computer and Communications Security (2007), Acm
[3] Czech, Z. J.; Havas, G.; Majevski, B. S., An optimal algorithm for generating minimal perfect hash functions, Inf. Process. Lett., 43, 5, 257-264 (1997) · Zbl 0772.68051
[4] Jagannathan, R., Optimal partial-match hashing design, ORSA J. Comput., 3, 2, 86-91 (1991) · Zbl 0760.68025
[5] Sun, Ningping; Nakamura, Ryozo; Zhu, Nonbing; Tada, Akiro; Sun, Wenling, An analysis of average search cost of external hashing with separate chain, (Processing of 7-th WSEAS International Conference on Circuits, Systems, Communications and Computers (CSCC-2003) (2003)), 315-324
[6] Ramakrishna, M. V.; Bannai, Y., Direct perfect hashing function of external files, J. Database Adm., 2, 1, 19-28 (1991)
[7] Polymenopoulos, A.; Bardis, E. G.; Bardis, N. G.; Markovskaja, N. A., Perfect Hashing Using Linear Boolean Functions, 5-11 (2001), WSEAS Press - Problem in Applied Thematics and Computational Intelligence
[8] Bardis, E. G.; Bardis, N. G.; Markovskyy, A. P.; Spyropoulos, A. K., High storage utilization of hash memory by reducing of information redundancy for hashing, (Submitting as a Special Issue of IMACS/IEEE CSCC’99 International MultiConference. Submitting as a Special Issue of IMACS/IEEE CSCC’99 International MultiConference, Software and Hardware Engineering for the 21th Century (1999)), 272-276
[9] Bardis, Nikolaos G.; Doukas, Nikolaos; Markovskyi, Oleksandr P., Hash addressing of the quasi-permanent key arrays in multilevel memory, J. Appl. Math. Bioinform., 3, 4, 91-105 (2013)
[10] Leskovec, Jure; Rajaraman, Anand; Ullman, Jeffrey David, Mining of Massive Datasets (2014), Cambridge University Press
[11] Kharchenko, V.; Illiashenko, O., Concepts of green IT engineering: taxonomy, principles and implementation, (Kharchenko, V.; Kondratenko, Y.; Kacprzyk, J., Green IT Engineering: Concepts, Models, Complex Systems Architectures, Studies in Systems, Decision and Control, vol. 74 (2017), Springer International Publishing: Springer International Publishing Berlin, Heidelberg), 3-20
[12] Kondratenko, Y. P.; Korobko, O. V.; Kozlov, O. V., PLC-based systems for data acquisition and supervisory control of environment-friendly energy-saving technologies, (Kharchenko, V.; Kondratenko, Y.; Kacprzyk, J., Green IT Engineering: Concepts, Models, Complex Systems Architectures, Studies in Systems, Decision and Control, vol. 74 (2017), Springer International Publishing: Springer International Publishing Berlin, Heidelberg), 247-267
[13] Chen, Fei, Secure cloud storage meets with secure network coding, IEEE Trans. Comput., 65, 6, 1936-1948 (2016) · Zbl 1360.94345
[14] Shacham, Hovav; Waters, Brent, Compact Proofs of Retrievability, International Conference on the Theory and Application of Cryptology and Information Security (2008), Springer: Springer Berlin Heidelberg · Zbl 1206.68110
[15] Wang, Cong, Privacy-preserving public auditing for secure cloud storage, IEEE Trans. Comput., 62, 2, 362-375 (2013) · Zbl 1365.68235
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.