Results 1  10
of
26
Provable possession and replication of data over cloud servers
"... Abstract. Cloud Computing (CC) is an emerging computing paradigm that can potentially offer a number of important advantages. One of the fundamental advantages of CC is payasyougo pricing model, where customers pay only according to their usage of the services. Currently, data generation is outpa ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
(Show Context)
Abstract. Cloud Computing (CC) is an emerging computing paradigm that can potentially offer a number of important advantages. One of the fundamental advantages of CC is payasyougo pricing model, where customers pay only according to their usage of the services. Currently, data generation is outpacing users ’ storage availability, thus there is an increasing need to outsource such huge amount of data. Outsourcing data to a remote Cloud Service Provider (CSP) is a growing trend for numerous customers and organizations alleviating the burden of local data storage and maintenance. Moreover, customers rely on the data replication provided by the CSP to guarantee the availability and durability of their data. Therefore, Cloud Service Providers (CSPs) provide storage infrastructure and web services interface that can be used to store and retrieve an unlimited amount of data with fees metered in GB/month. The mechanisms used for data replication vary according to the nature of the data; more copies are needed for critical data that cannot easily be reproduced. This critical data should be replicated on multiple servers across multiple data centers. On the other hand, noncritical, reproducible data are stored at reduced levels of redundancy. The pricing model is related to the replication strategy. Therefore, it is of crucial importance to customers to have a strong evidence that they actually get the service they pay for. Moreover, they need to verify that all their data copies are not being tampered with or partially deleted over time. Consequently, the problem of Provable Data Possession (PDP) has been considered in many research papers. Unfortunately, previous PDP schemes focus on a single copy of the data and provide no guarantee that the CSP stores multiple copies of customers ’ data. In this paper we address this challenging issue and propose Efficient MultiCopy Provable Data Possession (EMCPDP) protocols. We prove the security of our protocols against colluding servers. Through extensive performance analysis and experimental results, we demonstrate the efficiency of our protocols.
On Verifying Dynamic Multiple Data Copies over Cloud Servers
, 2011
"... Currently, many individuals and organizations outsource their data to remote cloud service providers (CSPs) seeking to reduce the maintenance cost and the burden of large local data storage. The CSP offers paid storage space on its infrastructure to store customers ’ data. Replicating data on multip ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Currently, many individuals and organizations outsource their data to remote cloud service providers (CSPs) seeking to reduce the maintenance cost and the burden of large local data storage. The CSP offers paid storage space on its infrastructure to store customers ’ data. Replicating data on multiple servers across multiple data centers achieves a higher level of scalability, availability, and durability. The more copies the CSP is asked to store, the more fees the customers are charged. Therefore, customers need to be strongly convinced that the CSP is storing all data copies that are agreed upon in the service contract, and the dataupdate requests issued by the customers have been correctly executed on all remotely stored copies. In this paper we propose two dynamic multicopy provable data possession schemes that achieve two main goals: i) they prevent the CSP from cheating and using less storage by maintaining fewer copies, and ii) they support dynamic behavior of data copies over cloud servers via operations such as block modification, insertion, deletion, and append. We prove the security of the proposed schemes against colluding servers. Through theoretical analysis and experimental results, we demonstrate the performance of these schemes. Additionally, we discuss how to identify corrupted copies by slightly modifying the proposed schemes.
What About Vulnerability to a Fault Attack of the Miller’s Algorithm During an Identity Based Protocol?
"... Abstract. We complete the study of [16] and [20] about the Miller’s algorithm. The Miller’s algorithm is a central step to compute the Weil, Tate and Ate pairings. The aim of this article is to analyse the weakness of the Miller’s algorithm when it undergoes a fault attack. We prove that the Miller’ ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. We complete the study of [16] and [20] about the Miller’s algorithm. The Miller’s algorithm is a central step to compute the Weil, Tate and Ate pairings. The aim of this article is to analyse the weakness of the Miller’s algorithm when it undergoes a fault attack. We prove that the Miller’s algorithm is vulnerable to a fault attack which is valid in all coordinate systems, through the resolution of a nonlinear system. We show that the final exponentiation is no longer a counter measure to this attack for the Tate and Ate pairings.
The DiffieHellman problem and generalization of Verheul’s theorem
, 2009
"... Bilinear pairings on elliptic curves have been of much interest in cryptography recently. Most of the protocols involving pairings rely on the hardness of the bilinear DiffieHellman problem. In contrast to the discrete log (or DiffieHellman) problem in a finite field, the difficulty of this proble ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Bilinear pairings on elliptic curves have been of much interest in cryptography recently. Most of the protocols involving pairings rely on the hardness of the bilinear DiffieHellman problem. In contrast to the discrete log (or DiffieHellman) problem in a finite field, the difficulty of this problem has not yet been much studied. In 2001, Verheul [66] proved that on a certain class of curves, the discrete log and DiffieHellman problems are unlikely to be provably equivalent to the same problems in a corresponding finite field unless both DiffieHellman problems are easy. In this paper we generalize Verheul’s theorem and discuss the implications on the security of pairing based systems. We also include a large table of distortion maps. 1
CHOOSING THE CORRECT ELLIPTIC CURVE IN THE CM METHOD
"... Abstract. We give an elementary way to distinguish between the twists of an ordinary elliptic curve E over Fp in order to identify the one with p+1−2U points, when p = U 2 + dV 2 with 2U, 2V ∈ Z and E is constructed using the CM method for finding elliptic curves with a prescribed number of points. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We give an elementary way to distinguish between the twists of an ordinary elliptic curve E over Fp in order to identify the one with p+1−2U points, when p = U 2 + dV 2 with 2U, 2V ∈ Z and E is constructed using the CM method for finding elliptic curves with a prescribed number of points. Our algorithms consist in most cases of reading off simple congruence conditions on U and V modulo 4. 1.
A security protocol for InformationCentric Networking in smart grids
"... The CDAX project aims at providing a secure overlay network, as an overlay over an IP network, that provides an informationcentric network (ICN) tailored to the needs and the capabilities of smart grids. This paper addresses how endtoend security can be enforced in informationcentric networks b ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
The CDAX project aims at providing a secure overlay network, as an overlay over an IP network, that provides an informationcentric network (ICN) tailored to the needs and the capabilities of smart grids. This paper addresses how endtoend security can be enforced in informationcentric networks by proposing a protocol based on the concept of identitybased encryption, a type of publickey cryptography.
OPQ: OTBased Private Querying in VANETs
 Transactions on Intelligent Transportation Systems
"... ©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other wo ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Factoring Polynomials for Constructing Pairingfriendly Elliptic Curves
, 2008
"... In this paper we present a new method to construct a polynomial u(x) ∈ Z[x] which will make Φk(u(x)) reducible. We construct a finite separable extension of Q(ζk), denoted as E. By primitive element theorem, there exists a primitive element θ ∈ E such that E = Q(θ). We represent the primitive kth r ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
In this paper we present a new method to construct a polynomial u(x) ∈ Z[x] which will make Φk(u(x)) reducible. We construct a finite separable extension of Q(ζk), denoted as E. By primitive element theorem, there exists a primitive element θ ∈ E such that E = Q(θ). We represent the primitive kth root of unity ζk by θ and get a polynomial u(x) ∈ Q[x] from the representation. The resulting u(x) will make Φk(u(x)) factorable. 1
Enabling Data Dynamic and Indirect Mutual Trust for Cloud Computing Storage Systems
"... Currently, the amount of sensitive data produced by many organizations is outpacing their storage ability. The management of such huge amount of data is quite expensive due to the requirements of high storage capacity and qualified personnel. StorageasaService (SaaS) offered by cloud service prov ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Currently, the amount of sensitive data produced by many organizations is outpacing their storage ability. The management of such huge amount of data is quite expensive due to the requirements of high storage capacity and qualified personnel. StorageasaService (SaaS) offered by cloud service providers (CSPs) is a paid facility that enables organizations to outsource their data to be stored on remote servers. Thus, SaaS reduces the maintenance cost and mitigates the burden of large local data storage at the organization’s end. A data owner pays for a desired level of security and must get some compensation in case of any misbehavior committed by the CSP. On the other hand, the CSP needs a protection from any false accusation that may be claimed by the owner to get illegal compensations. In this paper, we propose a cloudbased storage scheme that allows the data owner to benefit from the facilities offered by the CSP and enables indirect mutual trust between them. The proposed scheme has four important features: (i) it allows the owner to outsource sensitive data to a CSP, and perform full blocklevel dynamic operations on the outsourced data, i.e., block modification, insertion, deletion, and append, (ii) it ensures that authorized users (i.e., those who have the right to access the owner’s file) receive the latest version of the outsourced data, (iii) it enables indirect mutual trust between the owner and the CSP, and (iv) it allows the owner to grant or revoke access to the outsourced data. We discuss the security issues of the proposed scheme. Besides, we justify its performance through theoretical analysis and experimental evaluation of storage, communication, and computation overheads.
How to bootstrap security for adhoc network: Revisited
"... Abstract There are various networkenabled and embedded computers deployed around us. Although we can get enormous conveniences by connecting them together, it is difficult to securely associate them in an adhoc manner. The difficulties originate from authentication and key distribution problems a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract There are various networkenabled and embedded computers deployed around us. Although we can get enormous conveniences by connecting them together, it is difficult to securely associate them in an adhoc manner. The difficulties originate from authentication and key distribution problems among devices that are strangers to each other. In this paper, we review the existing ways of initiating secure communication for adhoc network devices, and propose another solution. Exploiting Pairingbased cryptography and the notion of locationlimited channel, the proposed solution bootstraps security conveniently and efficiently. Further, it supports ownership enforcement and keyescrow. 1