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

International Conference on Intelligent Networking and Collaborative Systems (INCoS)

A New Privacy-Preserving Broadcast Encryption Scheme from DPVS

Hao Wang, Zhihua Zheng, Yilei Wang

Published Sep 1, 2013• 3 citations
Publisher

Abstract

In this paper, we consider the privacy-preserving problem in the context of broadcast encryption. We provide a security definition for privacy-preserving broadcast encryption, and construct a new scheme. To achieve privacy-preserving, we blind the cipher texts using the random factors. Moreover, we use a pair of orthonormal bases to construct secret key and cipher texts for proper decryption. Our privacy-preserving broadcast encryption scheme can be proven in the adaptive model without random oracle. The key technique used to obtain our result is an elaborate combination of the dual system encryption proposed by Waters and a new approach on bilinear pairings using the notion of dual pairing vector spaces (DPVS) proposed by Okamoto and Takasima.

DOI
10.1109/incos.2013.61

Related papers

Privacy-Preserving Server-Supported Decryption

Peeter Laud, Alisa Pankova, Jelizaveta Vakarjuk

In this paper, we consider encryption systems with two-out-of-two threshold decryption, where one of the parties (the client) initiates the decryption and the other one (the server) assists. Existing threshold decryption schemes disclose to the server the ciphertext that is being decrypted. We give a construction, where the identity of the ciphertext is not leaked to the server, and the client's privacy is thus preserved. While showing the security of this construction, we run into the issue of defining the security of a scheme with blindly assisted decryption. We discuss previously proposed security definitions for similar cryptographic functionalities and argue why they do not capture the expected meaning of security. We propose an ideal functionality for the encryption with server-supported blind threshold decryption in the universal composability model, carefully balancing between the meaning of privacy, and the ability to implement it. We construct a protocol and show that it is a secure implementation of the proposed functionality in the random oracle model.

arXiv:2410.19338•IEEE Computer Security Foundations Workshop (CSFW)•Jun 16, 2025•2 citations

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

Jongkil Kim, Willy Susilo, Man Ho Au +1 more

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.

IEEE Transactions on Information Forensics and Security•Jan 1, 2015•72 citations

Privacy‐preserving multireceiver ID‐based encryption with provable security

Yuh‐Min Tseng, Yi‐Hung Huang, Chang Hui-ju

SUMMARY Multireceiver identity (ID) based encryption and ID‐based broadcast encryption allow a sender to use the public identities of multiple receivers to encrypt messages so that only the selected receivers or a privileged set of users can decrypt the messages. It can be used for many practical applications such as digital content distribution, pay‐per‐view and multicast communication. For protecting the privacy of receivers or providing receiver anonymity, several privacy‐preserving (or anonymous) multireceiver ID‐based encryption and ID‐based broadcast encryption schemes were recently proposed, in which receiver anonymity means that nobody (including any selected receiver), except the sender, knows who the other selected receivers are. However, security incompleteness or flaws were found in these schemes. In this paper, we propose a new privacy‐preserving multireceiver ID‐based encryption scheme with provable security. We formally prove that the proposed scheme is semantically secure for confidentiality and receiver anonymity. Compared with the previously proposed anonymous multireceiver ID‐based encryption and ID‐based broadcast encryption schemes, the proposed scheme has better performance and robust security. Copyright © 2012 John Wiley & Sons, Ltd.

International Journal of Communication Systems•Jun 29, 2012•35 citations

Forward-Secure Identity-based Broadcast Encryption Scheme from Lattice

Xinwen Zhang, Shangping Wang, Wenpeng Zhang

Motivated by an identity-based broadcast encryption scheme from lattice(1) and a forward-secure identity-based encryption scheme(2), we propose a forward-secure identity-based broadcast encryption scheme from lattice by adding the forward-security mechanism on broadcast encryption scheme. Our scheme satisfies the security requirements of both the broadcast encrypt ion scheme and forward-security scheme, that is, it is forward-secure for the secret keys used previously, and we prove that it is semantic secure based on LWE (Learning With Error)assumption(3) in the random oracle model. In addition, our construction is believed to be secure against quantum computer.

Applied Mathematics & Information Sciences•Jan 1, 2015•3 citations

Broadcast Encryption Scheme from Lattice

Jin Wang, Bo Sun, Xin Li

Motivated by the lattice basis delegation technique due to [8, 22, 9], we propose a broadcast encryption scheme based on the hard worst-case lattice problems. The proposed scheme is secure in the random oracle model. To the best of the authors' knowledge, our construction constitute the first broadcast encryption schemes from lattices.

International Conference on E-Business and E-Government•May 11, 2012•0 citations

Symmetric Blind Decryption with Perfect Secrecy

Juha Partala

A blind decryption scheme enables a user to query decryptions from a decryption server without revealing information about the plain-text message. Such schemes are useful, for example, for the implementation of privacy-preserving encrypted file storages and payment systems. In terms of functionality, blind decryption is close to oblivious transfer. For noiseless channels, information-theoretically secure oblivious transfer is impossible. However, in this paper, we show that this is not the case for blind decryption. We formulate a definition of perfect secrecy of symmetric blind decryption for the following setting: at most one of the scheme participants is a passive adversary (honest-but-curious). We also devise a symmetric blind decryption scheme based on modular arithmetic on a ring Zp2 , where p is a prime, and show that it satisfies our notion of perfect secrecy.

arXiv:1510.06231•Journal of Computer Networks and Communications•Jan 1, 2017•1 citation
In this paper, we consider the privacy-preserving problem in the context of broadcast encryption. We provide a security definition for privacy-preserving broadcast encryption, and construct a new scheme. To achieve privacy-preserving, we blind the cipher texts using the random factors. Moreover, we use a pair of orthonormal bases to construct secret key and cipher texts for proper decryption. Our privacy-preserving broadcast encryption scheme can be proven in the adaptive model without random oracle. The key technique used to obtain our result is an elaborate combination of the dual system encryption proposed by Waters and a new approach on bilinear pairings using the notion of dual pairing vector spaces (DPVS) proposed by Okamoto and Takasima.
In this paper, we consider encryption systems with two-out-of-two threshold decryption, where one of the parties (the client) initiates the decryption and the other one (the server) assists. Existing threshold decryption schemes disclose to the server the ciphertext that is being decrypted. We give a construction, where the identity of the ciphertext is not leaked to the server, and the client's privacy is thus preserved. While showing the security of this construction, we run into the issue of defining the security of a scheme with blindly assisted decryption. We discuss previously proposed security definitions for similar cryptographic functionalities and argue why they do not capture the expected meaning of security. We propose an ideal functionality for the encryption with server-supported blind threshold decryption in the universal composability model, carefully balancing between the meaning of privacy, and the ability to implement it. We construct a protocol and show that it is a secure implementation of the proposed functionality in the random oracle model.
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.
SUMMARY Multireceiver identity (ID) based encryption and ID‐based broadcast encryption allow a sender to use the public identities of multiple receivers to encrypt messages so that only the selected receivers or a privileged set of users can decrypt the messages. It can be used for many practical applications such as digital content distribution, pay‐per‐view and multicast communication. For protecting the privacy of receivers or providing receiver anonymity, several privacy‐preserving (or anonymous) multireceiver ID‐based encryption and ID‐based broadcast encryption schemes were recently proposed, in which receiver anonymity means that nobody (including any selected receiver), except the sender, knows who the other selected receivers are. However, security incompleteness or flaws were found in these schemes. In this paper, we propose a new privacy‐preserving multireceiver ID‐based encryption scheme with provable security. We formally prove that the proposed scheme is semantically secure for confidentiality and receiver anonymity. Compared with the previously proposed anonymous multireceiver ID‐based encryption and ID‐based broadcast encryption schemes, the proposed scheme has better performance and robust security. Copyright © 2012 John Wiley & Sons, Ltd.
Motivated by an identity-based broadcast encryption scheme from lattice(1) and a forward-secure identity-based encryption scheme(2), we propose a forward-secure identity-based broadcast encryption scheme from lattice by adding the forward-security mechanism on broadcast encryption scheme. Our scheme satisfies the security requirements of both the broadcast encrypt ion scheme and forward-security scheme, that is, it is forward-secure for the secret keys used previously, and we prove that it is semantic secure based on LWE (Learning With Error)assumption(3) in the random oracle model. In addition, our construction is believed to be secure against quantum computer.
A blind decryption scheme enables a user to query decryptions from a decryption server without revealing information about the plain-text message. Such schemes are useful, for example, for the implementation of privacy-preserving encrypted file storages and payment systems. In terms of functionality, blind decryption is close to oblivious transfer. For noiseless channels, information-theoretically secure oblivious transfer is impossible. However, in this paper, we show that this is not the case for blind decryption. We formulate a definition of perfect secrecy of symmetric blind decryption for the following setting: at most one of the scheme participants is a passive adversary (honest-but-curious). We also devise a symmetric blind decryption scheme based on modular arithmetic on a ring Zp2 , where p is a prime, and show that it satisfies our notion of perfect secrecy.