Ideal Lattice-Based Efficient Data Sharing Scheme for Cloud Storage

Lattice-based Attribute-based encryption is a well-known cryptographic mechanism that can resist quantum attacks and has the ability of fine-grained access control, and it has a wide range of application scenarios in current Internet of Thing (IoT) era. However, lack of efficiency and existing the problem of large ciphertext expansion rate are the main disadvantages impede the applications of this mechanism. Thus, we propose an efficient and practical ciphertext policy attribute-based encryption (CP-ABE) scheme from lattices in the paper. In this scheme, to make the secret key reusable, we adjust access tree and propose a basic access tree structure, which can be converted from disjunctive normal form, and combine it with a light post-quantum scheme of Kyber. In addition, the compression method and plaintext expansion method are introduced to optimize the scheme. Our CP-ABE scheme is secure against chosen plaintext attack under the hardness of module learning with errors problem. We implement our scheme and compare it with three recent related schemes in terms of security, function and communication cost. Experiments and comparisons show that our CP-ABE scheme has advantages in high encryption efficiency, small matrix dimension, small key sizes, and low ciphertext expansion rate, which has some merit in practice.

Attribute-based encryption schemes with constant-size ciphertexts

Pairing-based CP-ABE with constant-size ciphertexts and secret keys for cloud environment

A Review on Data Privacy using Attribute-Based Encryption

It is well known that the set of all ideals(2) of a ring forms a complete modular lattice with respect to set inclusion. The same is true of the set of all right ideals. Our purpose in this paper is to consider the consequences of imposing certain additional restrictions on these ideal lattices. In particular, we discuss the case in which one or both of these lattices is complemented, and the case in which one or both is distributive. In §1 two strictly latticetheoretic results are noted for the sake of their application to the complemented case. In §2 rings which have a complemented ideal lattice are considered. Such rings are characterized as discrete direct sums of simple rings. The structure space of primitive ideals of such rings is also discussed. In §3 corresponding results are obtained for rings whose lattice of right ideals is complemented. In particular, it is shown that a ring has a complemented right ideal lattice if and only if it is isomorphic with a discrete direct sum of quasi-simple rings. The socle [7](3) and the maximal regular ideal [5] are discussed in connection with such rings. The effect of an identity element is considered in §4. In §5 rings with distributive ideal lattices are considered and still another variant of regularity [20] is introduced. It is shown that a semi-simple ring with a distributive right ideal lattice is isomorphic with a subdirect sum of division rings. In the concluding section a type of ideal, introduced by L. Fuchs [9] in connection with commutative rings with distributive ideal lattice, and which we call strongly irreducible, is considered. Some properties of these ideals, analogous to corresponding ones for prime ideals [19], are developed. Finally, it is observed that a topology may be introduced in the set of all proper strongly irreducible ideals in such a way that the resulting space contains the spaces of prime [19] and primitive [13] ideals as subspaces. I wish to take this opportunity to thank Professor M. F. Smiley for the encouragement and many helpful suggestions he has given me throughout the preparation of this paper. 1. Some lattice-theoretic preliminaries. In this section we state two results of a strictly lattice-theoretic nature with a view toward subsequent applications to rings. Our notation and terminology is that of Birkhoff [3]. In

Attribute-based encryption (ABE) for cloud computing access control is reviewed in this article. A taxonomy and comprehensive assessment criteria of ABE are first proposed. In the taxonomy, ABE schemes are assorted into key-policy ABE (KP-ABE) schemes, ciphertext-policy ABE (CP-ABE) schemes, anti-quantum ABE schemes, and generic constructions. In accordance with cryptographically functional features, CP-ABE is further divided into nine subcategories with regard to basic functionality, revocation, accountability, policy hiding, policy updating, multi-authority, hierarchy, offline computation, and outsourced computation. In addition, a systematical methodology for discussing and comparing existing ABE schemes is proposed. For KP-ABE and each type of CP-ABE, the corresponding access control scenario is presented and explained by concrete examples. Specifically, the syntax of ABE is given followed by the adversarial model and security goals. ABE schemes are discussed according to the design strategies and special features and are compared in the light of the proposed assessment criteria with respect to security and performance. Compared to related state-of-the-art survey papers, this article not only provides a broader 12 categories of ABE schemes, but also makes a more comprehensive and holistic comparison. Finally, a number of open research challenges in ABE are pointed out.

Nowadays, many organizations are adopting cloud computing for storing the large amount of organization’s important and private data. Here, it becomes important to mange appropriate access rights to these data as it is stored outside the organization’s boundary and is handled by the third party service providers. The Ciphertext Policy Attribute-based Encryption (CPABE) scheme is the most widely utilized technique that offers encrypted access control. In the existing implementations of CPABE scheme, one of the significant issues that need to be addressed is an efficient revocation mechanism. In this paper a direct and immediate user revocation approach for CPABE scheme is presented. The proposed method offers direct user revocation by maintaining the revocation list and to keep revocation list smaller the validity time is embedded in the user’s secret key. The revoked users are still able to access the previously generated ciphertexts. Hence, ciphertext update process is incorporated and a separate immediate revocation list is maintained so that the revoked users’ access is restricted. Also, in the proposed system the revocation information is embedded in ciphertext as a separate part so the update process of ciphertext is more efficient.KeywordsAttributesRevocationABECPABERevocation listValidity periodCloudAccess structure

The cloud is the most suitable platform for storing and processing of data. Users are outsourcing data to the cloud to reduce the storage and maintenance cost locally. However, there are challenges to both cloud users as well as to the cloud service provider. The challenge for cloud service providers is to optimize the associated cost for the management and maintenance of uploaded data. The challenge for users is data privacy. To address these issues, encrypted data deduplication schemes proposed, but existing schemes suffer from security weakness and do not support data access control. In this paper, we propose an efficient ciphertext policy attribute-based encryption scheme for deduplication over encrypted data (ECP-ABE) in the cloud storage. Our scheme achieves privacy,deduplication along with access controls. The security and performance analysis demonstrates that our scheme is secure and efficient.

As the demand for data sharing and complex access-control policies continues to grow, traditional encryption mechanisms, which are generally established using a Public Key Infrastructure, face the problem of massive processing overheads and huge network bandwidth consumption. Attribute-Based Encryption (ABE) schemes have been proposed as a potential means of addressing these issues and have attracted great attention in recent years. Most previous studies on ABE focus on issues such as the revocation mechanism, multi-authority, the access structure design, and traceability. However, very few studies consider the storage efficiency problem and the present study proposes a novel data deduplication scheme based on ciphertext-policy ABE with convergent encryption and block-level data. The scheme can be deployed in third-party semi-trusted environments, and not only provides flexible, fine-grained access control over encrypted data, but also allows for the in-line elimination of redundancies in order to save cloud storage space. The experimental results show that the proposed scheme has an acceptable computational overhead and provides a promising solution for real-world data cloud storage and access scenarios.

We characterize those commutative rings [Formula: see text] whose ideal lattice [Formula: see text] endowed with the annihilation operation is an ortholattice. Moreover, we provide an analogous characterization for the annihilator lattice [Formula: see text] endowed with the annihilation operation. Since the ideal lattice of [Formula: see text] is modular, [Formula: see text] is already an orthomodular lattice provided it is an ortholattice. However, there exist also commutative rings whose ideal lattices are complemented but the complementation differs from annihilation. We present an example of such a ring and develop a procedure producing infinitely many rings with this property. Finally, we provide a sufficient condition for double annihilation to be a homomorphism from [Formula: see text] onto [Formula: see text].

Well-rounded twists of ideal lattices from real quadratic fields

In a ciphertext-policy attribute-based encryption (CP-ABE) scheme, a user may have multiple attributes, and each attribute may be shared simultaneously by many users. The decryption key of an attribute can thus be shared by many users who all possess the attribute. For monetary gain, a malicious authorized user may reveal his/her decryption key to a third party, and it is difficult to trace the owner of primitive secret key from an exposed key. At the same time, this situation may also limit commercial applications of CP-ABE systems. To solve these problems and enable fine-grained access control for the encrypted data, we propose a traceable CP-ABE scheme with attribute-level user revocation for cloud storage (TUR-CPABE). Our scheme enjoys four advantages. First, it has the ability to trace malicious users who have leaked key information from the system. Second, it supports attribute-level user revocation for malicious users and allows ABE fine-grained access control. Third, it allows secret key updates and ciphertext updates to resist collusion attacks between users. Fourth, outsourcing encryption, decryption and attribute revocation are used to reduce the computational burden on data owners, data users and the trust authority, respectively. In addition, our scheme has been proven to be secure against chosen plaintext attacks under a selective access policy based on decisional q – BDHE assumption in the standard model.

In recent years, cloud storage technology has been widely used in many fields such as education, business, medical and more because of its convenience and low cost. With the widespread applications of cloud storage technology, data access control methods become more and more important in cloud-based network. The ciphertext policy attribute-based encryption (CP-ABE) scheme is very suitable for access control of data in cloud storage. However, in many practical scenarios, all attributes of a user cannot be managed by one authority, so many multi-authority CP-ABE schemes have emerged. Moreover, cloud servers are usually semi-trusted, which may leak user information. Aiming at the above problems, we propose a fine-grained access control scheme with versatility for cloud storage based on multi-authority CP-ABE, named vFAC. The proposed vFAC has the features of large universe, no key escrow problem, online/offline mechanism, hidden policy, verifiability and user revocation. Finally, we demonstrate vFAC is static security under the random oracle model. Through the comparison of several existing schemes in terms of features, computational overhead and storage cost, we can draw a conclusion that vFAC is more comprehensive and scalable.

Distributed key generation (DKG) is widely used in multi-party computation and decentralized applications. DKG has two phases, namely sharing and reconstruction. Most of the prior DKG protocols need at least 2 rounds for the sharing phase, in case some party raises a dispute. The existing 1-round DKG protocol [Fouque <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> , PKC’01], built based on a publicly verifiable secret sharing (PVSS) scheme, assumes a static adversary model and its reconstruction phase requires <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$O(n^{2})$ </tex-math></inline-formula> communication complexity. Motivated by the observation that a ciphertext-policy attribute-based encryption (CP-ABE) scheme hides secret sharing (SS) in ciphertext, we utilize decentralized CP-ABE to achieve the first adaptively secure 1-round DKG protocol. Firstly, a CP-ABE scheme enables the ciphertexts in DKG to be externally decrypted, making our protocol superior to the PVSS-based DKG protocol in reconstruction. The communication and computation complexities are both lowered to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$O(n)$ </tex-math></inline-formula> thanks to the constant-sized decryption key and the proposed batch decryption. The use of CP-ABE also makes our DKG protocol storage-friendly, i.e., the parties store no ciphertext after the sharing phase. Secondly, we add non-interactive zero-knowledge (NIZK) proofs to make the CP-ABE ciphertext publicly verifiable by leveraging the sigma protocol and the Fiat-Shamir heuristic. Thirdly, we demonstrate our protocol’s feasibility by presenting a proof-of-concept implementation over Ethereum, which is used as a public channel and a trustworthy computation platform. The implementation is a non-trivial task due to Ethereum’s incompatibility with the bilinear mapping group.

The information-centric Internet of things (IC-IoT) is different from the traditional Internet of things (IoT) in that the device-to-device pattern is generalized to a device-to-network pattern. Furthermore, in an IC-IoT environment, there is a demand for protecting the security of all data generated from IC-IoT devices. A cryptography scheme named attribute-based encryption (ABE) represents a smart method of providing the fine-grained access control that can sufficiently protect data security. The most attractive advantage of ABE is its expressive access policy, which makes the access control of data flexible and manageable. However, there is a serious problem caused by such an access policy; it incurs a greater ciphertext redundancy and computational overhead. This implies that the current ABE scheme is hard to implement in the thin client devices of IC-IoT. In this paper, we propose a universalized policy-compacting method via sharing public parts of the policy. Compared with the original policy, the compacted policy applies a more compact ciphertext and requires less computation, communication, and storage cost. However, the policy-compacting problem is proved to be a non-deterministic polynomial complete (NPC) problem. Thus, a greedy algorithm is provided to obtain an approximate minimum compacted policy scale. Finally, we propose a compact ciphertext-policy attribute-based encryption (CCP-ABE) scheme with the policy-compacting method. A security proof and performance evaluation show that the proposed CCP-ABE scheme provides a comprehensive performance improvement.