A Novel Secure Occupancy Monitoring Scheme Based on Multi-Chaos Mapping

Smart building control, managing queues for instant points of service, security systems, and customer support can benefit from the number of occupants information known as occupancy. Due to interrupted real-time continuous monitoring capabilities of state-of-the-art cameras, a vision-based system can be easily deployed for occupancy monitoring. However, processing of images or videos over insecure channels can raise several privacy concerns due to constant recording of an image or video footage. In this context, occupancy monitoring along with privacy protection is a challenging task. This paper presents a novel chaos-based lightweight privacy preserved occupancy monitoring scheme. Persons’ movements were detected using a Gaussian mixture model and Kalman filtering. A specific region of interest, i.e., persons’ faces and bodies, was encrypted using multi-chaos mapping. For pixel encryption, Intertwining and Chebyshev maps were employed in confusion and diffusion processes, respectively. The number of people was counted and the occupancy information was sent to the ThingSpeak cloud platform. The proposed chaos-based lightweight occupancy monitoring system is tested against numerous security metrics such as correlation, entropy, Number of Pixel Changing Rate (NPCR), Normalized Cross Correlation (NCC), Structural Content (SC), Mean Absolute Error (MAE), Mean Square Error (MSE), Peak to Signal Noise Ratio (PSNR), and Time Complexity (TC). All security metrics confirm the strength of the proposed scheme

Chaos-Based Confusion and Diffusion of Image Pixels Using Dynamic Substitution

The evolution of wireless and mobile communication from 0G to the upcoming 5G gives riseto data sharing through the Internet. This data transfer via open public networks are susceptible to severaltypes of attacks. Encryption is a method that can protect information from hackers and hence confidentialdata can be secured through a cryptosystem. Due to the increased number of cyber attacks, encryption hasbecome an important component of modern-day communication. In this paper, a new image encryptionalgorithm is presented using chaos theory and dynamic substitution. The proposed scheme is based on twodimensional Henon, Ikeda chaotic maps, and substitution box (S-box) transformation. Through Henon, arandom S-Box is selected and the image pixel is substituted randomly. To analyze security and robustnessof the proposed algorithm, several security tests such as information entropy, histogram investigation,correlation analysis, energy, homogeneity, and mean square error are performed. The entropy values ofthe test images are greater than 7.99 and the key space of the proposed algorithm is 2^798. Furthermore, thecorrelation values of the encrypted images using the the proposed scheme are close to zero when comparedwith other conventional schemes. The number of pixel change rate (NPCR) and unified average changeintensity (UACI) for the proposed scheme are higher than 99.50% and 33, respectively. The simulationresults and comparison with the state-of-the-art algorithms prove the efficiency and security of the proposed scheme

An Efficient Lightweight Image Encryption Scheme Using Multichaos

With an immense increase in Internet multimedia applications over the past few years, digital content such as digital images are stored and shared over global networks, the probability for information leakage and illegal modifications to the digital content is at high risk. These digital images are transferred using the network bandwidth; therefore, secure encryption schemes facilitate both information security and bandwidth issues. Hence, a state-of-the-art lightweight information security methodology is required to address this challenge. The main objective of this work is to develop a lightweight nonlinear mechanism for digital image security using chaos theory. The proposed scheme starts by changing a plain image into an encrypted image to improve its security. A block cipher, using lightweight chaos, has been added to achieve this objective for digital image security. We utilized multiple chaotic maps to generate random keys for each channel. Also, Arnold cat map and chaotic gingerbread map are used to add confusion and diffusion. During the permutation stage, image pixels are permuted, while in diffusion stage, pixels are distorted utilizing gingerbread map to add more security. The proposed scheme has been validated using different security parameter tests such as correlation coefficient tests (CC), whose results have been observed closer to zero and information entropy (IE) value is 7.99, respectively, which is almost equal to the ideal value of 8. Moreover, number of pixels changing rate (NPCR) obtained value is higher than 99.50%, while the unified average changing intensity (UACI) is 33.33. Other parameters such as mean absolute error (MAE), mean square error (MSE), lower value of peak to signal noise ratio (PSNR), structural content (SC), maximum difference (MD), average difference (AD), normalized cross-correlation (NCC), and histogram analysis (HA) is tested. The computed values of the proposed scheme are better. The achieved results after comparison with existing schemes highlight that the proposed scheme is highly secure, lightweight, and feasible for real-time communications

A novel symmetric image cryptosystem resistant to noise perturbation based on S8 elliptic curve S-boxes and chaotic maps

The recent decade has seen a tremendous escalation of multimedia and its applications. These modern applications demand diverse security requirements and innovative security platforms. In this manuscript, we proposed an algorithm for image encryption applications. The core structure of this algorithm relies on confusion and diffusion operations. The confusion is mainly done through the application of the elliptic curve and S8 symmetric group. The proposed work incorporates three distinct chaotic maps. A detailed investigation is presented to analyze the behavior of chaos for secure communication. The chaotic sequences are then accordingly applied to the proposed algorithm. The modular approach followed in the design framework and integration of chaotic maps into the system makes the algorithm viable for a variety of image encryption applications. The resiliency of the algorithm can further be enhanced by increasing the number of rounds and S-boxes deployed. The statistical findings and simulation results imply that the algorithm is resistant to various attacks. Moreover, the algorithm satisfies all major performance and quality metrics. The encryption scheme can also resist channel noise as well as noise-induced by a malicious user. The decryption is successfully done for noisy data with minor distortions. The overall results determine that the proposed algorithm contains good cryptographic properties and low computational complexity makes it viable to low profile applications

Algebraic Techniques for Low Communication Secure Protocols

Internet communication is often encrypted with the aid of mathematical problems that are hard to solve. Another method to secure electronic communication is the use of a digital lock of which the digital key must be exchanged first. PhD student Robbert de Haan (CWI) researched models for a guaranteed safe communication between two people without the exchange of a digital key and without assumptions concerning the practical difficulty of solving certain mathematical problems. In ancient times Julius Caesar used secret codes to make his messages illegible for spies. He upped every letter of the alphabet with three positions: A became D, Z became C, and so on. Usually, cryptographers research secure communication between two people through one channel that can be monitored by malevolent people. De Haan studied the use of multiple channels. A minority of these channels may be in the hands of adversaries that can intercept, replace or block the message. He proved the most efficient way to securely communicate along these channels and thus solved a fundamental cryptography problem that was introduced almost 20 years ago by Dole, Dwork, Naor and Yung

Keeping Fairness Alive : Design and formal verification of optimistic fair exchange protocols

Fokkink, W.J. [Promotor]Pol, J.C. van de [Promotor

The carbon offset problem and how SMEs should approach it! A qualitative analysis of carbon offset strategies for SMEs in the Netherlands.

Small and medium-sized enterprises (SMEs) often lack the resources and knowledge to navigate the voluntary carbon offset market (COM), which is characterized by uncertainty, unclear regulations, and opaque practices. However, as SMEs account for a large share of global emissions, it is crucial to encourage and enable them to take actions to reduce their carbon footprint. This thesis aims to provide SMEs with a better understanding of carbon offsetting, the problems associated with it, and how to choose the most effective strategy. The thesis includes a literature review of the background of Carbon Dioxide (CO2) offsetting, including the different types of CO2 markets and the history of mandatory and voluntary carbon offset policies. The expected future of carbon offset policies is also discussed. Carbon offsetting has been developed as a market-based mechanism to reduce Greenhouse Gas (GHG) emissions. It allows companies and individuals to offset their own emissions by investing in projects that reduce emissions elsewhere. There are two types of carbon markets, namely mandatory and voluntary. Mandatory carbon markets are implemented through government regulations, while the voluntary carbon market (VCM) is driven by companies and individuals who choose to offset their emissions voluntarily. The history of mandatory carbon offset policies can be traced back to the Kyoto Protocol, which established the Clean Development Mechanism (CDM). This mechanism allowed developed countries to offset their emissions by investing in emissions reduction projects in developing countries. However, there were many issues with the CDM, such as the potential for double counting and the lack of additionality (projects financed with offset funds that would also happen without these funds). Voluntary carbon offset policies have been developed by companies and individuals who wish to reduce their carbon footprint voluntarily. This market has grown rapidly in recent years, but it is characterized by a lack of transparency and regulation, making it difficult for SMEs to navigate. The potential risks associated with voluntary carbon offsetting include the quality and sustainability of offset projects, non-additionality, and the potential negative impacts on environments and people located near the offset projects. To address the challenges associated with carbon offsetting for SMEs, this thesis uses the multi-criteria decision analysis (MCDA) framework to evaluate and select the most appropriate carbon offsetting strategy. The MCDA model is based on the identification of key decision criteria, including cost, transparency, and environmental impact, as well as the development of weightings and scoring for each criterion. The thesis concludes with recommendations for SMEs to address the challenges of carbon offsetting, such as engaging in due diligence, verifying the quality of offset projects, and considering the long-term sustainability of their offsetting strategy. The proposed MCDA framework can be used by SMEs to evaluate their carbon offsetting options and select the most appropriate strategy based on their specific needs and priorities. In conclusion, this thesis provides SMEs with a better understanding of the COM, the challenges associated with carbon offsetting, and how to choose the most effective strategy. The proposed MCDA framework can assist SMEs in making informed decisions about their carbon offsetting practices, leading to a more sustainable and environmentally responsible business ecosystem