Attribute-Based Data Transfer with Filtering Scheme in Cloud Computing

Abstract

Attribute-based data transfer with filtering scheme in cloud computing Attribute-based data transfer with filtering scheme in cloud computing Abstract Abstract Data transfer is a transmission of data over a point-to-point or point-to-multipoint communication channel. To protect the confidentiality of the transferred data, public-key cryptography has been introduced in data transfer schemes (DTSs). Data transfer is a transmission of data over a point-to-point or point-to-multipoint communication channel. To protect the confidentiality of the transferred data, public-key cryptography has been introduced in data transfer schemes (DTSs). Unfortunately, there exist some drawbacks in the current DTSs. First, the sender must know who the real receivers are. This is undesirable in a system where the number of the users is very large, such as cloud computing. In practice, the sender only knows some descriptive attributes of the receivers. Secondly, the receiver cannot be guaranteed to only receive messages from the legal senders. Therefore, it remains an elusive and challenging research problem on how to design a DTS scheme where the sender can send messages to the unknown receivers and the receiver can filter out false messages according to the described attributes. In this paper, we propose an attribute-based data transfer with filtering (ABDTF) scheme to address these problems. In our proposed scheme, the receiver can publish an access structure so that only the users whose attributes satisfy this access structure can send messages to him. Furthermore, the sender can encrypt a message under a set of attributes such that only the users who hold these attributes can obtain the message. In particular, we provide an efficient filtering algorithm for the receiver to resist the denial-of-service attacks. Notably, we propose the formal definition and security models for ABDTF schemes. To the best of our knowledge, it is the first time that a provable ABDTF scheme is proposed. Hence, this work provides a new research approach to ABDTF schemes. must know who are the real receivers. This is undesirable in a system where the number of the users is very large, such as cloud computing. In practice, the sender only knows some descriptive attributes of the receivers. Second, the receiver cannot be guaranteed to only receive messages from the legal senders. Therefore, it remains an elusive and challenging research problem on how to design a DTS scheme where the sender can send messages to the unknown receivers and the receiver can filter out false messages according to the described attributes. In this paper, we propose an attribute-based data transfer with filtering (ABDTF) scheme to address these problems. In our proposed scheme, the receiver can publish an access structure so that only the users whose attributes satisfy this access structure can send messages to him. Furthermore, the sender can encrypt a message under a set of attributes such that only the users who hold these attributes can obtain the message. In particular, we pr...

New provable data transfer from provable data possession and deletion for secure cloud storage

“…Given that N is difficult to factor, the value of its Euler function f(N) = (p À 1)(q À 1) is also difficult to compute. Equation (14) will be replaced with equation (15)…”

“…According to equation (15), it is difficult for the adversary to compute B 1 . Although the value of N is public, f(N) is difficult to be computed.…”

“…A secure transfer mechanism is needed urgently in this field. A brief description of the provable data transfer (PDT) protocol 15,16 is as follows: the user sends a data transfer query to a cloud server, the cloud server executes the transfer query, and then, sends transferred data to the targeted cloud server. The targeted cloud server verifies the integrity of transferred data.…”

ABKS‐CSC: attribute‐based keyword search with constant‐size ciphertexts

“…Later, Goyal et al classified ABE schemes into two types: key‐policy ABE (KP‐ABE) and ciphertext‐policy ABE (CP‐ABE). In KP‐ABE schemes , secret keys are associated with access structures, while the ciphertext is labeled with sets of attributes. On the reverse, in CP‐ABE schemes , secret keys are labeled with sets of attributes, while ciphertexts are associated with access structures.Attribute‐based encryption has attracted lots of attentions as it can express flexible access structures.…”

“…On the reverse, in CP‐ABE schemes , secret keys are labeled with sets of attributes, while ciphertexts are associated with access structures.Attribute‐based encryption has attracted lots of attentions as it can express flexible access structures. However, the computation cost and communication cost in previous ABE schemes are linear with the number of required attributes . Hence, previous schemes cannot be used in the device with limited store space and computation power.…”