Statistical independence of instances of primitives and protocols is a clear-cut approach for guaranteeing protection against harmful interactions in concurrent and multi-execution environment. Therefore it is surprising that computational indistinguishability of independence from dependence between two or several random variables received no attention since the introduction of classic binary pseudorandom sequences. In this work we propose the use of the notion of computational independence (CI) in the analysis and design of provably secure cryptographic protocols. We generalize the classic result on equivalence of unpredictability and CI to general non-binary random variables. An application of this result is the use of unpredictability-based standard secure primitives in supporting the achievement of CI. This work is inherently related to Canetti’s universal composition framework [4], [5].

InfiniBand is widely accepted as a high performance networking technology for datacenters and HPC clusters. It uses the Remote Direct Memory Access (RDMA) where communication tasks that are typically assigned to CPUs are offloaded to the Channel Adapters (CAs), resulting in a significant increase of the throughput and reduction of the latency and CPU load. In this paper, we make an introduction to InfiniBand and IP over InfiniBand (IPoIB), where the latter is a protocol proposed by the IETF to run traditional socket-oriented applications on top of InfiniBand networks. We also evaluate the performance of InfiniBand using different transport protocols with several benchmarking tools in a testbed. For RDMA communications, we consider three transport services: (1) Reliable Connection, (2) Unreliable Connection, and (3) Unreliable Datagram. For UDP and TCP, we use IPoIB. Our results show significant differences between RDMA and IPoIB communications, encouraging the coding of new applications with InfiniBand verbs. Also, it is noticeable that IPoIB in datagram mode and in connected mode have similar performance for small UDP and TCP payload. However, the differences get important as the payload size increases.

Road obstacles cause serious accidents that have a severe impact on driver safety, traffic flow efficiency and damage of the vehicle. Detecting obstacles are important to prevent or to reduce such kind of the accidents and fatalities. However, it is difficult and becomes tricky because of some problems like presence of shadow, environmental changes or a sudden action of any moving things (e.g., car overtaking, animal coming) and many more. Thereby, this paper aims to design an obstacle detection technique based on (i) moving cameras and (ii) moving objects. These methods are applied to obstacle detection phase, in order to identify the different obstacles (e.g., potholes, animals, stop sign, obstacles, bumps, road cracks) by considering road dimensions. A new technique is introduced for detecting obstacles from moving camera and moving objects which overcomes several limitations over stationary cameras and moving/stationary objects. Further, paper reviews recent research trends to detect obstacles for moving cameras and moving objects with discussion of key points and limitations of each approach. Finally, the results show that the proposed method is more robust and reliable than the previous approaches based on the stationary cameras.

A statistical characterization of body surface to external communication of Body Area Network is investigated for movement of human body in different directions i.e. 00, 900, 1800 and 2700, with respect to the transmitting antenna. The NICT’s statistical model is used to carry out measurement in ultra-wideband (UWB) range. The important parameters that capture the variability of the delay profile over the channel e.g. mean delay spread and RMS delay spread of power delay profile (PDP) is presented. The probability density (PDF) and cumulative distribution (CDF) function of the output signal to noise ratio (SNR) have been computed. The performance of Selective Rake (S-Rake) and Partial rake (P-Rake) receiver structure that employs maximal-ratio combining (MRC) is investigated for varying number of fingers taps.

Fast-flux service networks (FFSN) helps the cyber-criminals to hide the servers used for malicious activities behind a wall of proxies (bots). It provides the reliability and detection evasion to a malicious server. FFSN use a large pool of IP addresses for proxies. Detection of FFSN is difficult as few benign technologies like Content distribution networks and round robin DNS have similar working characteristics. Many approaches have been proposed to detect FFSN and fast flux domains. However, due to dynamic behavior of FFSN, these techniques suffer from a significant number of false positives. In this paper, we present a Temporal and Real time detections based approach (TempR) to detect fast flux domains. The features of fast flux domains and benign domains have been collected and classified using intelligent classifiers. Our technique illustrates 96.99% detection accuracy with the recent behavior of fast flux domains.

Internet and Communication Technologies operates widely in a multi-server environment. Authentication is one of a primary concern in multi-server environment. There are so many remote user authentication schemes using smart cards that operate in multi-server environment. But there are some authentication bottlenecks that these schemes suffer from. We have analyzed some schemes on the grounds of some specific security requirements and goals. In this paper, we propose a scheme that integrates key exchange and session key agreement in one phase and also supports traceability feature and resists denial of service attack.

Social networking and growing popularity of cloud services have made everyone to communicate each other in an easiest way. File sharing and distribution are the frequently used services provided by cloud service providers, although these facilities reduce cost of data sharing but at the same time data security and access control is the major problem. Many renowned service providers have faced the challenges to secure data and provide better access control, and we know once the data is leaked we cannot recover the data loss. Thus in order to ensure better security we need for focus on the two major problems, and those are access control and encryption policy. Cipher text policy attribute based encryption is the most effective solution for access control in real time scenarios where owner can actually decide the access rights for the end-user, but it comes with key escrow problem. We are proposing our modified escrow-free key issuing protocol to solve the problem of key escrow and our Modified Attribute Based Encryption scheme to achieve all security requirements to get a robust and secure system. Further we evaluate our model on the basis of results and lastly we conclude the paper.

In this paper, we focused on of the most proliferated network that is Mobile Adhoc Network (MANET). Due to the dynamic nature and limited power of nodes, the routes will fail frequently which intern cause high power dissipation. This paper proposed a reliable and power efficient routing with the nodes having high power level. As well as, this approach also concentrated on the reduction of power consumption during route failures by adapting an on-demand local route recovery mechanism through a set of helping nodes and they are called as Support Nodes (SN). The cooperation of support nodes will reduce the power consumption and significantly increases the reliability. The performance of proposed approach was evaluated through average energy consumption, packet delivery ratio and end-to-end delay over varying node speed and varying packet size. The power optimization and reliability achieved by the proposed approach gives an ideal solution to the future communication in MANETs for a long time.