Advancing Video Data Privacy Preservation in IoT Networks through Video Blockchain †

: In the digital age, where the Internet of Things (IoT) permeates every facet of our lives, the safeguarding of data privacy, especially video data, emerges as a paramount concern. The ubiquity of IoT devices, capable of capturing and disseminating vast quantities of video data, introduces unprecedented challenges in ensuring the privacy and security of such information. This article explores the crucial intersection of video data privacy and blockchain technology within IoT networks. It aims to uncover and articulate the unique challenges video data encounter in the IoT ecosystem, such as susceptibility to unauthorized access and the difficulty in ensuring data integrity and confidentiality. By conducting a thorough literature review, this study not only illuminates the intricate privacy challenges inherent in IoT environments but also showcases the immutable, decentralized nature of blockchain as a potent solution. We systematically explore how blockchain-based methods can be pragmatically implemented to fortify video data privacy, scrutinizing the efficacy of these approaches in the IoT context. Through critical assessment, the paper delineates the strengths and limitations of video blockchain solutions, underscoring the transformative potential of blockchain technology as a cornerstone for enhancing data privacy in IoT networks. Conclusively, this work advocates for blockchain as an indispensable tool in the advancement of data privacy measures for video content, thereby reinforcing trust and security in the increasingly connected fabric of our digital world. As IoT applications burgeon, the fusion of blockchain technology with IoT infrastructures promises a robust framework for protecting sensitive video data, heralding a future of enhanced trust and security in our interconnected ecosystem.


Introduction
In the contemporary era, devices connected through the Internet of Things (IoT) have become indispensable to our daily lives, simplifying tasks across a vast array of applications.Despite their convenience, the surge in IoT device deployment has ushered in a new era of challenges, particularly in data privacy.The intimate integration of our personal data with these interconnected technologies has heightened concerns about privacy breaches, especially through the unauthorized sharing of personal data with third parties [1].Among the various types of data captured by IoT devices, video data are notably high-risk due to their visual nature, which presents unique challenges and vulnerabilities.These concerns are not only about privacy but extend to legal and ethical dimensions, underscoring the need for robust security measures and adherence to legal frameworks [2].
The risk of sensitive information exposure is a paramount concern, as video data often contain highly personal and identifiable information.This raises not only privacy issues but also legal and ethical considerations.Ensuring the security and privacy of video data in IoT networks requires adherence to legal frameworks and ethical guidelines, which vary across regions and contexts.
Existing schemes often fall short of addressing these challenges effectively, particularly in the context of video data.Many traditional approaches lack the capability to handle the high volume and sensitivity of video data and do not fully leverage the decentralized and immutable nature of blockchain technology.
Our research introduces a novel approach to the integration of video blockchain technology with IoT networks, specifically tailored to address the unique challenges of video data privacy.Unlike conventional schemes, our method emphasizes the importance of selecting the best cryptographic function and data structure for video blockchain, ensuring optimal performance and security.This innovative integration not only enhances the security and privacy of video data but also leverages the inherent advantages of blockchain technology, such as decentralization and immutability, to provide a more robust and scalable solution for IoT networks.
The burgeoning field of video blockchain, originating from our preceding research endeavors, offers a promising avenue for enhancing the privacy of video data within IoT networks [3][4][5][6].We embark on this exploration of data privacy in IoT networks.Our approach introduces a novel integration of video blockchain technology with IoT networks, specifically tailored to address the unique challenges of video data privacy.Unlike conventional schemes, our method emphasizes the importance of selecting the best cryptographic function and data structure for video blockchain, ensuring optimal performance and security [7].
As we embark on this exploration of data privacy in IoT networks, we introduce three central hypotheses that guide our research: Hypothesis 1. Measuring best cryptographic function for video Blockchain to enhance data privacy in IoT network.Hypothesis 2. Selecting the best data structure for video blockchain.

Hypothesis 3. The integration of video blockchain technology into IoT networks.
This article aims to explore and tackle the presented hypotheses through the application of suitable research methodologies.To contextualize our research, we will review the current state of the field, highlighting the challenges and controversies related to IoT data privacy.Additionally, we will provide an overview of key publications that have contributed to the discourse on data privacy within IoT networks.By examining the current landscape, we will lay the foundation for the hypotheses and experimental analysis presented in this paper.
In assumption, this article underscores the compelling importance of blockchain as a catalyst for enhancing data privacy, particularly in the context of video data, within the intricate web of IoT networks.As IoT applications continue to rapidly proliferate, the integration of blockchain technology offers a promising solution to address the critical issue of data privacy, ultimately fostering trust and security in our interconnected world.We provide insights that transcend disciplinary boundaries, making our findings comprehensible to scientists and researchers outside the specific field of IoT and data privacy.The structure of this paper is laid out in the following manner: Section 2 delves into the materials and methods utilized in this study.Section 3 presents the findings of the research.The paper is concluded in Section 4.

Materials and Methods
In this section, we outline our methods for testing hypotheses to obtain pertinent results.We aim to extract feasible solutions and conduct a comparative analysis of the methodologies we have employed.Our goal is to achieve the desired outcomes and implement a secure IoT network capable of transmitting video data securely.

Evaluating the Performance of Existing Hashing Functions
In the process of testing Hypothesis 1, it is crucial to identify the most suitable cryptographic functions to establish a secure and efficient video blockchain system.To achieve this, we must refer to a comprehensive literature review of hashing functions and select the most commonly used hashing functions for blockchain implementations.In Section 2, we present an in-depth background study of the current research in this field, focusing on identifying the most robust hashing functions [4].
The criteria used for evaluating the performance of hashing functions include their security properties, such as resistance to collision and preimage attacks, computational efficiency, and compatibility with blockchain technology.We assess the security properties by examining the cryptographic strength of the functions, ensuring they meet the required standards for data integrity and confidentiality.Computational efficiency is evaluated based on the time taken to perform hashing operations, which is crucial for the real-time processing of video data in IoT networks.Compatibility with blockchain technology is determined by the ability of the hashing functions to integrate seamlessly with existing blockchain infrastructures, facilitating interoperability and scalability.
Hence, as a result of background literature studies, we figure out the hashing functions, SHA-256 and Merkle Tree, as possible functions to support achieving the required outcome [8].The hashing function has been used in specifically tailored applications for blockchain [9].We prioritize efficiency as a crucial aspect, requiring the enhancement of the function's performance to be compatible with the distinct hardware and software framework of blockchain implementations.Additionally, it is vital to ensure compatibility to facilitate seamless integration and interoperability within the current blockchain infrastructure [10].
The performance of both hashing functions, SHA-256 and SHA-3, is assessed through benchmarking.A script is employed to determine the average time required to execute each hashing operation on a designated sample data string.To ensure precision, the script iterates through the hashing process 1000 times, providing a more accurate measurement of performance.The average time for each hashing function is calculated using Equation (1), where N is the total number of iterations, and t end,i and t start,i are the end and start times for the ith iteration, respectively.This process is outlined in Equation ( 1), where we detail the steps for measuring the performance of our selected hashing functions and compare their efficiency. Given: • N: the total number of interactions • t end,i and t start,i : Start and end times for the ith iteration, respectively.
The average time for the hashing function, T average , can be expressed as follows: Additionally, to visualize the distribution of execution times, the individual times are converted into a histogram.The process involves grouping the execution times into bins and counting the number of times that fall within each bin.First, the execution time for each iteration is calculated: t exec,i = t end,i − t start,i .The execution times are grouped into bins: B 1 , B 2 , and B k .Then, the frequency of the execution times are counted in each bin, f j = count t exec,i ∈ B j f or j = 1, 2, . . ., k.Finally, the histogram is represented by the set of frequencies { f 1 , f 2 , . . . . f k } corresponding to each bin.The results of this analysis are presented in Figures 1 and 2, which display the performance of SHA-256 and SHA-3, respectively.The comparison between these hashing functions ensures that the selection made from the literature review is validated and supported by empirical evidence.
respectively.The comparison between these hashing functions ensures that the selection made from the literature review is validated and supported by empirical evidence.After analysis of the performance, one of the best hashing functions needs to be chosen by comparing similar hashing functions.To conduct this hash function assessment, the Multi-Criteria Decision Making (MCDM) [11] is used as shown: where matric Ri represents the rank on the i-th matric, and then M is the number of evaluation criteria.The main reason for applying this MCDM to select the best hashing function and effectiveness is based on the final results.In Figure 3, the MCDM result is shown for SHA256 and SHA3.The MCDM process applies different methods for different approaches.In our process, we use the Analytic Hierarchy Process (AHP) to compare SHA256 and SHA3.In this process, we create the pairwise comparison by using Equation (2), and the weights of the matrix were derived from our results.Finally, we calculate the consistency by using the Consistency Index (CI) and the Consistency Ratio (CR) [12].respectively.The comparison between these hashing functions ensures that the selection made from the literature review is validated and supported by empirical evidence.After analysis of the performance, one of the best hashing functions needs to be chosen by comparing similar hashing functions.To conduct this hash function assessment, the Multi-Criteria Decision Making (MCDM) [11] is used as shown: where matric Ri represents the rank on the i-th matric, and then M is the number of evaluation criteria.The main reason for applying this MCDM to select the best hashing function and effectiveness is based on the final results.In Figure 3, the MCDM result is shown for SHA256 and SHA3.The MCDM process applies different methods for different approaches.In our process, we use the Analytic Hierarchy Process (AHP) to compare SHA256 and SHA3.In this process, we create the pairwise comparison by using Equation (2), and the weights of the matrix were derived from our results.Finally, we calculate the consistency by using the Consistency Index (CI) and the Consistency Ratio (CR) [12].After analysis of the performance, one of the best hashing functions needs to be chosen by comparing similar hashing functions.To conduct this hash function assessment, the Multi-Criteria Decision Making (MCDM) [11] is used as shown: where matric R i represents the rank on the i-th matric, and then M is the number of evaluation criteria.The main reason for applying this MCDM to select the best hashing function and effectiveness is based on the final results.In Figure 3, the MCDM result is shown for SHA256 and SHA3.The MCDM process applies different methods for different approaches.
In our process, we use the Analytic Hierarchy Process (AHP) to compare SHA256 and SHA3.In this process, we create the pairwise comparison by using Equation (2), and the weights of the matrix were derived from our results.Finally, we calculate the consistency by using the Consistency Index (CI) and the Consistency Ratio (CR) [12].The corresponding results of using Equation (1) are shown in Figures 1 and 2. These results employ the pairwise comparison matrix to show the scales in each comparison by measuring the average time.
Table 1 presents a pairwise comparison matrix that quantifies the relative performance of the hashing functions SHA-256 and SHA-3.The values in the matrix represent the ratio of the average times taken by the respective hashing functions, providing a clear and concise comparison of their performance.The corresponding results of using Equation ( 1) are shown in Figures 1 and 2. These results employ the pairwise comparison matrix to show the scales in each comparison by measuring the average time.
Table 1 presents a pairwise comparison matrix that quantifies the relative performance of the hashing functions SHA-256 and SHA-3.The values in the matrix represent the ratio of the average times taken by the respective hashing functions, providing a clear and concise comparison of their performance.

SHA256
In the implementation of the Analytic Hierarchy Process (AHP) method, a scale ranging from '1′ to '9′ was utilized, where '1′ denotes equality and '9′ signifies an extreme preference for one alternative over another.The second step in the AHP method involves calculating the relative priorities, or weights, of each hash function.This requires Table 1 to normalize the matrix.
Normalization begins with dividing each element by the sum of its column.For our data, the sum of the SHA256 column is 1.33, while the sum of the SHA3 column is 4. The normalized matrix values are then obtained by dividing each element by its column total.For column SHA256, this results in (0.75, 0.75), and for column SHA3, the values are (0.25, 0.25).
Subsequently, the average of each row is calculated to determine the weights.The weight for row SHA256 is (0.75 + 0.75)/2 = 0.75, and for Row SHA3, it is (0.25 + 0.25)/2 = 0.25.Therefore, the weights are 0.75 for SHA256 and 0.25 for SHA3, indicating that  In the implementation of the Analytic Hierarchy Process (AHP) method, a scale ranging from '1' to '9' was utilized, where '1' denotes equality and '9' signifies an extreme preference for one alternative over another.The second step in the AHP method involves calculating the relative priorities, or weights, of each hash function.This requires Table 1 to normalize the matrix.
Normalization begins with dividing each element by the sum of its column.For our data, the sum of the SHA256 column is 1.33, while the sum of the SHA3 column is 4. The normalized matrix values are then obtained by dividing each element by its column total.For column SHA256, this results in (0.75, 0.75), and for column SHA3, the values are (0.25, 0.25).
Subsequently, the average of each row is calculated to determine the weights.The weight for row SHA256 is (0.75 + 0.75)/2 = 0.75, and for Row SHA3, it is (0.25 + 0.25)/2 = 0.25.Therefore, the weights are 0.75 for SHA256 and 0.25 for SHA3, indicating that SHA256 is considered three times as important as SHA3 according to this specific criterion.
The final step in the AHP method is to check for consistency, ensuring that the judgments are not arbitrary.To compute the Consistency Index (CI), one must calculate λ max which involves obtaining the average of row SHA3 and row SHA256 weights.These values should be close to the number of items being compared (n).Therefore, a λ max value of 2.05 suggests a small degree of inconsistency, indicating a generally consistent judgment within the matrix.The Consistency Index (CI) is calculated as follows: After obtaining CI, it can be used to obtain the Random Index (RI).This is a value derived from randomly generated reciprocal matrices.The RI depends on the number of elements (n): RI is 0.00 for n = 2.It is used to obtain the Consistency Ratio (CR) as follows: If CI = 0.05, then CR = 0.00 as the final outcome.However, since RI is zero for n = 2, the CR cannot be meaningfully calculated.In practice, for a 2 × 2 matrix, if the CI is very small, the matrix is generally considered consistent.In cases with more criteria (n > 2), CR becomes a more meaningful measure because it obtained the result of 0.05 by ensuring consistency.
After following the steps of the AHP method to compare SHA256 and SHA3, the weights are calculated as 0.75 and 0.25, respectively.These weights were derived from the pairwise comparison matrix and subsequent normalization and averaging steps in the AHP method.The weight of 0.75 for SHA256 is significantly higher than the weight of 0.25 for SHA3.This difference indicates that SHA 256 is three times more suitable for our research work base.Furthermore, the constituency was verified by CI which turned out to be 0.05; since the RI for a matrix of size 2 × 2 is 0.00 and the CI is small, the pairwise comparisons are deemed consistent, even though the Consistency Ratio (CR) could not be meaningfully calculated for a matrix of this size.
To determine the relative effectiveness of SHA256 and SHA3 by using the Analytic Hierarchy Process (AHP), we first constructed a pairwise comparison matrix based on a chosen criterion, such as computational speed.In this matrix, the two hash functions were compared against each other, assigning a value to indicate how much more one is preferred over the other in terms of speed.SHA256 is considered moderately faster than SHA3, so it is assigned a value of 3, whereas SHA3 would conversely have a value of 1/3 compared to SHA256.Next, we normalized this matrix by dividing each element by its column total, effectively scaling the comparisons.The average of the values in each row of this normalized matrix was then calculated, resulting in a priority vector.This vector provided the weights for each hash function, reflecting their relative importance or preference based on speed.Finally, the average for SHA256 was higher than that for SHA3, which indicated a preference for SHA256 in terms of computational speed according to the AHP analysis.This method provided a systematic and quantitative approach to evaluating and comparing the two hash functions based on the selected criterion.

Evaluate the Best Data Structure for Video Blockchain
In this article, we carefully choose data structures and utilize their synergies to develop a strong framework for a blockchain-based computational approach.A fundamental objective in the development of blockchain applications is to uphold the integrity and confidentiality of the data.If the implementation can achieve the confidentiality of the data, it is possible to achieve the data privacy requirements [13].Therefore, we explore a range of data structures, including the Merkel tree [14], Hash list [15], H-tree [16], and SM-Tree (Sparse Merkle tree) [17] approaches.After a comprehensive evaluation and comparison of these technologies, we identify the most suitable data structure that aligns with our desired level of security.
To perform a comparative analysis using Merkle tree performance and other similar three data structures, in order to ensure a fair and objective evaluation, we utilize the same equation employed in Equation (1) to measure the computational efficiency of each approach.This performance assessment enables us to not only select the most secure method but also the one that offers the best balance between security and computational speed.This multi-faceted approach ensures that the blockchain-based computational solution we propose in this paper is both robust in its security features and efficient in its operations.As the landscape of blockchain continues to evolve, it is imperative to strike the right balance between security and performance, and our research aim is to achieve it precisely.
The corresponding results of using Equation ( 1) are shown in Figures 1 and 2; it is very hard to discern the differences from Figures 3 and 4. Therefore, we have employed the pairwise comparison matrix to show the scales for each comparison by measuring the average time.In addition, to obtain a more effective answer for Hypothesis 2 mentioned in Section 1, we have used Equation ( 2) for the MCDM method to find out the most suitable cryptographic data structures for our implementation within the IoT network.
comparison of these technologies, we identify the most suitable data structure that aligns with our desired level of security.
To perform a comparative analysis using Merkle tree performance and other similar three data structures, in order to ensure a fair and objective evaluation, we utilize the same equation employed in Equation ( 1) to measure the computational efficiency of each approach.This performance assessment enables us to not only select the most secure method but also the one that offers the best balance between security and computational speed.This multi-faceted approach ensures that the blockchain-based computational solution we propose in this paper is both robust in its security features and efficient in its operations.As the landscape of blockchain continues to evolve, it is imperative to strike the right balance between security and performance, and our research aim is to achieve it precisely.
The corresponding results of using Equation ( 1) are shown in Figures 1 and 2; it is very hard to discern the differences from Figures 3 and 4. Therefore, we have employed the pairwise comparison matrix to show the scales for each comparison by measuring the average time.In addition, to obtain a more effective answer for Hypothesis 2 mentioned in Section 1, we have used Equation ( 2) for the MCDM method to find out the most suitable cryptographic data structures for our implementation within the IoT network.In this article, we employed the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) method to assess and contrast different cryptographic data structures, including Merkle tree, Hash List, H-tree, and SM-Tree as show in the Table 2.The primary criterion for comparison was the performance, measured in execution time (seconds).We began by normalizing the performance data to ensure a fair comparison across different structures.Following this, we assigned equal weights to the performance criterion, acknowledging its crucial role in cryptographic operations.Subsequently, we calculated the ideal best and worst solutions to establish reference points for each criterion The separation measures for each cryptographic structure from these ideal solutions were then determined, leading to the computation of the relative closeness to the ideal In this article, we employed the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) method to assess and contrast different cryptographic data structures, including Merkle tree, Hash List, H-tree, and SM-Tree as show in the Table 2.The primary criterion for comparison was the performance, measured in execution time (seconds).We began by normalizing the performance data to ensure a fair comparison across different structures.Following this, we assigned equal weights to the performance criterion, acknowledging its crucial role in cryptographic operations.Subsequently, we calculated the ideal best and worst solutions to establish reference points for each criterion The separation measures for each cryptographic structure from these ideal solutions were then determined, leading to the computation of the relative closeness to the ideal solution for each structure.Based on these calculations, the Merkle tree emerged as the most efficient structure, demonstrating the lowest execution time and hence the highest relative closeness to the ideal solution.It was followed by the Hash List, H-tree, and SM-Tree, in descending order of efficiency [18].This ranking provides valuable insights into the comparative performance of these cryptographic structures, highlighting the Merkle tree's superiority in terms of speed and efficiency in our analysis.

The Integration of Video Blockchain Technology into IoT Networks
In this section, we introduce a novel approach aimed at strengthening data integrity within smart cities [19].Hence, in Sections 2.1 and 2.2, we have tested Hypothesis 1 and Hypothesis 2 to establish a strong base for establishing its connection with the IoT network.Our method seamlessly integrates SHA 256 hashing functions and Merkle tree cryptographic data structures.Also, in this section, we test the third hypothesis before launching our implementation.Therefore, a block matrix is used for data storage in IoT networks to ensure the utmost security and privacy of surveillance data [20][21][22][23].
The core of our methodology lies in the verification process, a meticulous procedure designed to identify alterations in image frame sequences and pinpoint specific image modifications.To accomplish this, we generate a dedicated Merkle tree for each data block, securely storing its root hash within the blockchain.This architectural design acts as a safeguard for data integrity, laying the foundation for a robust and secure blockchain implementation [23][24][25].
To rigorously test our methodology, we have meticulously curated multiple datasets containing sample videos for system integration.These surveillance videos, conventionally recorded at 25 frames per second [26], have been augmented to 30 frames per second in our study to include more comprehensive content in our experiments.Our research utilizes a dataset consisting of 7000 video frames centered around Auckland city.The primary aim is to create hash values for these video frames to increase their security and resilience against possible threats.
Our article serves as a pivotal link between surveillance video data and blockchain technology.We have established a decentralized repository for storing this critical data, with a primary focus on enhancing security and privacy.This enhancement is primarily driven by the strategic use of cryptographic algorithms for hashing and cryptographic data structure, setting our work apart from previous research.These algorithms play a pivotal role in ensuring the seamless connection of video frames, thereby facilitating the detection and localization of any frame alterations.Moreover, our verification procedure, incorporating Merkle trees and hashing functions, adds another layer of security.
Acknowledging the crucial role of maintaining privacy in blockchain applications, we introduce a solution based on blockchain technology designed to not only secure but also enhance the integrity of surveillance data within smart cities.Our goal is to build greater trust, provide dependable outcomes, and manage data disclosures with precision.By integrating computational techniques with video blockchain technology, we effectively manage data security, restrict unauthorized access, and facilitate detailed monitoring in sectors like law enforcement, insurance, and traffic management systems.Consequently, this aids in the necessary improvements for heightened security and compliance within the smart city video surveillance sector [21,22].To verify the integrity of frames, we create a Merkle tree using the hash values from the block matrix.By saving the root hash of the Merkle tree in the blockchain, we can identify any modifications through comparisons between block hashes and Merkle tree hashes, thereby incorporating a critical layer of tamper-proofing into our system.Furthermore, we investigate the capabilities of block matrix operations, such as matrix multiplication and inversion, for video processing functions including compression, filtering, and restoration.These processes are carried out on block matrices preserved in the blockchain, facilitating highly efficient and secure video processing tasks [27].The deployment of the Merkle tree function is crucial to our system.This function processes an array of data to iteratively build a Merkle tree.For the simplest scenario, when there is just a single piece of data, the function directly returns that piece.For more complex scenarios, it forms the left and right subtrees, combines their hashes using the SHA-3 algorithm, and outputs the aggregate hash.This final hash serves as the Merkle tree's root.The composite provides a comprehensive visualization of the blockchain privacy-secure methodology by integrating SHA-256, Merkle tree, and block matrix processes, as shown in Figure 5.In SHA-256, the blue line depicts the output of the SHA-256 hashing process over time, showcasing how input data blocks are transformed into cryptographic hashes.In Merkle tree, represented by the green line, the evolution of the Merkle root hash as adjacent data chunk hashes are paired and hashed, with the final point indicating the unique identifier for the entire set of data blocks.In Figure 5 Subplot 3 (block matrix), the orange line portrays the compression of data blocks organized in a matrix, highlighting the reduction in data size over time.The overall trends and interdependencies between these processes offer valuable insights into the efficiency of cryptographic hashing, Merkle tree construction, and data compression, contributing to a more secure and private blockchain methodology.
simplest scenario, when there is just a single piece of data, the function directly returns that piece.For more complex scenarios, it forms the left and right subtrees, combines their hashes using the SHA-3 algorithm, and outputs the aggregate hash.This final hash serves as the Merkle tree's root.The composite provides a comprehensive visualization of the blockchain privacy-secure methodology by integrating SHA-256, Merkle tree, and block matrix processes, as shown in Figure 5.In SHA-256, the blue line depicts the output of the SHA-256 hashing process over time, showcasing how input data blocks are transformed into cryptographic hashes.In Merkle tree, represented by the green line, the evolution of the Merkle root hash as adjacent data chunk hashes are paired and hashed, with the final point indicating the unique identifier for the entire set of data blocks.In Figure 5 Subplot 3 (block matrix), the orange line portrays the compression of data blocks organized in a matrix, highlighting the reduction in data size over time.The overall trends and interdependencies between these processes offer valuable insights into the efficiency of cryptographic hashing, Merkle tree construction, and data compression, contributing to a more secure and private blockchain methodology.The results portrayed in the composite plot provide several significant conclusions for the blockchain privacy-secure methodology.Firstly, the SHA-256 hashing process demonstrates the consistent and efficient transformation of input data blocks into cryptographic hashes, indicating the robustness of the chosen hashing algorithm.The evolving trend in the Merkle Tree construction reveals a systematic pairing and hashing of data chunk hashes, culminating in a unique Merkle root hash that serves as a reliable identifier for the entire dataset.
Additionally, the block matrix subplot underscores the effectiveness of compression algorithms, such as JPEG, in reducing the data size of video frames organized in a matrix.The interconnectedness of these processes, as evidenced by the integration points in the plot, signifies a cohesive and secure methodology.The reduction in data size through compression, coupled with the cryptographic integrity provided by SHA-256 and the The results portrayed in the composite plot provide several significant conclusions for the blockchain privacy-secure methodology.Firstly, the SHA-256 hashing process demonstrates the consistent and efficient transformation of input data blocks into cryptographic hashes, indicating the robustness of the chosen hashing algorithm.The evolving trend in the Merkle Tree construction reveals a systematic pairing and hashing of data chunk hashes, culminating in a unique Merkle root hash that serves as a reliable identifier for the entire dataset.
Additionally, the block matrix subplot underscores the effectiveness of compression algorithms, such as JPEG, in reducing the data size of video frames organized in a matrix.The interconnectedness of these processes, as evidenced by the integration points in the plot, signifies a cohesive and secure methodology.The reduction in data size through compression, coupled with the cryptographic integrity provided by SHA-256 and the Merkle Tree, collectively contribute to the enhancement of privacy and security [28][29][30] within the blockchain framework.
Overall, the results affirm the efficacy of the integrated approach, offering insights into the efficiency of individual components and their collaborative impact on the privacy and security attributes of the blockchain system.
The pivotal element in our system is the implementation of the Merkle Tree function.This function takes an array of data and recursively constructs a Merkle tree (Algorithm 1).In the context of Merkle Tree, denoted as D i for the i-th data block, and H(D i ) representing the cryptographic hash function applied to D i , the process involves breaking down the data blocks into consistent fixed-size chunks: Subsequently, the hash for each data chunk is calculated using the cryptographic hash function: Pairs of neighboring data chunk hashes are formed and the hash for each pair is computed: This process iterates until only one hash remains: The iteration continues until P i becomes the Merkle root hash: MerkleRootHash = P f inal .
Therefore, we extracted details on how the blockchain data structure operates in conjunction with the Merkle tree.In the future, we will further examine the video frame securing method of the block matrix algorithm and explore how it works with the Merkle tree to achieve our desired outcomes.(2) Arrange the blocks from each frame into a matrix format, with rows indicating blocks and columns denoting frames.
(3) Apply compression techniques (e.g., JPEG) to each block for data size reduction.(4) Store the resulting compressed block matrix in a binary format.
(5) To retrieve a specific frame, load the compressed matrix and select the appropriate column of blocks.(6) To access a particular block within a frame, locate and decompress the corresponding row from the matrix.
The block matrix algorithm involves several key steps.Initially, each frame of a video file is divided into fixed-size blocks (16 × 16 pixels), creating a frame sequence: These blocks are then organized into a matrix, M i , where each row represents a block of the i-th frame.Compression algorithms, such as JPEG, are applied individually to each block, resulting in a compressed form C ij for the j-th block in the i-th frame.The compressed block matrix is subsequently saved as a binary file using an appropriate method.While accessing a specific frame, the binary file is loaded, and the corresponding column of blocks is extracted.To access a particular block within a frame, the relevant row is retrieved from the block matrix, and the block is decompressed using the algorithm's specified decompression function.These steps collectively define the block matrix algorithm, facilitating efficient storage and retrieval of video data.
Algorithm 1 accepts an array of data along with a specified block size to create a matrix, where each matrix row corresponds to a data block.This process involves traversing the data array, dividing it into segments of the designated block size, and assigning each segment to the correct row within the matrix.Should the total length of the data array not be divided evenly by the block size, padding is added to the matrix's final row to compensate for the shortfall.
This Figure 6 presents a comparative analysis of the performance of the SHA-256 and SHA-3 hashing functions.The graph illustrates the average time taken by each hashing function to process a set of sample data strings.The vertical axis represents the average time in milliseconds, while the horizontal axis indicates the number of iterations.The comparison highlights the efficiency of each hashing function, providing insights into their suitability for integration into the video blockchain system.
Algorithm 1 accepts an array of data along with a specified block size matrix, where each matrix row corresponds to a data block.This process involv ing the data array, dividing it into segments of the designated block size, and each segment to the correct row within the matrix.Should the total length of the not be divided evenly by the block size, padding is added to the matrix's f compensate for the shortfall.
This Figure 6 presents a comparative analysis of the performance of the SH SHA-3 hashing functions.The graph illustrates the average time taken by ea function to process a set of sample data strings.The vertical axis represents t time in milliseconds, while the horizontal axis indicates the number of iteration parison highlights the efficiency of each hashing function, providing insight suitability for integration into the video blockchain system.These algorithms were utilized to securely and efficiently store data frames.By dividing the video frames into blocks and building a Merkle tree a blocks, the system ensures data integrity and authentication.This approach fac tributed storage, enabling the secure transfer of data from surveillance sy throughput (TP) is defined mathematically as follows: where TP is the throughput, measured in transactions (or blocks) per second ( Figure 7 depicts the efficiency of the SHA-256 and SHA-3 hashing functio of computational resource utilization.The graph showcases the relationship b size of the input data and the time required for hashing.The results indicate hashing function scales with increasing data size, which is critical for evaluatin formance in real-world IoT applications.These algorithms were utilized to securely and efficiently store data from video frames.By dividing the video frames into blocks and building a Merkle tree across these blocks, the system ensures data integrity and authentication.This approach facilitates distributed storage, enabling the secure transfer of data from surveillance systems.The throughput (TP) is defined mathematically as follows: where TP is the throughput, measured in transactions (or blocks) per second (TPS).Figure 7 depicts the efficiency of the SHA-256 and SHA-3 hashing functions in terms of computational resource utilization.The graph showcases the relationship between the size of the input data and the time required for hashing.The results indicate how each hashing function scales with increasing data size, which is critical for evaluating their performance in real-world IoT applications.

Results Analysis and Discussion
In this study, we explore the use of video blockchain technology within IoT networks.Our method entails transforming recorded videos into discrete frames, each ranging in size from 50 KB to 1024 KB.These frames were used to create a private blockchain system on a Windows 11 64-bit platform.We set up an experimental framework to evaluate the effectiveness of this innovative technique in defending against various cyber threats.This led to the formulation of new computational strategies for video blockchains, integrating distinct cryptographic algorithms within the video blockchain architecture.This paper makes a novel contribution to the field of video blockchain by proposing a unique strategy for enhancing the privacy of video data within IoT networks.The findings of this research have the potential to lay the groundwork for future studies on video blockchain technology and cryptographic methodologies.
In Figure 8, we analyze the impact of varying data sizes on the execution time.The graph provides a detailed view of the time taken by each hashing function as the input data size increases.This information is vital for understanding the behavior of the hashing functions under different data load conditions and assessing their potential scalability in a blockchain-based IoT network.

Results Analysis and Discussion
In this study, we explore the use of video blockchain technology within IoT networks.Our method entails transforming recorded videos into discrete frames, each ranging in size from 50 KB to 1024 KB.These frames were used to create a private blockchain system on a Windows 11 64-bit platform.We set up an experimental framework to evaluate the effectiveness of this innovative technique in defending against various cyber threats.This led to the formulation of new computational strategies for video blockchains, integrating distinct cryptographic algorithms within the video blockchain architecture.This paper makes a novel contribution to the field of video blockchain by proposing a unique strategy for enhancing the privacy of video data within IoT networks.The findings of this research have the potential to lay the groundwork for future studies on video blockchain technology and cryptographic methodologies.
In Figure 8, we analyze the impact of varying data sizes on the execution time.The graph provides a detailed view of the time taken by each hashing function as the input data size increases.This information is vital for understanding the behavior of the hashing functions under different data load conditions and assessing their potential scalability in a blockchain-based IoT network.

Results Analysis and Discussion
In this study, we explore the use of video blockchain technology within IoT networks.Our method entails transforming recorded videos into discrete frames, each ranging in size from 50 KB to 1024 KB.These frames were used to create a private blockchain system on a Windows 11 64-bit platform.We set up an experimental framework to evaluate the effectiveness of this innovative technique in defending against various cyber threats.This led to the formulation of new computational strategies for video blockchains, integrating distinct cryptographic algorithms within the video blockchain architecture.This paper makes a novel contribution to the field of video blockchain by proposing a unique strategy for enhancing the privacy of video data within IoT networks.The findings of this research have the potential to lay the groundwork for future studies on video blockchain technology and cryptographic methodologies.
In Figure 8, we analyze the impact of varying data sizes on the execution time.The graph provides a detailed view of the time taken by each hashing function as the input data size increases.This information is vital for understanding the behavior of the hashing functions under different data load conditions and assessing their potential scalability in a blockchain-based IoT network.The analysis of the hashing functions revealed that SHA-256 and the Merkle tree provide robust security features suitable for securing video data in IoT networks.The performance benchmarking showed that SHA-256 offers a balance between security and computational efficiency, making it a viable option for real-time video data processing.The Merkle tree, on the other hand, demonstrated its effectiveness in handling large datasets, which is essential for managing the high volume of video data generated in IoT environments.
The implications of these findings on IoT network security and data privacy are significant.The adoption of SHA-256 and the Merkle tree in video blockchain systems can enhance the integrity and confidentiality of video data, protecting it from unauthorized access and tampering.Furthermore, the efficient performance of these cryptographic functions ensures that the security measures do not impede the real-time processing and transmission of video data, which is crucial for maintaining the functionality and responsiveness of IoT networks.
Overall, our results underscore the importance of selecting appropriate cryptographic functions for video blockchain integration in IoT networks.By ensuring both security and efficiency, we can create a more secure and privacy-preserving IoT ecosystem, where video data are protected without compromising the network's performance.
Each root structure in the Merkle tree validates the sequence and hashing order of video frames, safeguarding against any unauthorized modifications to the sequence unless the entire root structure is altered.We are actively working to integrate a feature for detecting changes in real time into the system, thereby increasing its reliability and strengthening its defense against attacks that compromise privacy and those conducted by quantum computers.The findings from this research provide critical insights into the development of web interfaces for video blockchain systems, establishing a solid foundation for enhancing the dependability and security of such systems in the future.
In this article, we concentrate on a hypothesis based on a testing mechanism to develop methodologies for data structure.In Section 2, the hypotheses were rigorously tested and validated to ensure the robustness of our methodology, ultimately contributing to achieving the objectives of this research work.The evaluation involved measuring the computational time and data size for each experiment, with each iteration repeated 100 times to mitigate errors stemming from outliers.Figure 8 illustrates an ascending trend in computational time concerning the increase in data size for the three Merkle tree-based approaches.However, beyond 100 KB of data, these approaches display only minor differences, as the generation of a Merkle tree for a 1 MB data file constitutes 99.9% of the computational time required by the prover.We graphically depict the results to ascertain time complexity, which is contingent on varying input sizes and block sizes, contributing to the determination of the function's time complexity.
The incorporation of blockchain into IoT networks confronts several challenges, including scalability, interoperability, and regulatory compliance.Addressing these challenges entails scaling blockchain to manage substantial data volumes and transactions, seamlessly integrating it with existing systems, and navigating complex regulatory frameworks.In our forthcoming work, we plan to devise solutions to tackle these issues.

Conclusions
Our central objective revolves around establishing a symbiotic relationship between video frames, as captured by the IoT video network, and the blockchain.Our innovative approach lies in the seamless integration of this data into a decentralized storage platform purpose-built for IoT video network security.What sets our work apart from the existing work is its heavy reliance on cryptographic functions, which are instrumental in extracting hash values and signatures from video blockchains.This, in turn, fortifies the security of surveillance data, ensuring its integrity in a tamper-resistant environment.
Notably, the focus of our research work is primarily on enhancing the robustness of data storage within IoT systems rather than centering on the mitigation of potential risks

Figure 3 .
Figure 3. Performance analysis of cryptographic Merkel tree, Hash list H-tree, and SM-Tree (Sparse Merkle tree) data structures.

Figure 3 .
Figure 3. Performance analysis of cryptographic Merkel tree, Hash list H-tree, and SM-Tree (Sparse Merkle tree) data structures.

Algorithm 1 :
Block MatrixInput: A video file consisting of frames.(1)Divide each frame into uniform blocks of 16 × 16 pixels.

Figure 6 .
Figure 6.Average computational time (in milliseconds) for Merkle tree-based authe cording to data size.

Figure 6 .
Figure 6.Average computational time (in milliseconds) for Merkle tree-based authentication according to data size.

Figure 7 .
Figure 7. Analysis of the throughput vs. data input size.

Figure 8 .
Figure 8.Comparison of computational time between our work and similar studies [31-33].

Figure 7 .
Figure 7. Analysis of the throughput vs. data input size.

Figure 7 .
Figure 7. Analysis of the throughput vs. data input size.

Figure 8 .
Figure 8.Comparison of computational time between our work and similar studies [31-33].Figure 8. Comparison of computational time between our work and similar studies [31-33].

Figure 8 .
Figure 8.Comparison of computational time between our work and similar studies [31-33].Figure 8. Comparison of computational time between our work and similar studies [31-33].

Table 2 .
(TOPSIS) method to evaluate and compare various cryptographic data structures.

Table 2 .
(TOPSIS) method to evaluate and compare various cryptographic data structures.