Sharif Digital Repository

Cloud storage systems have been turned into the primary services of Internet users nowadays. While the application of such systems is exponentially increasing, deduplication algorithms help face scalability issues. Although source-side deduplication optimizes both storage and bandwidth, the main concern that deduplication algorithms suffer from is still data confidentiality. Message-locked encryption (MLE) is a well-known key management framework for secure deduplication to provide confidentiality. This framework is the basis of almost all the proposed secure deduplication solutions. Even though there are lots of literature works trying to provide secure deduplication algorithms, to the best... 

Key pre-distribution algorithms have recently emerged as efficient alternatives of key management in today's secure communications landscape. Secure routing techniques using key pre-distribution algorithms require special algorithms capable of finding optimal secure overlay paths. To the best of our knowledge, the literature of key pre-distribution systems is still facing a major void in proposing optimal overlay routing algorithms. In the literature work, traditional routing algorithms are typically used twice to find a NETWORK layer path from the source node to the destination and then to find required cryptographic paths. In this paper, we model the problem of secure routing using... 

Mesh point positions in Finite Difference Method (FDM) of discretization for the neutron diffusion equation can remarkably affect the averaged neutron fluxes as well as the effective multiplication factor. In this study, by aid of improving the mesh point positions, an enhanced finite difference scheme for the neutron diffusion equation is proposed based on the neutron importance function. In order to determine the neutron importance function, the adjoint (backward) neutron diffusion calculations are performed in the same procedure as for the forward calculations. Considering the neutron importance function, the mesh points can be improved through the entire reactor core. Accordingly, in... 

Today, peer-to-peer networks are become more popular among internet users and more than millions peers share high volume of data from anywhere. Sending and receiving these data increase the network traffics terribly. By improving the performance of these networks not only the efficiency of these networks increase but also the overall performance of the internet augments. To achieve high performance and resilience to failures, a peer can make connections with those other peers that are geographically closer to it. In this paper, we present a novel mechanism for placing peers on the overlay network, which supports locality without increasing network traffic seriously  

Unstructured wireless networks such as mobile ad hoc networks and wireless sensor networks have been rapidly growing in the past decade. Security is known as a challenging issue in such networks, in which there is no fixed infrastructure or central trusted authority. Further, node limitations in processing power, storage, and energy consumption add further complexity to addressing security in such networks. While cryptography has proven to be an effective solution capable of satisfying most network security requirements, it requires the use of efficient key pre-distribution algorithms compatible with the limitation of unstructured wireless networks. Typically, a key pre-distribution... 

Probabilistic key pre-distribution schemes have recently emerged as major tools of addressing secure routing challenge in wireless networks. In our previous work, we propose an algorithm capable of finding optimal secure paths in overlay wireless networks. An important concern related to that algorithm is the scalability of the solution for large scale networks containing thousands of nodes. In this paper, we propose two alternative solutions for the previously formulated problem of secure overlay routing that can effectively scale to thousands of nodes. The first one is a deterministic Dijkstra-based algorithm analytically proven to find the optimal path with a time complexity much lower... 

Peer-to-Peer (P2P) cloud systems are becoming more popular due to the high computational capability, scalability, reliability, and efficient data sharing. However, sending and receiving a massive amount of data causes huge network traffic leading to significant communication delays. In P2P systems, a considerable amount of the mentioned traffic and delay is owing to the mismatch between the physical layer and the overlay layer, which is referred to as locality problem. To achieve higher performance and consequently resilience to failures, each peer has to make connections to geographically closer peers. To the best of our knowledge, locality problem is not considered in any well known P2P... 

Mobile ad hoc networks (MANETs) have been turned into very attractive area of research in the duration of recent years, whereas security is the most challenging point that they undergo. Cryptography is an essential solution for providing security within MANETs. However, storing all keys in every node, if practically possible, is inefficient in large scale MANETs due to some limitations such as memory or process capability. This paper extends our previous idea which was a novel probabilistic key management algorithm that stores only a few randomly chosen keys instead of all ones. In this paper, several different scenarios are proposed for key selection in which they are more practical, and... 

Mobile ad hoc networks (MANETs) have received considerable attention while their special characteristics make them vulnerable against different attacks. Providing security in such networks becomes a challenge and cryptography is an essential solution for it, to implement a cryptosystem, key management is the main challenge. In this paper a new deterministic scheme for key management in MANETs is proposed. Since public and private keys in this algorithm have an unforgeable relationship, there is no need for any certificate. Proposed scheme distributes the role of the key generation center (KGC) among all nodes, therefore the private key is issued by distributed KGCs (DKGCs) and the node... 

Dynamic nature of mobile ad hoc networks combined with their lack of centralized infrastructure make security problem the most challenging issue in such networks. The main contribution of this paper is to propose a secure and efficient key management algorithm, able to satisfying the requirement of such networks and facing their specific characteristics. The proposed algorithm is a fully distributed ID-based system which is built based on elliptic curve cryptography. The main advantage of the proposed algorithm, that gives it the superiority in its field of research, is the improvement of the performance and the security strength together. The proposed algorithm is implemented with much... 

Mobile ad hoc networks (MANETs) have become very interesting during last years, but the security is the most important problem they suffer from. Asymmetric cryptography is a very useful solution to provide a secure environment in multihop networks where intermediate nodes are able to read, drop or change messages before resending them. However, storing all keys in every node by this approach is inefficient, if practically possible, in large-scale MANETs due to some limitations such as memory or process capability. In this paper, we propose a new probabilistic key management algorithm for large-scale MANETs. To the best of our knowledge, this is the first method which probabilistically uses... 

Effective delayed neutron fraction βeff and neutron generation time Λ are important factors in reactor physics calculation and transient analysis. In the first stage of this research, these kinetic parameters have been calculated for two states of Tehran Research Reactor (TRR), i.e. cold (fuel, clad and coolant temperatures equal to 20 °C) and hot (fuel, clad and coolant temperatures of 65, 49 and 44 °C, respectively) states using MTR_PC code. In the second stage, these parameters have been measured with an experimental method based on Inhour equation. For the cold state, calculated βeff and Λ by MTR_PC code are 0.008315 and 30.190 μs, respectively. In the hot state, these parameters being... 

Effective delayed neutron fraction βeff and neutron generation time Λare important factors in reactor physics calculation and transient analysis. In first stage of this research, these kinetics parameters have been calculated for two states of Tehran research reactor (TRR), i.e. cold (fuel, clad and coolant temperature 20°C) and hot (fuel, clad and coolant temperature 65, 49 and 44°C, respectively) using MTR-PC code. In second stage, these parameters have been measured with experimental method based on Inhour equation. For cold state, calculated βeff and Λ by MTR-PC are 0.008315 and 30.190 μsec, respectively. Same parameters in hot state are 0.008303 and 33.828 μsec, respectively. The... 

Vehicular ad hoc networks have attracted the attention of many researchers during the last years due to the emergence of autonomous vehicles and safety concerns. Most of the frameworks which are proposed for the modeling and analysis VANET applications make use of simulation techniques. Due to the high level of concurrency in these applications, simulation results do not guarantee the correct behavior of the system and more accurate analysis techniques are required. In this paper, we have developed a framework to provide model checking facilities for the analysis of VANET applications. To this end, an actor-based modeling language, Rebeca, is used which is equipped with a variety of model... 

Using reverse nonequilibrium molecular dynamics simulations the influence of intermolecular bridges on the thermal conductivity (λ) in carbon nanotube (CNT) bundles has been investigated. The chosen cross linkers (CH 2, O, CO) strengthen the transversal energy transport relative to the one in CNT bundles without bridges. The results showed that λ does not increase linearly with the linker density. The efficiency of the heat transport is determined by the number of linkers in the direction of the heat flux, the type of the linker, and their spatial ordering. The influence of a forced axial stress on the transversal λ has been also studied. The observed λ reduction with increasing axial... 

We employ reverse nonequilibrium molecular dynamics simulations to investigate the interfacial heat transfer in composites formed by an ungrafted or a grafted carbon nanotube which is surrounded by oligomeric polyamide-6,6 chains. The structural properties of the polymer matrix and the grafted chains are also studied. The influence of the grafting density, the length of the grafted chains as well as their chemical composition on the interfacial thermal conductivity (λi) are in the focus of our computational study. For the considered grafted polyethylene and polyamide chains we do not find a sizeable difference in the observed λi values. In contrast to this...