oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Scalable and Secure Aggregation in Distributed Networks  [PDF]
Sebastien Gambs,Rachid Guerraoui,Hamza Harkous,Florian Huc,Anne-Marie Kermarrec
Computer Science , 2011,
Abstract: We consider the problem of computing an aggregation function in a \emph{secure} and \emph{scalable} way. Whereas previous distributed solutions with similar security guarantees have a communication cost of $O(n^3)$, we present a distributed protocol that requires only a communication complexity of $O(n\log^3 n)$, which we prove is near-optimal. Our protocol ensures perfect security against a computationally-bounded adversary, tolerates $(1/2-\epsilon)n$ malicious nodes for any constant $1/2 > \epsilon > 0$ (not depending on $n$), and outputs the exact value of the aggregated function with high probability.
Hierarchical Wireless Mesh Networks Scalable Secure Framework
ganesh reddy karri,P. Santi Thilagam
International Journal of Information and Network Security (IJINS) , 2012, DOI: 10.11591/ijins.v2i2.1494
Abstract: Wireless Mesh Networks (WMNs) are more scalable than any other wireless networks, because of its unique features such as interoperability, integration and heterogeneous device support. Lacks of robust existing services in WMNs all the features are more vulnerable to various types of attacks. Hence, protect the scalability of WMNs against adversary nodes is a major issue. In this paper, we design Scalable Secure Framework (SSF) to address the scalability issue in WMNs. SSF is designed two algorithms: router authentication and deauthentication on backbone mesh to protect against unauthorized access and colluding attackers. SSF also secures integration and interoperability features of WMN by enhancing security features in 802.11s and Wi-Fi. Eventually security analysis results show that SSF effectively protects against imprinting, replay attack and node deprivation attacks..
Secure Personal Content Networking over Untrusted Devices  [PDF]
Uichin Lee,Joshua Joy,Youngtae Noh
Computer Science , 2015, DOI: 10.1007/s11277-014-2093-4
Abstract: Securely sharing and managing personal content is a challenging task in multi-device environments. In this paper, we design and implement a new platform called Personal Content Networking (PCN). Our work is inspired by Content-Centric Networking (CCN) because we aim to enable access to personal content using its name instead of its location. The unique challenge of PCN is to support secure file operations such as replication, updates, and access control over distributed untrusted devices. The primary contribution of this work is the design and implementation of a secure content management platform that supports secure updates, replications, and fine-grained content-centric access control of files. Furthermore, we demonstrate its feasibility through a prototype implementation on the CCNx skeleton.
Tree Based Scalable Secure Group Communication  [PDF]
M. Rameeya
Bonfring International Journal of Research in Communication Engineering , 2011, DOI: 10.9756/bijrce.1001
Abstract: In order to establish a group communication, a common key must be available with all the members of the group. The group key can be used for encrypting data between the group members or restricting access to the resources intended for group members only. Each member in a group has a unique key referred as member key, used for decrypting data in a group. The group key is distributed by group key server, which changes the group key time to time called as group rekeying. It is mandatory that the group key changes after a new user has joined and an existing user departed periodically. The existing system analyse the Bursty behaviour and operation. Burstiness is an important behavior in Secure Group Communication (SGC). Performing bursty operation, which may accumulate the simultaneous leave and join as a single operation, thus reduces the frequency of key distribution and reduces time complexity. But in the existing system the aggregate operation will occur only in rare condition so it may not perform the key reduction in all cases as well as it perform less scalability and security. To achieve better scalability, security and key reduction a new group key management protocol based on the Chinese Remainder Theorem and a hierarchical tree is proposed, in which each node contains a key and a modulus. The Keys and modulus are constructed as a tree and maintained by the key server. The key server shares the keys with each member on the path from its leaf to the root. The keys on its path from the leaf to the root need to be updated in the protocol, when a member joins or leaves the group but all modulus must be kept fixed. To update the keys on the tree, the key server generates a new key for each update node and encrypts it with its children keys on its path from the leaf to the root. Thus the new scalable protocol increases the security, scalability issues when the group size goes up to millions of members and reduces the key.
Scalable Trust-Based Secure WSNs  [PDF]
Amar Agrawal, Ruizhong Wei
Journal of Computer and Communications (JCC) , 2014, DOI: 10.4236/jcc.2014.27003
Abstract:

In this paper, we consider the scalable of wireless sensor networks with trust-based security. In our setting, the nodes have limited capability so that heavy computations are not suitable. So public key cryptographic algorithms are not allowed. We focus on the scalability of the network and proposed new testing algorithms and evaluation algorithms to test new nodes added, which give them reasonable values of trust. Based on these algorithms, we proposed new components for trust management system of wireless sensor networks.

Fast Energy-Efficient Secure Dynamic Address Routing For Scalable WSNs
G. Ravi,M. Mohamed Surputheen,R. Srinivasan
International Journal of Computer Science Issues , 2012,
Abstract: Secure Routing is one of the important issues in wireless sensor networks. A number of approaches have been proposed for secure routing in wireless sensor networks, but there is a lack of sufficient support for quick secure routing in large-scale sensor networks. We consider the dynamic address routing for wireless sensor networks. We consider two security algorithms namely RSA (Rivest, Shamir Adleman), Elliptic Curve Cryptography (ECC) as an initial test for dynamic address routing protocol for wireless sensor networks. We consider five routing attacks such as Directory attack, Brutal attack, Wormhole attack, Sinkhole attack and Sybil attack against dynamic address routing in wireless sensor networks. In this paper, we propose a common key cryptographic security algorithm named Random Number Addressing Cryptography (RAC) for providing energy efficient secure dynamic address routing protocol for scalable wireless sensor networks. RAC security algorithm works energy-efficiently and provides better security than RSA and ECC.
Attribute Based Encryption for Scalable and Secure Sharing of Medical Records in Cloud Computing Design and Implementation
BHARTI RATAN MADNANI, SREEDEVI N
International Journal of Innovative Research in Computer and Communication Engineering , 2013,
Abstract: :Cloud Computing servers provides promising platform for storage of data. Sharing of personal medical records is an emerging patient centric model of health information exchange, which is often outsourced to store at third party, such as cloud providers. The confidentiality of the medical records is major problem when patients use commercial cloud servers to store their medical records because it can be view by everyone, to assure the patients control over access to their own medical records; it is a promising method to encrypt the files before outsourcing and access control should be enforced though cryptography instead of role based access control. There are various other issues such as risks of privacy exposure, scalability in key management, flexible access and efficient user revocation, have remained the most important challenges toward achieving fine-grained, cryptographically enforced data access control. To achieve fine grained and scalable data access control for medical records stored in semi trusted servers, we leverage attribute based encryption (ABE) techniques to encrypt each patient s medical record file. In this paper, we describe a new approach which enables secure storage and controlled sharing of patient s health data. We explore key-policy attribute based encryption and multi-authority attribute based encryption to enforce patient access control policy such that everyone can download the data ,but only authorize user can view the medical records. This project also supports multiple owner scenarios and divides the users in the system into multiple security domains that greatly reduce the key management complexity for owners and users. A high degree of patient privacy is guaranteed by exploiting multi-authority ABE. In this paper we presents the detail design of modules and implementation Packages of the proposed framework.
New Proposed Robust, Scalable and Secure Network Cloud Computing Storage Architecture  [PDF]
Fawaz S. Al-Anzi, Ayed A. Salman, Noby K. Jacob
Journal of Software Engineering and Applications (JSEA) , 2014, DOI: 10.4236/jsea.2014.75031
Abstract:

Cloud computing describes highly scalable computing resources provided as an external service via the internet. Economically, the main feature of cloud computing is that customers only use what they need, and only pay for what they actually use. Resources are available to be accessed from the cloud at any time, and from any location via the internet. There’s no need to worry about how things are being maintained behind the scenes—you simply purchase the IT service you require. This new, web-based generation of computing utilizes remote servers for data storage and management. One of the challenging issues tackled in the cloud computing is the security of data stored in the service providers’ site. In this paper, we propose a new architecture for secure data storage in such a way that users’ data are encrypted and split into various cipher blocks and distributed among different service providers site rather than solely depend on single provider for data storage. This architecture ensures better reliability, availability, scalability and security.

An Energy-Efficient and Scalable Secure Data Aggregation for Wireless Sensor Networks  [PDF]
Taochun Wang,Xiaolin Qin,Liang Liu
International Journal of Distributed Sensor Networks , 2013, DOI: 10.1155/2013/843485
Abstract: Due to the characteristics of resource-constrained and battery-powered sensors in wireless sensor networks (WSNs), energy consumption is always a major concern. Data aggregation is an essential technique to reduce the communication overhead and energy consumption. Since many applications require data privacy, we need to take security into consideration. In this paper, we propose an energy-efficient, secure, highly accurate, and scalable scheme for data aggregation (EESSDA). The main idea of EESSDA is that secure data aggregation is achieved by establishing secure channel and slicing technology. The EESSDA scheme does not need encryption and decryption operations during the data aggregation, which saves energy and obtain high accuracy of aggregation results. Meanwhile, in EESSDA scheme, the advanced deployment of shared information between nodes is not required, making the networks with good scalability. Our analysis and simulations show that EESSDA is of lower communication overhead, more efficiency and accuracy, and better privacy preservation and scalability than existing schemes. 1. Introduction Wireless sensor networks (WSNs) are composed of a large number of sensor nodes to cooperatively monitor physical or environmental conditions, such as temperature, humidity, or noise, at different locations. WSNs have become increasingly popular in many military and civilian applications [1–3], for example, in the military field, identifying and locating targets for potential attacks through WSNs and in civilian field, tracking a patient's blood pressure, blood sugar, heart rate, and so forth. via wearable sensors to monitor the patient's health. Sensor nodes are usually constrained in energy, communication, storage, and computation capability, especially the ones powered by batteries which cannot be replaced optionally. Therefore, it is requisite for WSNs to save energy and increase network lifetime. In [4], a node consumes approximately the same amount of energy to compute 800 instructions as it does in sending a single bit of data. Hence, reducing the amount of traffic is a crucial way to save energy. WSNs usually generate large amounts of raw data in which there exists high redundancy. So, it is important to develop efficient data processing technique to reduce redundant data and the amount of transmission. Data aggregation [5–10] is an efficient method to eliminate data redundancy and save energy. However, data are transmitted by multihop and wireless in WSNs, which makes the transmission of data be captured and eavesdropped easily by a malicious
FendOff encryption software to secure personal information on computers and mobile devices  [PDF]
Victor Solovyev,Ramzan Umarov
Computer Science , 2015,
Abstract: The paper describes several original cryptographic cipher modules (VSEM) that are based on using one time pseudorandom pad and pseudorandom transpositions. The VSEM includes 4 modules of encryption that can be applied in combinations. We studied ability of these modules to secure the private data against attacks and their speed of encryption. The VSEM encryption was implemented in Fendoff applications for mobile devices on iOS and Android platforms as well as in computer application running Window or Mac OS. We describe these applications designed to encrypt/decrypt various personal data such as passwords, credit card or bank information as well as to secure content of any text or image files.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.