Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Information Forensics and Security

Adaptively Secure Identity-Based Broadcast Encryption With a Constant-Sized Ciphertext

Jongkil Kim, Willy Susilo, Man Ho Au, Jennifer Seberry

Published Jan 1, 2015• 72 citations
Publisher

Abstract

In this paper, we present an adaptively secure identity-based broadcast encryption system featuring constant sized ciphertext in the standard model. The size of the public key and the private keys of our system are both linear in the maximum number of receivers. In addition, our system is fully collusion-resistant and has stateless receivers. Compared with the state-of-the-art, our scheme is well optimized for the broadcast encryption. The computational complexity of decryption of our scheme depends only on the number of receivers, not the maximum number of receivers of the system. Technically, we employ dual system encryption technique and our proposal offers adaptive security under the general subgroup decisional assumption. Our scheme demonstrates that the adaptive security of the schemes utilizing a composite order group can be proven under the general subgroup decisional assumption, while many existing systems working in a composite order group are secure under multiple subgroup decision assumptions. We note that this finding is of an independent interest, which may be useful in other scenarios.

DOI
10.1109/tifs.2014.2388156

Related papers

Cryptanalysis and improvement of identity-based broadcast encryption scheme

Wang Xu-ana

Identity-based broadcast encryption scheme using new techniques for dual system encryption,claimed the scheme could achieve full security and constant-size key and ciphertext in the standard model without tags.However,this paper showed that the proposal was not secure.Furthermore,this paper improved the scheme to be a secure one and proved its security in the standard model by using dual system encryption.

Jisuanji yingyong yanjiu•Jan 1, 2013•0 citations

Quantum-safe identity-based broadcast encryption with provable security from multivariate cryptography

Ramprasad Sarkar, Mriganka Mandal, Sourav Mukhopadhyay

Identity-Based Broadcast Encryption ($\textsf{IBBE}$) is a novel concept that can efficiently and securely transmit confidential content to a group of authorized users without the traditional Public-Key Infrastructure ($\textsf{PKI}$). After carefully exploring these areas, we have observed that none of the existing works have adopted the quantum-attack resistant cryptographic machinery Multivariate Public-Key Cryptography ($\textsf{MPKC}$) with provable security. We are the first to design a quantum-safe $\textsf{IBBE}$ that solely relies on the $\textsf{MPKC}$ framework. Our proposed protocol has achieved $ \mathcal{O}(n) $-size communication bandwidth and $ {n^3}\cdot\mathcal{O}\big(\max\big\{N, {\delta}^4\big\}\big) $-size overhead storage without any security breach. Here, $ n $ is the number of variables for each multivariate polynomial, $ N $ represents the total number of system users, and $ \delta $ denotes a positive fixed-length. More positively, our design has achieved the adaptive INDistinguishable Chosen-Ciphertext Attack ($\textsf{IND-CCA}$) security in the Random Oracle Model ($\textsf{ROM}$) under the hardness of standard Multivariate Quadratic ($\textsf{MQ}$) problem. We emphasize that our system can also be immune against collusion attacks where several users come together to create an illicit decryption box.

Advances in Mathematics of Communications•Apr 16, 2022•4 citations

Forward-secure identity-based encryption with direct chosen-ciphertext security in the standard model

Yang Lu, Jiguo Li

The paradigm of forward security provides a promising approach to deal with the key exposure problem as it can effectively minimize the damage caused by the key exposure. In this paper, we develop a new forward-secure identity-based encryption scheme without random oracles. We formally prove that the proposed scheme is secure against adaptive chosen-ciphertext attacks in the standard model. In the proposed scheme, the running time of the private key extraction and decryption algorithms and the sizes of the user's initial private key and the ciphertext are independent on the total number of time periods, and any other performance parameter has at most log-squared complexity in terms of the total number of time periods. Compared with the previous forward-secure identity-based encryption schemes, the proposed scheme enjoys obvious advantage in the overall performance. To the best of our knowledge, it is the first forward-secure identity-based encryption scheme that achieves direct chosen-ciphertext security in the standard model.

Advances in Mathematics of Communications•Jan 1, 2017•6 citations

Adaptively-Secure, Non-Interactive Public-Key Encryption.

Ran Canetti, Shai Halevi, Jonathan I. Katz

Abstract. Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret data of alreadycorrupted parties. Ideally, an adaptively-secure encryption scheme should, like standard public-key encryption, allow arbitrarily-many parties to use a single encryption key to securely encrypt arbitrarily-many messages to a given receiver who maintains only a single short decryption key. However, it is known that these requirements are impossible to achieve: no non-interactive encryption scheme that supports encryption of an unbounded number of messages and uses a single, unchanging decryption key can be adaptively secure. Impossibility holds even if secure data erasure is possible. We show that this limitation can be overcome by updating the decryption key over time and making some mild assumptions about the frequency of communication between parties. Using this approach, we construct adaptively-secure, completely non-interactive encryption schemes supporting secure encryption of arbitrarily-many messages from arbitrarilymany senders. Our schemes additionally provide forward security and security against chosen-ciphertext attacks. 1

•Jan 1, 2004•1 citation

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

Vikas Srivastava, Sumit Kumar Debnath, Pantelimon Stănică +1 more

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.

Advances in Mathematics of Communications•Nov 10, 2021•12 citations

ENHANCED ARBITRARY TOPOLOGY GENERALIZATION AND IDENTITY-BASED BROADCAST ENCRYPTION SCHEME

Rasi Raj R, Joy Winnie Wise D.C

- Broadcast encryption helps a sender to securely distribute messages to a dynamically changing set of users over an uncertainty channel. The broadcast encryption scheme needs a trusted party to distribute decoded keys. Group key agreement (GKA) protocols set up a group of members to negotiate a common encryption key via open networks so that only the group members can decrypt the texts and the contributory broadcast encryption (Con BE) can enable the sender to send message to particular member of the group but, it do not offer a fully trusted third-party to set up the system and Existing GKA protocols does not handle sender/member changes effectively. We proposed Arbitrary Topology Generalization and Identity-based Broadcast Encryption (ATIBE) scheme. The scheme holds a Private Key Generator (PKG). The PKG generates private keys from users’ identities by using a master secret key (MSK). The PKG also strengthen the public broadcast encryption key and distributes information of decryption keys to users. This scheme allows avoiding the neighbors’ communication problems, efficient encryption/decryption and only one round is requires setting up the public group. In addition to this proxy re-encryption scheme is used to improve the security level. This proposed scheme establishes secure Broadcast channels and provides a secure numerous emerging distributed computation applications.

International Journal for Research in Science Engineering & Technology•Oct 30, 2018•0 citations
In this paper, we present an adaptively secure identity-based broadcast encryption system featuring constant sized ciphertext in the standard model. The size of the public key and the private keys of our system are both linear in the maximum number of receivers. In addition, our system is fully collusion-resistant and has stateless receivers. Compared with the state-of-the-art, our scheme is well optimized for the broadcast encryption. The computational complexity of decryption of our scheme depends only on the number of receivers, not the maximum number of receivers of the system. Technically, we employ dual system encryption technique and our proposal offers adaptive security under the general subgroup decisional assumption. Our scheme demonstrates that the adaptive security of the schemes utilizing a composite order group can be proven under the general subgroup decisional assumption, while many existing systems working in a composite order group are secure under multiple subgroup decision assumptions. We note that this finding is of an independent interest, which may be useful in other scenarios.
Identity-Based Broadcast Encryption (IBBE\textsf{IBBE}IBBE) is a novel concept that can efficiently and securely transmit confidential content to a group of authorized users without the traditional Public-Key Infrastructure (PKI\textsf{PKI}PKI). After carefully exploring these areas, we have observed that none of the existing works have adopted the quantum-attack resistant cryptographic machinery Multivariate Public-Key Cryptography (MPKC\textsf{MPKC}MPKC) with provable security. We are the first to design a quantum-safe IBBE\textsf{IBBE}IBBE that solely relies on the MPKC\textsf{MPKC}MPKC framework. Our proposed protocol has achieved $ \mathcal{O}(n) $-size communication bandwidth and $ {n^3}\cdot\mathcal{O}\big(\max\big\{N, {\delta}^4\big\}\big) $-size overhead storage without any security breach. Here, $ n $ is the number of variables for each multivariate polynomial, $ N $ represents the total number of system users, and $ \delta $ denotes a positive fixed-length. More positively, our design has achieved the adaptive INDistinguishable Chosen-Ciphertext Attack (IND-CCA\textsf{IND-CCA}IND-CCA) security in the Random Oracle Model (ROM\textsf{ROM}ROM) under the hardness of standard Multivariate Quadratic (MQ\textsf{MQ}MQ) problem. We emphasize that our system can also be immune against collusion attacks where several users come together to create an illicit decryption box.
The paradigm of forward security provides a promising approach to deal with the key exposure problem as it can effectively minimize the damage caused by the key exposure. In this paper, we develop a new forward-secure identity-based encryption scheme without random oracles. We formally prove that the proposed scheme is secure against adaptive chosen-ciphertext attacks in the standard model. In the proposed scheme, the running time of the private key extraction and decryption algorithms and the sizes of the user's initial private key and the ciphertext are independent on the total number of time periods, and any other performance parameter has at most log-squared complexity in terms of the total number of time periods. Compared with the previous forward-secure identity-based encryption schemes, the proposed scheme enjoys obvious advantage in the overall performance. To the best of our knowledge, it is the first forward-secure identity-based encryption scheme that achieves direct chosen-ciphertext security in the standard model.
Abstract. Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret data of alreadycorrupted parties. Ideally, an adaptively-secure encryption scheme should, like standard public-key encryption, allow arbitrarily-many parties to use a single encryption key to securely encrypt arbitrarily-many messages to a given receiver who maintains only a single short decryption key. However, it is known that these requirements are impossible to achieve: no non-interactive encryption scheme that supports encryption of an unbounded number of messages and uses a single, unchanging decryption key can be adaptively secure. Impossibility holds even if secure data erasure is possible. We show that this limitation can be overcome by updating the decryption key over time and making some mild assumptions about the frequency of communication between parties. Using this approach, we construct adaptively-secure, completely non-interactive encryption schemes supporting secure encryption of arbitrarily-many messages from arbitrarilymany senders. Our schemes additionally provide forward security and security against chosen-ciphertext attacks. 1
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.
- Broadcast encryption helps a sender to securely distribute messages to a dynamically changing set of users over an uncertainty channel. The broadcast encryption scheme needs a trusted party to distribute decoded keys. Group key agreement (GKA) protocols set up a group of members to negotiate a common encryption key via open networks so that only the group members can decrypt the texts and the contributory broadcast encryption (Con BE) can enable the sender to send message to particular member of the group but, it do not offer a fully trusted third-party to set up the system and Existing GKA protocols does not handle sender/member changes effectively. We proposed Arbitrary Topology Generalization and Identity-based Broadcast Encryption (ATIBE) scheme. The scheme holds a Private Key Generator (PKG). The PKG generates private keys from users’ identities by using a master secret key (MSK). The PKG also strengthen the public broadcast encryption key and distributes information of decryption keys to users. This scheme allows avoiding the neighbors’ communication problems, efficient encryption/decryption and only one round is requires setting up the public group. In addition to this proxy re-encryption scheme is used to improve the security level. This proposed scheme establishes secure Broadcast channels and provides a secure numerous emerging distributed computation applications.