The Experts below are selected from a list of 285 Experts worldwide ranked by ideXlab platform
Jianying Zhou - One of the best experts on this subject based on the ideXlab platform.
-
weak leakage resilient client side deduplication of encrypted data in cloud storage
Computer and Communications Security, 2013Co-Authors: Ee-chien Chang, Jianying ZhouAbstract:Recently, Halevi et al. (CCS '11) proposed a cryptographic primitive called proofs of ownership (PoW) to enhance security of client-side deduplication in cloud storage. In a proof of ownership scheme, any owner of the same File F can prove to the cloud storage that he/she owns File F in a robust and efficient way, in the bounded leakage setting where a certain amount of efficiently-extractable information about File F is leaked. Following this work, we propose a secure client-side deduplication scheme, with the following advantages: our scheme protects data confidentiality (and some partial information) against both outside adversaries and honest-but-curious cloud storage server, while Halevi et al. trusts cloud storage server in data confidentiality; our scheme is proved secure w.r.t. any distribution with sufficient min-entropy, while Halevi et al. (the last and the most practical construction) is particular to a specific type of distribution (a generalization of "block-fixing" distribution) of input Files. The cost of our improvements is that we adopt a weaker leakage setting: We allow a bounded amount one-time leakage of a Target File before our scheme starts to execute, while Halevi et al. allows a bounded amount multi-time leakage of the Target File before and after their scheme starts to execute. To the best of our knowledge, previous works on client-side deduplication prior Halevi et al. do not consider any leakage setting.
-
AsiaCCS - Weak leakage-resilient client-side deduplication of encrypted data in cloud storage
Proceedings of the 8th ACM SIGSAC symposium on Information computer and communications security - ASIA CCS '13, 2013Co-Authors: Ee-chien Chang, Jianying ZhouAbstract:Recently, Halevi et al. (CCS '11) proposed a cryptographic primitive called proofs of ownership (PoW) to enhance security of client-side deduplication in cloud storage. In a proof of ownership scheme, any owner of the same File F can prove to the cloud storage that he/she owns File F in a robust and efficient way, in the bounded leakage setting where a certain amount of efficiently-extractable information about File F is leaked. Following this work, we propose a secure client-side deduplication scheme, with the following advantages: our scheme protects data confidentiality (and some partial information) against both outside adversaries and honest-but-curious cloud storage server, while Halevi et al. trusts cloud storage server in data confidentiality; our scheme is proved secure w.r.t. any distribution with sufficient min-entropy, while Halevi et al. (the last and the most practical construction) is particular to a specific type of distribution (a generalization of "block-fixing" distribution) of input Files. The cost of our improvements is that we adopt a weaker leakage setting: We allow a bounded amount one-time leakage of a Target File before our scheme starts to execute, while Halevi et al. allows a bounded amount multi-time leakage of the Target File before and after their scheme starts to execute. To the best of our knowledge, previous works on client-side deduplication prior Halevi et al. do not consider any leakage setting.
Ee-chien Chang - One of the best experts on this subject based on the ideXlab platform.
-
weak leakage resilient client side deduplication of encrypted data in cloud storage
Computer and Communications Security, 2013Co-Authors: Ee-chien Chang, Jianying ZhouAbstract:Recently, Halevi et al. (CCS '11) proposed a cryptographic primitive called proofs of ownership (PoW) to enhance security of client-side deduplication in cloud storage. In a proof of ownership scheme, any owner of the same File F can prove to the cloud storage that he/she owns File F in a robust and efficient way, in the bounded leakage setting where a certain amount of efficiently-extractable information about File F is leaked. Following this work, we propose a secure client-side deduplication scheme, with the following advantages: our scheme protects data confidentiality (and some partial information) against both outside adversaries and honest-but-curious cloud storage server, while Halevi et al. trusts cloud storage server in data confidentiality; our scheme is proved secure w.r.t. any distribution with sufficient min-entropy, while Halevi et al. (the last and the most practical construction) is particular to a specific type of distribution (a generalization of "block-fixing" distribution) of input Files. The cost of our improvements is that we adopt a weaker leakage setting: We allow a bounded amount one-time leakage of a Target File before our scheme starts to execute, while Halevi et al. allows a bounded amount multi-time leakage of the Target File before and after their scheme starts to execute. To the best of our knowledge, previous works on client-side deduplication prior Halevi et al. do not consider any leakage setting.
-
AsiaCCS - Weak leakage-resilient client-side deduplication of encrypted data in cloud storage
Proceedings of the 8th ACM SIGSAC symposium on Information computer and communications security - ASIA CCS '13, 2013Co-Authors: Ee-chien Chang, Jianying ZhouAbstract:Recently, Halevi et al. (CCS '11) proposed a cryptographic primitive called proofs of ownership (PoW) to enhance security of client-side deduplication in cloud storage. In a proof of ownership scheme, any owner of the same File F can prove to the cloud storage that he/she owns File F in a robust and efficient way, in the bounded leakage setting where a certain amount of efficiently-extractable information about File F is leaked. Following this work, we propose a secure client-side deduplication scheme, with the following advantages: our scheme protects data confidentiality (and some partial information) against both outside adversaries and honest-but-curious cloud storage server, while Halevi et al. trusts cloud storage server in data confidentiality; our scheme is proved secure w.r.t. any distribution with sufficient min-entropy, while Halevi et al. (the last and the most practical construction) is particular to a specific type of distribution (a generalization of "block-fixing" distribution) of input Files. The cost of our improvements is that we adopt a weaker leakage setting: We allow a bounded amount one-time leakage of a Target File before our scheme starts to execute, while Halevi et al. allows a bounded amount multi-time leakage of the Target File before and after their scheme starts to execute. To the best of our knowledge, previous works on client-side deduplication prior Halevi et al. do not consider any leakage setting.
Makoto Takizawa - One of the best experts on this subject based on the ideXlab platform.
-
CISIS - A Superpeer-Based Two-Layer P2P Overlay Network with the CBF Strategy
First International Conference on Complex Intelligent and Software Intensive Systems (CISIS'07), 2007Co-Authors: K. Watanabe, Naohiro Hayashibara, Makoto TakizawaAbstract:Peer-to-peer (P2P) systems are now getting popular and are widely used in various types of applications. In this paper, we newly propose a superpeer-based two-layer P2P overlay network with the charge-based flooding (CBF) algorithm, a look-up protocol for distributed multimedia objects. The layers of normal peer and superpeer are composed of a set of normal peers and a set of superpeers, respectively. Multiple normal peers with some common properties, e.g. Files, are interconnected with a superpeer. A collection of a superpeer and normal peers is referred to as a cluster. In a cluster, a normal peer tries to find a Target peer without being helped by a superpeer. If the Target File is not detected in the cluster, the normal peer asks the superpeer to find the Target File on behalf of the normal peer. Then, the superpeer forwards the request to other superpeers by using the CBF algorithm at the superpeer layer
-
ICDCS Workshops - Performance Analysis of the Superpeer-based Two-layer P2P Overlay Network with the CBF Strategy
27th International Conference on Distributed Computing Systems Workshops (ICDCSW'07), 2007Co-Authors: K. Watanabe, Naohiro Hayashibara, Makoto TakizawaAbstract:Peer-to-peer (P2P) systems are widely used in various types of applications. In this paper, we evaluate the superpeer-based two-layer (SBTL) P2P overlay network with the charge-based flooding (CBF) algorithm to detect Target peers which have Target Files, proposed as our previous work. The SBTL P2P overlay network is composed of two layers, normal peer and superpeer layers which include normal peers and superpeers, respectively. Multiple normal peers with some common properties, e.g. peers which have replicas of a File, are interconnected with a superpeer. A collection of a superpeer and normal peers is referred to as a cluster. In a cluster, a normal peer tries to find a Target peer which has a Target File by itself without help of its superpeer. If no Target peer is detected in the cluster, the normal peer asks the superpeer to find the Target peer. Then, the superpeer forwards the request message to other superpeers by using a type of flooding algorithm named the CBF algorithm at the superpeer layer. We evaluate the SBTL P2P model in terms of the number of messages exchanged among peers and communication load compared with other models.
Merouane Debbah - One of the best experts on this subject based on the ideXlab platform.
-
ISWCS - Cache-enabled small cell networks: Modeling and tradeoffs
EURASIP journal on wireless communications and networking, 2015Co-Authors: Ejder Bastug, Mehdi Bennis, Merouane DebbahAbstract:We consider the problem of caching in next generation mobile cellular networks where small base stations (SBSs) are able to store their users' content and serve them accordingly. The SBSs are stochastically distributed over the plane and serve their users either from the local cache or internet via limited backhaul, depending on the availability of requested content. We model and characterize the outage probability and average content delivery rate as a function of the signal-to-interference-ratio (SINR), base station intensity, Target File bitrate, storage size and File popularity. Our results provide key insights into the problem of cache-enabled small cell networks.
-
Cache-enabled small cell networks: modeling and tradeoffs
EURASIP Journal on Wireless Communications and Networking, 2015Co-Authors: Ejder Baştuǧ, Marios Kountouris, Mehdi Bennis, Merouane DebbahAbstract:We consider a network model where small base stations (SBSs) have caching capabilities as a means to alleviate the backhaul load and satisfy users' demand. The SBSs are stochastically distributed over the plane according to a Poisson point process (PPP), and serve their users either (i) by bringing the content from the Internet through a finite rate backhaul or (ii) by serving them from the local caches. We derive closed-form expressions for the outage probability and the average delivery rate as a function of the signal-to-interference-plus-noise ratio (SINR), SBS density, Target File bitrate, storage size, File length and File popularity. We then analyze the impact of key operating parameters on the system performance. It is shown that a certain outage probability can be achieved either by increasing the number of base stations or the total storage size. Our results and analysis provide key insights into the deployment of cache-enabled small cell networks (SCNs), which are seen as a promising solution for future heterogeneous cellular networks.
-
Cache-enabled small cell networks: Modeling and tradeoffs
2014 11th International Symposium on Wireless Communications Systems (ISWCS), 2014Co-Authors: Ejder Bastug, Mehdi Bennis, Merouane DebbahAbstract:We consider the problem of caching in next generation mobile cellular networks where small base stations (SBSs) are able to store their users' content and serve them accordingly. The SBSs are stochastically distributed over the plane and serve their users either from the local cache or internet via limited backhaul, depending on the availability of requested content. We model and characterize the outage probability and average content delivery rate as a function of the signal-to-interference-ratio (SINR), base station intensity, Target File bitrate, storage size and File popularity. Our results provide key insights into the problem of cache-enabled small cell networks.
Koki Yoshida - One of the best experts on this subject based on the ideXlab platform.
-
ARES - Evaluation of a Sector-Hash Based Rapid File Detection Method for Monitoring Infrastructure-as-a-Service Cloud Platforms
2015 10th International Conference on Availability Reliability and Security, 2015Co-Authors: Manabu Hirano, Hayate Takase, Koki YoshidaAbstract:Current computer forensics tools have some limitations on anti-forensics attacks, cloud computing, and a large increase in the size of forensics Targets. To solve these problems, this paper proposes a system that preserves storage data on virtual machines by acquiring all data sectors with time stamps. The proposed system can restore a previous state of a block device at any date and time that is specified by an investigator. The proposed system aims to monitor users' behavior in Infrastructure-as-a-Service (IaaS) cloud platforms. This paper also presents a rapid File detection system that finds a Target File from a large collection of the acquired data sectors by using sector-hashes and parallel distributed processing. This system enables investigators to track and to find a Target File that is related to incidents or crimes in the cloud. First, this paper reports the preliminary experiments of a sector-hash based File detection method on three major operating systems for evaluating its effectiveness. We present a design and an implementation of the proposed monitoring and Target File detection system by using Xen hypervisor and MapReduce. We report results of its performance evaluation. Finally, we discuss possible methods to improve the performance and the limitations of the current proposed mechanism.
