221 research outputs found
Data security and privacy in the Cloud
No full textAchieving data security and privacy in the cloud means ensuring confidentiality and integrity of data and computations, and protection from non authorized accesses. Satisfaction of such requirements
entails non trivial challenges, as relying on external servers, owners lose
control on their data. In this paper, we discuss the problems of guaranteeing proper data security and privacy in the cloud, and illustrate
possible solutions for them
SECRYPT 2011 : proceedings of the International conference on security and cryptography : Seville, Spain, 18-21 july, 2011
No full text
SECRYPT 2012 : proceedings of the International conference on security and cryptography : Rome, Italy, 24-27 july, 2012
No full textApplied cryptography and network security : 10th international conference, ACNS 2012 : Singapore, june 26-29, 2012 : proceedings
No full textTasks Scheduling with Load Balancing in Fog Computing: a Bi-level Multi-Objective Optimization Approach
No full textFog computing is characterized by its proximity to edge devices, allowing it to handle data near the source. This capability alleviates the computational burden on data centers and minimizes latency. Ensuring high throughput and reliability of services in Fog environments depends on the critical roles of load balancing of resources and task scheduling. A significant challenge in task scheduling is allocating tasks to optimal nodes. In this paper, we tackle the challenge posed by the dependency between optimally scheduled tasks and the optimal nodes for task scheduling and propose a novel bi-level multi-objective task scheduling approach. At the upper level, which pertains to task scheduling optimization, the objective functions include the minimization of makespan, cost, and energy. At the lower level, corresponding to load balancing optimization, the objective functions include the minimization of response time and maximization of resource utilization. Our approach is based on an Improved Multi-Objective Ant Colony algorithm (IMOACO). Simulation experiments using iFogSim confirm the performance of our approach and its advantage over existing algorithms, including heuristic and meta-heuristic approaches
NSS 2010 : proceedings of the fourth International conference on network and system security : 1-3 september 2010, Melbourne, Australia
No full text
An improved public-key tracing scheme with sublinear ciphertext size
No full textTo overcome the piracy problem in digital content distribution systems, a number of traitor tracing schemes have been suggested by researchers. The goal of these schemes is to enable the tracer to identify at least one of the traitors. In this context, Matsushita and Imai (2004) proposed a black-box tracing scheme with sublinear header size that is able to perform tracing of self-defensive pirate decoders. Kiayias and Pehlivanoglu (2009) proved that this scheme is vulnerable to an attack which allows an illicit decoder to recognize normal ciphertext to tracing ones and distinguish two consecutive tracing ciphertexts. For making the scheme no more susceptible to such attack, authors modified the encryption phase and assumed that traitors belong to the same user group. In this paper, we present a solution that has no traitors restrictions, repairing the scheme totally. In particular, we modified the tracing scheme proving that (a) a pirate decoder is not able to recognize normal ciphertext to tracing ones with sufficiently high probability, and (b) the statistical distance between two consecutive tracing operations is negligible under Decision Diffie Hellman assumption
- …
