Cloud is an emerging computing *** has drawn extensive attention from both academia and *** its security issues have been considered as a critical obstacle in its rapid *** data owners store their data as plaintext in...
详细信息
Cloud is an emerging computing *** has drawn extensive attention from both academia and *** its security issues have been considered as a critical obstacle in its rapid *** data owners store their data as plaintext in cloud,they lose the security of their cloud data due to the arbitrary accessibility,specially accessed by the un-trusted *** order to protect the confidentiality of data owners’cloud data,a promising idea is to encrypt data by data owners before storing them in ***,the straightforward employment of the traditional encryption algorithms can not solve the problem well,since it is hard for data owners to manage their private keys,if they want to securely share their cloud data with others in a fine-grained *** this paper,we propose a fine-grained and heterogeneous proxy re-encryption(FHPRE)system to protect the confidentiality of data owners’cloud *** applying the FH-PRE system in cloud,data owners’cloud data can be securely stored in cloud and shared in a fine-grained ***,the heterogeneity support makes our FH-PRE system more efficient than the previous ***,it provides the secure data sharing between two heterogeneous cloud systems,which are equipped with different cryptographic primitives.
It has been recognized that cellular network interfaces are not energy efficient because of tail energy after each transmission. Although many research efforts have been made to reduce tail energy, they ignore the dyn...
详细信息
It has been recognized that cellular network interfaces are not energy efficient because of tail energy after each transmission. Although many research efforts have been made to reduce tail energy, they ignore the dynamic of link quality caused by user mobility or network congestion, which would lead to limited improvement without quality-of-experience guarantee. In this paper, we study to minimize energy consumption of the cellular network interface with a sequence of download/upload requests. Given accurate estimation of achievable link rate, we design a dynamic-programming (DP) based algorithm to obtain the optimal solution. Without the knowledge of dynamic link quality and future requests, an online algorithm is proposed to approximate the optimal solution. Finally, we conduct extensive simulations using real traces to evaluate the performance of our proposals, and the results show that 29% energy can be saved by using our algorithm under typical network settings.
Running MapReduce in a shared cluster has become a recent trend to process large-scale data analytical applications while improving the cluster utilization. However, the network sharing among various applications can ...
详细信息
Silicosis remains one of the most harmful occupational respiratory diseases. It threatens the workers exposed to dust environment. Chest radiograph is the main available image source for silicosis diagnosis according ...
详细信息
Hadoop/MapReduce has emerged as a de facto programming framework to explore cloud-computing *** has many configuration parameters,some of which are crucial to the performance of MapReduce *** practice,these parameters...
详细信息
ISBN:
(纸本)9783319271392
Hadoop/MapReduce has emerged as a de facto programming framework to explore cloud-computing *** has many configuration parameters,some of which are crucial to the performance of MapReduce *** practice,these parameters are usually set to default or inappropriate values.
Dependability analysis is an important step in designing and analyzing safety computer systems and protection *** multi-processor and virtual machine increases the system faults' complexity,diversity and dynamic,i...
详细信息
Dependability analysis is an important step in designing and analyzing safety computer systems and protection *** multi-processor and virtual machine increases the system faults' complexity,diversity and dynamic,in particular for software-induced failures,with an impact on the overall ***,it is very different for safety system to operate successfully at any active phase,since there is a huge difference in failure rate between hardware-induced and softwareinduced *** handle these difficulties and achieve accurate dependability evaluation,consistently reflecting the construct it measures,a new formalism derived from dynamic fault graphs(DFG) is developed in this *** exploits the concept of system event as fault state sequences to represent dynamic behaviors,which allows us to execute probabilistic measures at each timestamp when change *** approach automatically combines the reliability analysis with the system *** this paper,we describe how to use the proposed methodology drives to the overall system dependability analysis through the phases of modeling,structural discovery and probability analysis,which is also discussed using an example of a virtual computing system.
Cloud computing suffers from a number of problems in terms of security *** and integrity play an important role in the security field and numerous concerns have been raised to recognizeor protect any tampering with ex...
详细信息
Cloud computing suffers from a number of problems in terms of security *** and integrity play an important role in the security field and numerous concerns have been raised to recognizeor protect any tampering with exchanges of text between two entities(sender and receiver)within the cloud *** schemes in this area can be vulnerable to well known methods of attack such as replay attack,forgery attack,dictionary,insider,and modification attacks.A robust scheme is therefore required to detect or prevent any modification or manipulation of a message during *** this paper,we propose a new message authentication code(MAC)based on feature extraction of the user's iris in order to assure the integrity of the user's *** are extracted from the user's iris to generate a message code for each user's login and to prohibit malicious attacks such as replay,forgery and insider *** proposed scheme enjoysseveral important security attributes such as a user's one time bio-key,robust message anonymity,data integrity for a user's message,phase key agreement,bio-key management,and one time message code for each user's ***,our security analysis and experimental results demonstrate and prove the invulnerability and efficiency of our proposed scheme.
Cloud computing aids users to outsource their data in the cloud remotely to prevent them from burdens of local storage and maintenance. Users no longer have possession and control of these data. This property brings m...
详细信息
Cloud computing aids users to outsource their data in the cloud remotely to prevent them from burdens of local storage and maintenance. Users no longer have possession and control of these data. This property brings many new security challenges like unauthorised entities and correctness of stored data. In this paper, we focus on the problem of ensuring the integrity of data stored in the cloud. We propose a method which combines biometric and cryptography techniques in a cost-effective manner for data owners to gain trust in the cloud. We present efficient and secure integrity based on the XOR operation and iris feature extraction as the strong factors. This work gives the cloud user more confidence in detecting any block that has been changed. Additionally, our proposed scheme employs user's iris features to secure and integrate data in a manner difficult for any internal or external entity to take or compromise it. Extensive security and performance analysis show that our scheme is highly efficient and provably secure.
MapReduce is a popular programming model and an associated implementation for parallel processing big data in the distributed environment. Since large scaled MapReduce data centers usually provide services to many use...
详细信息
ISBN:
(纸本)9781479966226
MapReduce is a popular programming model and an associated implementation for parallel processing big data in the distributed environment. Since large scaled MapReduce data centers usually provide services to many users, it is an essential problem to preserve the privacy between different applications in the same network. In this paper, we propose SDPMN, a framework that using software defined network (SDN) to distinguish the network between each application, which is a manageable and scalable method. We design this framework based on the existing SDN structure and Hardtop networks. Since the rule space of each SDN device is limited, we also propose the rule placement optimization for this framework to maximize the hardware supported isolated application networks. We state this problem in a general MapReduce network and design a heuristic algorithm to find the solution. From the simulation based evaluation, with our algorithm, the given network can support more privacy preserving application networks with SDN switches.
Deterministic multithreading (DMT) system is well-known to eliminate the harmful program behaviors caused by nondeterminism, i.e., always proceeding the program execution into the same thread schedule for the same giv...
详细信息
Deterministic multithreading (DMT) system is well-known to eliminate the harmful program behaviors caused by nondeterminism, i.e., always proceeding the program execution into the same thread schedule for the same given input. To achieve this goal, two kinds of schedules are enforced by existing DMT systems. 1) A mem-based schedule ensures the determinism with the total order of the shared memory accesses, and 2) A sync-based schedule makes it by only enforcing the total order of the synchronization operations. Mem-schedule achieves full determinism but suffers from prohibitive overhead; while sync-schedule mitigates this overhead but cannot ensure the determinism for the race schedules, i.e., part determinism. Much recent research is devoted to the hybrid schedule combining the determinism of mem-schedule and efficiency of sync-schedule. However, they suffer from the practicability and scalability problems due to the defects of their technical characteristics, such as trace collection in advance and huge schedule memoization. To address the above problem, this paper proposes esDMT, an efficient and scalable DMT system using a new technique of memory isolation. It can improve the efficiency by proceeding the execution of each thread in parallel within its private virtual memory, and defers the determinism guarantee by updating private memory into shared memory in a deterministic order according to deterministic lock algorithm, thus further reducing the overhead of inter-thread waiting. In contrast to the previous hybrid work avoiding the nondeterminism of race schedules offline based on the enormous historical records, our key insight is to eliminate the nondeterminism of race schedules online at runtime. Our experimental results on PARSEC benchmarks show that esDMT eliminates the nondeterminism successfully, almost gains the same performance as the sync-schedule (with
暂无评论