Search

In general, the Internet of Things (IoT) is used for many applications and plays an essential role in the digital communications of smart city applications. However, securing the sensor-based IoT communication is difficult because it is highly vulnerable to malicious actions like Denial of Service (DOS), ransomware, and node impersonation. In the past several works were presented like Diffie–Hellman, supersingular isogeny, Merkle hash tree, etc., to secure the IoT communication. But, those techniques failed to identify the malicious events, which happened unexpectedly. Also, these procedures were limited to predict malicious events as the harmful attacks look like normal users. Hence, to enhance the privacy measure in IoT communication, a novel post-quantum cryptography (PQC) algorithm is introduced in this research. Here, powerful IoT devices concern with smart devices such as smartphones, smart security systems, and smartwatches. Furthermore, this paper has introduced a novel Diffie Supersingular Multiplication (DSM) for securing communication in powerful IoT devices. The developed approaches were validated by launching the Mirai botnet attack in the transmission channel. Moreover, the proposed DSM model has been implemented using the Xilinx ISE14.5 tool, which has improved 30% frequency, 24% area, 10% confidential rate and also has reduced the power up to 15%, error 10% and 20% delay, which are quite better than other compared techniques.

Over the past decade, we have witnessed the Internet becoming increasingly centralized in the hands of a small number of giant technology firms, that control many of the most popular applications and the content they host on their platforms. In addition, in the majority of instances today, access to the Internet is usually provided through local internet service providers (ISPs) in each country. Governments in different jurisdictions can exert pressure on these technology firms and ISPs to enforce restrictions on Internet usage by their citizens, such as the blocking access to certain sites and/or content. In this paper, we present a promising new approach to circumventing some of these issues. Our decentralized web (DWeb) proposal makes use of a mesh network to connect community based routers. In addition, objects on the DWeb are indexed using Bblockchain technology, which allows for secure storage of immutable object references, and integrity checking of the data being served to users. Our DWeb design is also capable of operating during network partitions, and is able to quickly re-synchronize with the larger network once connectivity has been restored., 7 pages

Bitcoin was launched in 2009, becoming the world’s first ever decentralized digital currency. It uses a publicly distributed ledger called the blockchain to record the transaction history of the network. The Bitcoin network is structured as a decentralized peer-to-peer network, where there are no central or supernodes, and all peers are seen as equal. Nodes in the network do not have a complete view of the entire network and are only aware of the nodes that they are directly connected to. In order to propagate information across the network, Bitcoin implements a gossip-based flooding protocol. However, the current flooding protocol is inefficient and wasteful, producing a number of redundant and duplicated messages. In this paper, we present an alternative approach to the current flooding protocol implemented by Bitcoin. We propose a novel protocol that changes the current flooding protocol to a probabilistic flooding approach. Our approach allows nodes to maintain certain probabilities of sending information to their neighbours, based on previous message exchanges between the nodes. Our experimental evaluation shows a reduction in the number of duplicated messages received by each node in the network and the total number of messages exchanged in the network, whilst ensuring that the reliability and resilience of the system were not negatively affected.

The widespread adoption of fax machines in the 1980s revolutionised everyday communications. It was quickly adopted as the standard form of communication across the globe. Since then, the internet has replaced fax as a truly global form of instant communication. However, the fax machine still reigns as the primary form of communication in a number of industries, healthcare being one of them. This paper presents a system that uses a blockchain and an off-chain centralised data storage to give patients and medical professionals instant access to their medical records from anywhere. By assigning each medical record a pseudo anonymous identifier, a second layer "blockchain" for each user can be created allowing for the rapid collection and querying of data. The off-chain pseudo anonymous data storage allows for the data to remain unencrypted enabling the rapid generation of anonymous medical datasets which can be used for machine learning and data mining on the data, potentially bringing many benefits to the healthcare industry.

The SSL protocol has been widely used for verifying digital identities and to secure Internet traffic since the early days of the web. Although X.509 certificates have been in existence for more than two decades, individual user uptake has been low due to the high cost of issuance and maintenance of such certs. This has led to a situation whereby users are able to verify the identity of an organization or e-commerce retailer via their digital certificate, but organizations have to rely on weak username and password combinations to verify the identity of customers registered with their service. We propose the X509Cloud framework which enables organizations to issue certificates to their users at zero cost, and allows them to securely store and disseminate client certificates using the Bitcoin inspired blockchain protocol. This in turn will enable organizations and individuals to authenticate and to securely communicate with other users on the Internet.

This paper presents the implementation and validation of PI2 Active Queue Management (AQM) algorithm in ns-3. PI2 provides an alternate design and implementation to Proportional Integral controller Enhanced (PIE) algorithm without affecting the performance benefits it provides in tackling the problem of bufferbloat. Bufferbloat is a situation arising due to the presence of large unmanaged buffers in the network. It results in increased latency and therefore, degrades the performance of delay-sensitive traffic. PIE algorithm tries to minimize the queuing delay by auto-tuning its control parameters. However, with PI2, this auto-tuning is replaced by just squaring the packet drop probability. In this paper, we implement a model for PI2 in ns-3 and verify its correctness by comparing the results obtained from it to those obtained from the PIE model in ns-3. The results indicate that PI2 offers a simple design and achieves similar or at times better responsiveness and stability than PIE.

PUBLISHED, The Mobile IP protocol has evolved from providing mobility support for portable computers to support for wireless handheld devices with high mobility patterns. A new category of micromobility protocols has been proposed to deal with the increased signaling loads that will be generated with large populations of such devices on a network. We argue that the authentication schemes presently employed in these networks do not scale well for large numbers of nodes, and that the lack of accounting procedures prevents the mass deployment of these networks. We envisage that future access networks will he operated by independent service providers, who will charge users for access to services in the fixed network but may not have long-term contractual relationships with them. These access networks may also employ a variety of micromobility protocols for fast handover support. We present a scheme based on hash chains, which allows for fast authentication of datagrams for secure updating of router entries within the access network, and real-time accounting of network usage by mobile nodes. Such a system will alleviate problems of fraud in mobile networks and eliminate the need for interoperator billing agreements.

Identity Based Encryption (IBE) has been constructed from bilinear pairings, lattices and quadratic residuosity. The latter is an attractive basis for an IBE owing to the fact that it is a well-understood hard problem from number theory. Cocks constructed the first such scheme, and subsequent improvements have been made to achieve anonymity and improve space efficiency. However, the anonymous variants of Cocks’ scheme thus far are all less efficient than the original. In this paper, we present a new universally-anonymous IBE scheme based on the quadratic residuosity problem. Our scheme has better performance than the universally anonymous scheme from Ateniese and Gasti (CT-RSA 2009) at the expense of more ciphertext expansion.

We present a flexible approach for achieving user-controlled privacy and integrity of documents that are collaboratively authored within web-based document-editing applications. In this setting, the goal is to provide security without modifying the web application's client-side or server-side components. Instead, communication between both components is transparently intercepted and processed (if necessary) by means of a local proxy or browser plugin. We improve upon existing solutions by securely preserving real-time collaboration for encrypted documents and facilitating self-containment of the metadata (an overhead of encryption) within the same document. An architectural generalization is also presented that permits generic transformations and fine-grained access control. Security is assessed with respect to several threat models, and performance is evaluated alongside other approaches.

PUBLISHED, A mobile ad hoc network is a collection of nodes that are connected through a wireless medium and form rapidly changing topologies. The widely accepted existing routing protocols designed to accommodate the needs of such self-organised networks do not address possible threats aimed at the disruption of the protocol itself. The assumption of a trusted environment is not one that can be realistically expected; hence several efforts have been made towards the design of a secure routing protocol for ad hoc networks. The main problems with this approach are that it requires changes to the underlying routing protocol and that manual configuration of the initial security associations cannot be completely avoided. We propose RIDAN, a novel architecture that uses knowledge-based intrusion detection techniques to detect, in real-time, attacks that an adversary can perform against the routing fabric of a mobile ad hoc network. Our system is designed to take countermeasures minimising the effectiveness of an attack and maintaining the performance of the network within acceptable limits. RIDAN does not introduce any changes to the underlying routing protocol since it operates as an intermediate component between the network traffic and the utilised protocol with minimum processing overhead. We have developed a prototype that was evaluated in AODV-enabled networks using the ns-2 network simulator.

The past few years have witnessed an explosive growth in the use of wireless mobile handheld devices as the enabling technology for accessing Internet-based services, as well as for personal communication needs in ad hoc networking environments. Most studies indicate that it is impossible to utilize strong cryptographic functions for implementing security protocols on handheld devices. Our work refutes this. Specifically, we present a performance analysis focused on three of the most commonly used security protocols for networking applications, namely SSL, S/MIME and IPsec. Our results show that the time taken to perform cryptographic functions is small enough not to significantly impact real-time mobile transactions and that there is no obstacle to the use of quite sophisticated cryptographic protocols on handheld mobile devices.

We have presented the design for an EDI auditing and control workbench which can combine the use of workflow as a tool to control intra-enterprise documentation together with EDI as the means by which trade documents can be transferred between organisations. The security architecture outlined protects a company from the normal risks associated with electronic trading as well as providing some means of control over the ‘signing power’ allocated to employees of the enterprise. Keys issued to individuals are coupled with a control vector specifying the conditions under which the key can be used. By extending the control vector scheme with support from appropriate secure hardware modules, it is possible to allow an individual who ordinarily can only authorise a document at a given level to collaborate with employees at the same level to enhance this signing power to that of a higher level. This reflects existing practices within organisations when paper-based trading is in force.