Identity-based Broadcast Encryption Scheme Research Articles

A multivariate identity-based broadcast encryption with applications to the internet of things

<p style='text-indent:20px;'>When Kevin Ashton proposed the catchword 'Internet of Things' in 1999, little did he know that technology will become an indispensable part of human lives in just two decades. In short, the Internet of Things (IoT), is a catch-all terminology used to describe devices connected to the internet. These devices can share and receive data as well as provide instructions over a network. By design itself, the IoT system requires multicasting data and information to a set of designated devices, securely. Taking everything into account, Broadcast Encryption (BE) seems to be the natural choice to address the problem. BE allows an originator to broadcast ciphertexts to a big group of receivers in a well-organized and competent way, while ensuring that only designated people can decrypt the data. In this work, we put forward the first Identity-Based Broadcast Encryption scheme based on multivariate polynomials that achieves post-quantum security. Multivariate public key cryptosystems (MPKC), touted as one of the most promising post-quantum cryptography candidates, forms the foundation on which our scheme relies upon, which allows it to be very cost-effective and faster when implemented. In addition, it also provides resistance to collusion attack, and as a consequence our scheme can be utilized to form an efficient and robust IoT system.</p>

Efficient Data Sharing With Privacy Preservation Over Lattices for Secure Cloud Storage

Data sharing is a basic data processing mechanism in the cloud storage. Data confidentiality and the receiver privacy are two important requirements of data-sharing systems. Because the data owner does not wish anyone who is not authorized to access the shared data and the authenticated data receiver also does not wish anyone else to know that he/she has accessed the shared data from the data owner. Broadcast encryption gives a possible solution to these requirements of data-sharing systems. This article constructs a data-sharing system over lattice by designing an efficient identity-based broadcast encryption (IBBE) scheme which achieves the data confidentiality and the identity privacy simultaneously. Besides the data owner, no one knows the identities of the authenticated data receivers in the proposed data-sharing system. Data confidentiality is achieved by the indistinguishability under the selective identity and the chosen ciphertext attacks (IND-sID-CCA) of the proposed IBBE scheme. It is proven in the random oracle model that the IND-sID-CCA security is based on the hardness of the learning with errors problem which can resist the quantum attacks. Inherited from the proposed IBBE scheme, the proposed data-sharing system also has several other characters which are suitable to the practical application. The most important feature is that all the public parameters size, private key size, and the ciphertext length are constant for any data receivers set in the proposed system. Hence, the proposed system adapts to the situation of large receiver group. Moreover, the proposed data-sharing system supports efficient member joining. When a new user asks to access the uploaded data, the existing receiver does not need to update his/her private key. The decryption cost of the existing receiver will remain unchanged when the outsourced data have been updated. Detailed performance analysis and a simulated experiment of the designed core algorithm are given by using Java program on a personal computer Intel Core i7-8700 K (3.7 GHz), 32 G RAM which verifies the design results in this article.

Efficient Identity-Based Broadcast Encryption Scheme on Lattices for the Internet of Things

In an identity-based broadcast encryption (IBBE) scheme, the ciphertext is usually appended with a set of user identities to specify intended recipients. However, as IBBE is adopted in extensive industries, the demand of anonymity for specific scenarios such as military applications is urgent and ought no more to be ignored. On the contrary, how to optimize computation and communication is an unavoidable challenge in the IBBE scheme construction, especially in the large-scaled resource-limited wireless networks such as the Internet of Things (IoT), where the cost of computation and communication should be mitigated as much as possible since other functions including connectivity and privacy should be given the top priority. Thus, we present an IBBE scheme from the lattice, in which we employ the Chinese remainder theorem and lattice basis delegation in fixed dimensions to obtain several desirable characteristics, such as constant-size public parameter, private key, and ciphertext. In addition, our encryption and decryption algorithms are more efficient than broadcast encryption (BE) schemes based on number-theoretic problems. To be noticed, our scheme can simultaneously achieve confidentiality and outsider anonymity against the chosen-plaintext attack under the hardness of the learning with error (LWE) problem.

Identity Based Broadcast Encryption Scheme with Shorter Decryption Keys for Open Networks

In Broadcast Encryption schemes, a sender can broadcast the encrypted message securely in a threatening network to a set of legitimate system users only. In IBE scheme any sender can encrypt the desired message using his/her identity without attaining the public key certificate. Here, we have presented an efficient ID-based broadcast encryption scheme (IBBE) for open networks. In this scheme, desired messages can be broadcasted to any subset of the users by any sender but only authorized receivers are capable in retrieving the encrypted messages. This scheme has shorter decryption keys in comparison with other primitive of IBBE scheme for open networks. Moreover, the proposed scheme intends to achieve the lower cost for computation as well as transmission in comparison to earlier existing IBBE schemes.

A compact construction for non-monotonic key-policy attributebased encryption

The attribute-based encryption (ABE) scheme with monotonic access structure cannot deal with an access structure that is associated with the negation of attributes, which is not convenient for real world applications. In this paper, we attempt to propose a more expressive non-monotonic ABE scheme through a new method. To achieve this goal, we firstly propose a linear two-mode identity-based broadcast encryption (TIBBE) scheme based on an identity-based broadcast encryption (IBBE) scheme. We introduce the concept of identity-based revocation (IBR) for this scheme without increasing the size of parameters in IBBE. The scheme is selective identity secure under the m-DBDHE assumption. Then, we convert the TIBBE scheme into a non-monotonic key-policy attribute-based encryption (KP-ABE) scheme with compact parameters. Our KP-ABE scheme could achieve constant-size ciphertexts, and the scale of the private keys grows linearly with the scale of the attribute set. Besides, the computational cost is the lowest compared with other existing non-monotonic KP-ABE schemes.

An Identity-Based (IDB) Broadcast Encryption Scheme with Personalized Messages (BEPM).

A broadcast encryption scheme with personalized messages (BEPM) is a scheme in which a broadcaster transmits not only encrypted broadcast messages to a subset of recipients but also encrypted personalized messages to each user individually. Several broadcast encryption (BE) schemes allow a broadcaster encrypts a message for a subset S of recipients with public keys and any user in S can decrypt the message with his/her private key. However, these BE schemes can not provide an efficient way to transmit encrypted personalized messages to each user individually. In this paper, we propose a broadcast encryption scheme with a transmission of personalized messages. Besides, the scheme is based on multilinear maps ensure constant ciphertext size and private key size of each user and the scheme can achieve statically security. More realistically, the scheme can be applied to the Conditional Access System (CAS) of pay television (pay-TV) efficiently and safely.

Identity-based proxy re-encryption version 2: Making mobile access easy in cloud

Proxy re-encryption (PRE) enables an authorized proxy to convert a ciphertext under Alice’s public key into a ciphertext under Bob’s public key without exposing the encrypted message. In existing PRE systems, the original ciphertexts and the re-encrypted ones are both required to be in the same cryptosystem, which limits their applications in cloud computing systems. In this paper, we propose a new proxy re-encryption pattern, referred to as an identity-based proxy re-encryption version 2 (IBPRE2). It allows an authorized proxy to convert a ciphertext of an identity-based broadcast encryption (IBBE) scheme into a ciphertext of an identity-based encryption (IBE) scheme. With IBPRE2, one can take advantage of IBBE to securely share data with a set of recipients, and then incorporate an additional one into the authorized set through the re-encryption mechanism, without decrypting the IBBE ciphertext nor leaking any sensitive information. We formalize the security requirements in IBPRE2 and propose a provably CCA-secure scheme. The unique feature of ciphertext transformation from a complicated cryptosystem to a simple one makes our IBPRE2 a versatile cryptographic tool to secure outsourced data in cloud computing.

Anonymous and provably secure certificateless multireceiver encryption without bilinear pairing

Recently, numerous multireceiver identity-based encryption or identity-based broadcast encryption schemes have been introduced with bilinear pairing and probabilistic map-to-point MTP function. As the bilinear pairing and MTP functions are expensive operations, any cryptographic schemes based on these operations experience high computational burden. The certificateless public key cryptography sidesteps the private key escrow problem occurring in identity-based cryptosystem and certificate management troubles of certificate authority-based public key cryptography CA-PKC. We observed that certificateless multireceiver encryption CL-MRE scheme without pairing and MTP hash function has not yet been considered in the literature. In this paper, we proposed a bilinear pairing and MTP hash-function-free CL-MRE scheme with chosen ciphertext attack resilience. The detailed analyses provide evidence that our scheme achieves forward secrecy, backward secrecy, and low computation costs than others. The scheme also provides confidentiality of the message and receiver anonymity in the random oracle model with the hardness of computational Diffie-Hellman problem. Copyright © 2014 John Wiley & Sons, Ltd.

Hierarchical identity-based broadcast encryption scheme from LWE

A hierarchical identity-based broadcast encryption (H-IBBE) scheme is an identity-based broadcast encryption (IBBE) scheme in a hierarchical environment. In order to obtain secure H-IBBE schemes in the quantum era, we propose an H-IBBE scheme based on the learning with errors problem assumption. Our scheme achieves indistinguishability from random under adaptive chosen-plaintext and chosen-identity attacks in the random oracle model.

Efficient Anonymous Identity-Based Broadcast Encryption without Random Oracles

Broadcast encryption provides a method of secure multi-receiver communications, where a broadcaster can encrypt a message for a set S of users who are listening to a broadcast channel. Most identity-based broadcast encryption (IBBE) schemes are not anonymous, which means the attacker can obtain the identities of all receivers from the ciphertext. In this paper, the authors propose an efficient anonymous IBBE scheme in bilinear groups of prime order, where any attacker cannot get the identities of the receivers from the ciphertext. The scheme has constant size ciphertext and achieves adaptive security based on the asymmetric decisional bilinear Diffie-Hellman Exponent (DBDHE) assumption without random oracles. The proposed scheme improves efficiency and security of anonymous IBBE schemes simultaneously.

Fully Secure Codes Based Tracing and Revoking Scheme with Constant Ciphertext

In broadcast encryption system certain users may leak their decryption keys to build pirate decoders, so traitor tracing is quite necessary. There exist many codes based traitor tracing schemes. As pointed out by Billet and Phan in ICITS 2008, these schemes lack revocation ability. The ability of revocation can disable identified malicious users and users who fail to fulfill the payments, so that the broadcast encryption system can be more practical. Recently, Zhao and Li presented a construction of codes based tracing and revoking scheme which achieves user revocation as well as traitor tracing. However, their scheme is only secure against chosen plaintext attacks under selective-adversary model with random oracle. In this paper, we obtain a new construction of codes based tracing and revoking scheme which is proved secure against chosen ciphertext attacks under adaptive-adversary model without random oracle. Our idea is to insert codeword into Boneh and Hamburgs identity based broadcast encryption scheme to retain the ability of user revocation and use Boneh and Naors method to trace traitors. Our fully secure scheme is roughly as efficient as Zhao and Lis scheme while the security is enhanced.

Identity-based broadcast encryption for multi-privileged groups using Chinese remainder theorem

Identity-based broadcast encryption is tool for communicating multiple copies of a single message to a selective group of users, identified by their identities in such a manner that others are unable to access the content. A multi-privileged group is a group of users where the users have different access privileges. This paper proposes an identity-based broadcast encryption scheme for multi-privileged groups that preserves the identities of the users which is developed using Chinese remainder theorem and bilinear pairing. It also ensures forward and backward secrecy with reference to user join and leave. Comparison of the proposed scheme with the existing schemes has shown that the proposed scheme is performing better. Security of the scheme is proven under random oracle model.

Identity based broadcast encryption scheme against selective opening attack

Recently Sun Jin,et al.proposed an dentity-based broadcast encryption scheme against selective opening attack,(SUN JIN,HU YU-PU.Identity-based broadcast encryption scheme against selective opening attack.Journal of Electronics and Information Technology,2011,33(12): 2929-2934) and it claimed that the scheme can fight against Selective-Opening Attack(SOA) and has constant-size key and ciphertext in the standard model without random tags.However,this paper proved that their proposal cannot work at all.Furthermore,the authors improved their scheme to be a correct one,and then proved its security in the standard model.

Server-aided identity-based anonymous broadcast encryption

A broadcast encryption scheme enables a broadcaster to send an encrypted message to the multiple privileged users. In identity-based broadcast encryption schemes, a broadcaster typically encrypts a message by combining public identities of receivers and system parameters, which therefore reveals identities of receivers to the public and raised a concern on user privacy. On the other hand, identity-based systems generally require pairing computations which are computationally costly. It would be desirable if pairing computations could be avoided in resource constrained devices. The aim of this paper is to provide the solutions to these problems by introducing a new concept called server-aided identity-based anonymous broadcast encryption. We formalise the notion of server-aided identity-based anonymous broadcast encryption and present a construction in the random oracle model based on pairings that achieve anonymity under adaptive corruptions in the chosen-plaintext setting. Comparing with other broadcast encryption schemes, our scheme requires less computation cost for encryption and decryption while preserving receiver's privacy.

Functional encryption for public-attribute inner products: Achieving constant-size ciphertexts with adaptive security or support for negation

In functional encryption (FE) schemes, ciphertexts and private keys are associated with attributes and decryption is possible whenever key and ciphertext attributes are suitably related. It is known that expressive realizations can be obtained from a simple functional encryption flavor called inner product encryption (IPE), where decryption is allowed whenever ciphertext and key attributes form orthogonal vectors. In this paper, we construct public-attribute inner product encryption (PAIPE) systems, where ciphertext attributes are public (in contrast to attribute-hiding IPE systems). Our PAIPE schemes feature constant-size ciphertexts for the zero and non-zero evaluations of inner products. These schemes respectively imply an adaptively secure identity-based broadcast encryption scheme and an identity-based revocation mechanism that both feature short ciphertexts and rely on simple assumptions in prime order groups. We also introduce the notion of negated spatial encryption, which subsumes non-zero-mode PAIPE and can be seen as the revocation analogue of the spatial encryption primitive of Boneh and Hamburg.

Attribute-based encryption schemes with constant-size ciphertexts

Attribute-based encryption (ABE), as introduced by Sahai and Waters, allows for fine-grained access control on encrypted data. In its key-policy flavor (the dual ciphertext-policy scenario proceeds the other way around), the primitive enables senders to encrypt messages under a set of attributes and private keys are associated with access structures that specify which ciphertexts the key holder will be allowed to decrypt. In most ABE systems, the ciphertext size grows linearly with the number of ciphertext attributes and the only known exception only supports restricted forms of access policies. This paper proposes the first attribute-based encryption (ABE) schemes allowing for truly expressive access structures and with constant ciphertext size. Our first result is a ciphertext-policy attribute-based encryption (CP-ABE) scheme with O(1)-size ciphertexts for threshold access policies and where private keys remain as short as in previous systems. As a second result, we show that a certain class of identity-based broadcast encryption schemes generically yields monotonic key-policy attribute-based encryption (KP-ABE) systems in the selective set model. Our final contribution is a KP-ABE realization supporting non-monotonic access structures (i.e., that may contain negated attributes) with short ciphertexts. As an intermediate step toward this result, we describe a new efficient identity-based revocation mechanism that, when combined with a particular instantiation of our general monotonic construction, gives rise to the most expressive KP-ABE realization with constant-size ciphertexts. The downside of our second and third constructions is that private keys have quadratic size in the number of attributes. On the other hand, they reduce the number of pairing evaluations to a constant, which appears to be a unique feature among expressive KP-ABE schemes.

Fully CCA2 secure identity-based broadcast encryption with black-box accountable authority

AbstractThe concept of accountable authority identity-based encryption was introduced as a convenient tool to reduce the amount of trust in authorities in identity-based encryption. In this model, if the Private Key Generator (PKG) maliciously re-distributes users’ decryption keys, it runs the risk of being caught and prosecuted. Libert and Vergnaud proposed an accountable authority identity-based broadcast encryption, which allows white-box tracing or weak black-box tracing. Their scheme was proved only secure in selective-ID model. We present a weak black-box accountable authority identity-based broadcast encryption scheme, which is proven as fully CCA2 secure against adaptive adversary with tight reduction. Our scheme achieves O(m) public keys size, O(m) private keys size, and O(1) ciphertext length, where m is the maximum number of receivers allowed in each broadcast.

Identity-based Broadcast Encryption Scheme Using the New Techniques for Dual System Encryption

考虑到广播加密模式在各种动态网络中广泛的应用前景以及现有的广播加密方案效率与安全性难以兼顾的事实，该文利用Waters双系统密码技术，结合混合阶群双线性运算的正交性，提出一个双系统密码技术下的身份型广播加密方案。该方案建立在标准模型下，具有短的尺寸固定的密文与密钥，同时无需使用任何哈希函数及随机标签，具有较高的计算效率与存储效率。该方案的安全性依赖于3个简单的静态假设，证明结果显示此方案达到了完全安全性的高安全要求级别。

Privacy-preserving identity-based broadcast encryption

Broadcast encryption enables a broadcaster to encrypt messages and transmit them to some subset S of authorized users. In identity-based broadcast encryption schemes, a broadcasting sender typically encrypts a message by combining public identities of receivers in S and system parameters. However, previous identity-based broadcast encryption schemes have not been concerned about preserving the privacy of receivers. Consequently, all of the identities of broadcast receivers in S are exposed to the public in the previous schemes, which may be subject to attacks on user privacy in lots of pragmatic applications. We propose a novel privacy-preserving identity-based broadcast encryption scheme against an active attacker. The proposed scheme protects the privacy of receivers of broadcasted messages by hiding the identities of receivers in S. Additionally, it achieves less storage and computation costs required to encrypt and decrypt the broadcast message, compared to the previous identity-based broadcast encryption schemes that do not provide user privacy.

Cryptanalysis of an identity based broadcast encryption scheme without random oracles

Identity based broadcast encryption allows a centralized transmitter to send encrypted messages to a set of identities S, so that only the users with identity in S can decrypt these ciphertexts using their respective private key. Recently [Information Processing Letters 109 (2009)], an identity-based broadcast encryption scheme was proposed (Ren and Gu, 2009) [1], and it was claimed to be fully chosen-ciphertext secure without random oracles. However, by giving a concrete attack, we indicate that this scheme is even not chosen-plaintext secure.