The Integrated Bicultural Referent of the Built Colonial Heritage: Social Housing Models in Oran (1954–1958), Algeria

The built heritage of the 1950s French colonial era represents the complexity of the hybrid cultural identity bequeathed by history but attracts minimal interest and consid­eration as an accepted local heritage. This research focuses on the opportunities and misconceptions about cultural reinterpretations and on the role a given society plays in the definition of cultural and patrimonial identity. For this purpose, the paper explores four social housing models and their derivatives (Nid d’abeilles, Sémiramis, Trèfle and Brunie) built during the French colonial period between 1954 and 1958 in Oran, Alge­ria. The historical analysis, supported by a qualitative study of the spatio-temporal evo­lution of these public housing projects, is based on the dynamics of cultural transfers. It aims to understand the interweaving and evolution of formal, organizational and func­tional reinterpretations of architectural components generated by western architects and remodeled by the local population. The result identifies hybrid cultural housing and highlights the pivotal role of social stakeholders in the acceptance and accommodation of mixed models. It encourages the identification of sustained and integrated bicultural referents which reflect the contemporary cultural identity.Il patrimonio costruito dell’epoca coloniale francese degli anni ’50 rappresenta la complessità dell’identità culturale ibrida ereditata dalla storia, ma attrae un minimo interesse e considerazione come patrimonio locale accettato. Questa ricerca si con­centra sulle opportunità e sui pregiudizi, sulle reinterpretazioni culturali e sul ruolo che una determinata società svolge nella definizione dell’identità culturale e patrimoniale. A questo scopo, il documento esplora quattro modelli di alloggi sociali e i loro deri­vati (Nid d’abeilles, Sémiramis, Trèfle e Brunie) costruiti durante il periodo coloniale francese tra il 1954 e il 1958 a Oran, in Algeria. L’analisi storica, supportata da uno studio qualitativo dell’evoluzione spazio-temporale di questi progetti di edilizia pub­blica, si basa sulla dinamica dei trasferimenti culturali. Mira a comprendere l’intreccio e l’evoluzione delle reinterpretazioni formali, organizzative e funzionali delle componenti architettoniche generate dagli architetti occidentali e rimodellate dalla popolazione lo­cale. Il risultato identifica l’alloggiamento culturale ibrido e mette in luce il ruolo centrale degli attori sociali nell’accettazione e nella sistemazione di modelli misti. Incoraggia l’identificazione di referenti biculturali sostenuti e integrati che riflettono l’identità cul­turale contemporanea

Secure Key Exchange Against Man-in-the-Middle Attack: Modified Diffie-Hellman Protocol

One of the most famous key exchange protocols is Diffie-Hellman Protocol (DHP) which is a widely used technique on which key exchange systems around the world depend. This protocol is simple and uncomplicated, and its robustness is based on the Discrete Logarithm Problem (DLP). Despite this, he is considered weak against the man-in-the-middle attack. This article presents a completely different version of the DHP protocol. The proposed version is based on two verification stages. In the first step, we check if the pseudo-random value α that Alice sends to Bob has been manipulated! In the second step, we make sure that the random value β that Bob sends to Alice is not manipulated. The man-in-the-middle attacker Eve can impersonate neither Alice nor Bob, manipulate their exchanged values, or discover the secret encryption key

Incidence de la vitesse de déplacement d’une paroi de soutènement sur la rupture d’un matériau analogique par poussée

This paper illustrated the physical modeling of the phenomenon of Active Earth Pressure and kinetics of rupture in the granular soils. Better, understand the phenomenon of Active Earth Pressure and mechanisms of failure behind the retaining walls will contribute to better conceiving them and will make claims less damaging. The exploitation of a small-scale model filled with Schneebeli material;light two-dimensional material simulating granular non-cohesive soil, allowed tests realization of Active Earth Pressure by moving the mobile wall of the device towards the outside of two-dimensional material. The evolution of the shear bands has highlighted the locations of the deformations. The results showed that the wall's speed of movement influences the failure mechanism and is proportional to the disturbance of the granular soil. In perspective, it would be judicious to explore the failure on real soil reinforced by recycled materials. Cet article s’intéresse au domaine de modélisation physique du phénomène de poussée des terres et de la cinétique de rupture rencontrée dans les milieux granulaires. Mieux comprendre le phénomène de poussée et les mécanismes de rupture derrière les ouvrages de soutènement contribuera à mieux les concevoir et permettra de rendre les sinistres moins dommageables. L’exploitation d’un modèle réduit rempli avec un matériau bidimensionnel de Schneebeli léger a permis la réalisation des essais de poussée en déplaçant la paroi mobile du dispositif vers l’extérieur du massif. L’évolution des bandes de cisaillement a mis en avant les localisations des déformations. Les résultats ont montré que la vitesse de déplacement du mur influe sur le mécanisme de rupture et qu’elle est proportionnelle à la perturbation du milieu granulaire. En perspective, il serait judicieux d’explorer la rupture sur sol réel conforté par des matériaux recyclés.Le présent article s’intéresse au domaine de modélisation physique du phénomène de poussée des terres et de la cinétique de rupture rencontrée dans les milieux granulaires. Mieux comprendre le phénomène de poussée et les mécanismes de rupture derrière les ouvrages de soutènement contribuera à mieux les concevoir et permettra de rendre les sinistres moins dommageables. L’exploitation d’un modèle réduit rempli avec un matériau bidimensionnel de Schneebeli léger a permis la réalisation des essais de poussée en déplaçant la paroi mobile du dispositif vers l’extérieur du massif. L’évolution des bandes de cisaillement a mis en avant les localisations des déformations. Les résultats ont montré que la vitesse de déplacement du mur influe sur le mécanisme de rupture et qu’elle est proportionnelle à la perturbation du milieu granulaire. En perspective, il serait judicieux d’explorer la rupture sur sol réel conforté par des matériaux recyclés

Secure Key Exchange Against Man-in-the-Middle Attack: Modified Diffie-Hellman Protocol

One of the most famous key exchange protocols is Diffie-Hellman Protocol (DHP) which is a widely used technique on which key exchange systems around the world depend. This protocol is simple and uncomplicated, and its robustness is based on the Discrete Logarithm Problem (DLP). Despite this, he is considered weak against the man-in-the-middle attack. This article presents a completely different version of the DHP protocol. The proposed version is based on two verification stages. In the first step, we check if the pseudo-random value α that Alice sends to Bob has been manipulated! In the second step, we make sure that the random value β that Bob sends to Alice is not manipulated. The man-in-the-middle attacker, Eve, can impersonate neither Alice nor Bob, manipulate their exchanged values, or discover the secret encryption key

One Digit Checksum for Data Integrity Verification of Cloud-executed Homomorphic Encryption Operations

Homomorphic Encryption~(HE) is used in many fields including information storage, data protection, privacy preservation, blockchain, and authentication. HE allows an untrusted third party to perform algebraic operations on encrypted data. Protecting the results of HE against accidental or malicious tampering attacks is still an open research challenge. In this paper, we introduce a lightweight technique that allows a data owner to verify the integrity of HE results performed in the cloud. The proposed method is quick, simple, and applicable, as it depends on adding a single digit to the encrypted message before storing it in the cloud. This digit represents verification proof and it is later used to ensure a verifiable HE. Our technique can be integrated with any HE scheme that uses encryption with non-isolated plaintext

A secure multi-agent-based decision model using a consensus mechanism for intelligent manufacturing tasks

Multi-agent systems (MASs) have gained a lot of interest recently, due to their ability to solve problems that are difficult or even impossible for an individual agent. However, an important procedure that needs attention in designing multi-agent systems, and consequently applications that utilize MASs, is achieving a fair agreement between the involved agents. Researchers try to prevent agreement manipulation by utilizing decentralized control and strategic voting. Moreover, emphasis is given to local decision making and perception of events occurring locally. This manuscript presents a novel secure decision-support algorithm in a multi-agent system that aims to ensure the system’s robustness and credibility. The proposed consensus-based model can be applied to production planning and control, supply chain management, and product design and development. The algorithm considers an open system; i.e., the number of agents present can be variable in each procedure. While a group of agents can make different decisions during a task, the algorithm chooses one of these decisions in a way that is logical, safe, efficient, fast, and is not influenced by factors that might affect production

A binary matrix-based data representation for data compression in blockchain

Blockchain relies on storing and verifying a large volume of data across multiple nodes, making efficient data compression techniques crucial. By reducing the size of data, compression techniques enable more data to be stored within the limited space constraints of the blockchain networks. Furthermore, compressed data consumes less bandwidth for transmission and enhances the overall performance of blockchain networks by reducing the time and resources needed for data storage and retrieval. To overcome this issue, this paper presents a new data representation approach to enable efficient storage and management of diverse data types on the blockchain, ensuring scalability, cost-effectiveness, and improved network efficiency. A binary matrix M of size m x n bits can be converted to two vectors H and V of sizes m’ and n’, respectively. The compression rate expressed by (m‘ + n’ + │ Hash(M) │) x 100/(m × n) increases exponentially, i.e., 2 λ with λ depends on m and n); this makes the proposed technique is very effective in data size reduction. With a matrix, for example, M = 512 x 512 bits, we achieve a rate of reduction equal to 96.42%. The original data can be recovered using H, V, and Hash(M). The conversion from M to (H, V) is simple, which optimizes energy consumption for low-power devices. Meanwhile, the challenge of recovering the original data could be exploited in a blockchain process, where the mining consensus could be identified based on the node that recovered a predefined set of vectors. Furthermore, this technique ensures that data integrity checking is available only at the nodes with a massive computation capacity

An Enhanced Threshold RSA-Based Aggregate Signature Scheme to Reduce Blockchain Size

The transformative potential of blockchain technology has resulted in its widespread adoption, bringing about numerous advantages such as enhanced data integrity, transparency, and decentralization. Blockchain has effectively proven its ability to establish trustworthy systems across a multitude of applications. As the number of transactions recorded into a blockchain grows, the blockchain's size expands significantly, posing challenges to the network, particularly in terms of storage capacity and processing power. To address this problem, we present a cryptosystem based on RSA to provide aggregate signatures in blockchains. The aggregate signature replaces all transaction signatures of a block. In this scheme, all participating blockchain nodes use the same modulus $N$ , each with its own private and public key pair generated from $N$. Regardless of the number of transactions, nodes, and signers, the aggregate signature size is always $O(k)$ , where $k$ is a security parameter. The miner that constructs a candidate block computes the aggregate signature $\sigma$ , replaces all transaction signatures by $\sigma$ , and transmits the block with only one aggregate signature. The proposed scheme incorporates a flexible and accountable subgroup aggregate signature mechanism, allowing any subset $t$ of $n$ total elements to sign data, where $t$ is the required number of signers. To verify that a set of elements signed the block, the verifier requires the aggregate signature, the aggregate public key, and the data hash. This approach requires minimal interaction between the signers, which results in reduced network traffic. Regardless of the network size, there are always $t + n$ exchanged messages. Experimental analysis shows the proposed aggregate signature scheme's effectiveness in increasing security robustness and reducing block size and overall network traffic