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

Security and Communication Networks

Privacy‐preserving multi‐receiver signcryption scheme for heterogeneous systems

Yahong Li, Caifen Wang, Yulei Zhang, Shufen Niu

Published Oct 27, 2016• 29 citations
Publisher

Abstract

Abstract In recent years, secure communication and privacy‐preserving are gaining popularity because of the advent of wireless network. Certificateless cryptography (CLC) and identity‐based cryptography (IBC) have already been widely applied in the area of wireless network. Hence, to achieve secure communication from CLC to IBC, we present a heterogeneous signcryption scheme that enables a sender in the CLC to transmit a message to multi‐receiver in the IBC. Our scheme has no restrictions on the system parameters and master keys; private key generator and key generating center generate their own system parameters and master key for the IBC users and the CLC user, separately. Considering privacy‐preserving in heterogeneous communication, we show that our scheme can realize the anonymity of all receivers. Compared with other schemes, our scheme has more advantages, such as public verification and decryption fairness, which are attractive for wireless network applications. Moreover, our scheme has the indistinguishability against adaptive chosen ciphertext attacks, the existential unforgeability against adaptive chosen messages attacks, and anonymous indistinguishability of encryptions under selective‐ID, chosen ciphertext attack in the random oracle model. Copyright © 2016 John Wiley & Sons, Ltd.

DOI
10.1002/sec.1650

Related papers

Heterogeneous hybrid signcryption for multi-message and multi-receiver

Shufen Niu, Niu Ling, Xiyan Yang +2 more

To achieve secure communication in heterogeneous cryptography systems, we present a heterogeneous hybrid signcryption scheme. The proposed scheme allows a sender in an identity-based cryptography system to send multi-message to multi-receiver in a certificateless cryptography system with different master keys. At the same time, all users are mapped to a distinct pseudo-identity for conditional identity privacy preservation. A trusted authority could trace the real identity when necessary. Compared with existing schemes, the proposed scheme is more practical for actual applications. In addition, the proposed scheme has indistinguishability against adaptive chosen ciphertext attacks and existential unforgeability against adaptive chosen message attacks under the random oracle model.

PLoS ONE•Sep 8, 2017•20 citations

Reconciling and improving of multi‐receiver signcryption protocols with threshold decryption

Mingwu Zhang, Bo Yang, Tsuyoshi Takagi

ABSTRACT Signcryption is a cryptographic primitive that offers both confidentiality and authentication simultaneously, which combines the functionalities of signature and encryption in a provably secure manner. Indistinguishability against adaptive chosen‐ciphertext attacks (ind‐cca2) and unforgeability against adaptive chosen‐message attacks (euf‐cma2) are two important security requirements of a signcryption protocol. In a multi‐receiver signcryption with a threshold decryption scheme, the ciphertext can be decrypted and verified when arbitrary t or more receivers among the n candidate decrypters work together. Recently, Qin et al. [Security and Communication Networks, 2011] proposed an identity‐based multi‐receiver signcryption scheme with threshold decryption, and they declared that the scheme achieves ind‐cca2 and euf‐cma2 security. In this paper, we first indicate that Qin et al.'s scheme is not secure, that is, Qin et al.'s scheme is neither semantically secure against ind‐cca2 nor unforgeable against euf‐cma2. After that, we present an improved scheme to capture the security requirements. Furthermore, we construct an anonymous version that can preserve the identity privacy of the sender and receiver, and we give the performance evaluation to indicate that our scheme has lower communication overhead although it provides the identity privacy preservation. Copyright © 2012 John Wiley & Sons, Ltd.

Security and Communication Networks•Feb 24, 2012•6 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

Efficient multi-receiver identity-based signcryption from lattice assumption

Xiaojun Zhang, Chunxiang Xu, Jingting Xue

Signcryption is a public-key cryptographic primitive which combines the functions of public-key encryption and digital signature into a single logical step at low computational and communication costs. While multi-receiver signcryption is suited for a situation where a sender wants to send a signcrypted message to multiple receivers in a confidential and authenticated way. Due to this attractive property, recently, multi-receiver signcryption plays an important role in some practical applications such as virtual conference as well as authenticated mail transferring. In this paper, we present an efficient multi-receiver identity-based signcryption (MIBSC) scheme from lattice assumption which is believed to resist quantum computer attacks. The proposed scheme is provably secure in the random oracle model, which has the indistinguishability against chosen ciphertext attacks under the hardness of learning with errors (LWE), and existentially unforgeability against chosen message attacks under the small integer solution assumption (SIS). Moreover, we also compare our MIBSC scheme with existing schemes from performance efficiency and security, the result shows that our proposed scheme is more efficient and more secure. In particular, our scheme can be properly applied in the post-quantum communication environments.

International Journal of Electronic Security and Digital Forensics•Jan 1, 2018•13 citations

Efficient multi-receiver identity-based signcryption from lattice assumption

Xiaojun Zhang, Chunxiang Xu, Jingting Xue

Signcryption is a public-key cryptographic primitive which combines the functions of public-key encryption and digital signature into a single logical step at low computational and communication costs. While multi-receiver signcryption is suited for a situation where a sender wants to send a signcrypted message to multiple receivers in a confidential and authenticated way. Due to this attractive property, recently, multi-receiver signcryption plays an important role in some practical applications such as virtual conference as well as authenticated mail transferring. In this paper, we present an efficient multi-receiver identity-based signcryption (MIBSC) scheme from lattice assumption which is believed to resist quantum computer attacks. The proposed scheme is provably secure in the random oracle model, which has the indistinguishability against chosen ciphertext attacks under the hardness of learning with errors (LWE), and existentially unforgeability against chosen message attacks under the small integer solution assumption (SIS). Moreover, we also compare our MIBSC scheme with existing schemes from performance efficiency and security, the result shows that our proposed scheme is more efficient and more secure. In particular, our scheme can be properly applied in the post-quantum communication environments.

International Journal of Electronic Security and Digital Forensics•Dec 19, 2017•5 citations

Identity‐based signcryption from lattices

Jianhua Yan, Licheng Wang, Mianxiong Dong +2 more

Abstract Signcryption as a cryptographic primitive can carry out signature and encryption simultaneously at a remarkably reduced cost. Identity‐based cryptography is more convenient than public key infrastructure‐based cryptography in certificate management. As a result, identity‐based signcryption has been studied extensively, and many efficient and provably secure constructions have been proposed. However, most of these schemes are based on intractability assumptions from number theory, and these assumptions have been threatened by the booming quantum computation. Therefore, a recent trend in cryptography is to construct cryptosystems that are based on lattice‐based intractability assumptions because of their plausible features of quantum attack resistance. In this paper, several identity‐based signcryption schemes from lattice hardness assumptions are proposed. In the standard model, these schemes are indistinguishable againstinneradaptively chosen ciphertext attacks (IND‐CCA2) and strongly unforgeable againstinnerchosen message attacks. In our construction, it does not matter whether the original encryption scheme used to construct signcryption is deterministic or probabilistic; the resulted signcryption schemes can reach IND‐CCA2 security. To achieve this, we carefully combine three techniques—the identity‐based encryption from lattice due to Agrawal–Boneh–Boyen (EUROCRYPT 2010), the framework of lattice‐based short signature due to Boyen (Public Key Cryptography 2010), and the Canetti–Halevi–Katz (abbr. CHK) technique, with necessary and tailored optimization—for transforming an (ℓ+ 1)‐level indistinguishable under chosen plaintext attack secure hierarchical identity‐based encryption (HIBE) into anℓlevel IND‐CCA2 secure HIBE scheme. In addition, our security proof also contains a more efficient simulation tool that might have separate interest in cryptographic applications. Copyright © 2015 John Wiley & Sons, Ltd.

Security and Communication Networks•Jul 23, 2015•9 citations
Abstract In recent years, secure communication and privacy‐preserving are gaining popularity because of the advent of wireless network. Certificateless cryptography (CLC) and identity‐based cryptography (IBC) have already been widely applied in the area of wireless network. Hence, to achieve secure communication from CLC to IBC, we present a heterogeneous signcryption scheme that enables a sender in the CLC to transmit a message to multi‐receiver in the IBC. Our scheme has no restrictions on the system parameters and master keys; private key generator and key generating center generate their own system parameters and master key for the IBC users and the CLC user, separately. Considering privacy‐preserving in heterogeneous communication, we show that our scheme can realize the anonymity of all receivers. Compared with other schemes, our scheme has more advantages, such as public verification and decryption fairness, which are attractive for wireless network applications. Moreover, our scheme has the indistinguishability against adaptive chosen ciphertext attacks, the existential unforgeability against adaptive chosen messages attacks, and anonymous indistinguishability of encryptions under selective‐ID, chosen ciphertext attack in the random oracle model. Copyright © 2016 John Wiley & Sons, Ltd.
To achieve secure communication in heterogeneous cryptography systems, we present a heterogeneous hybrid signcryption scheme. The proposed scheme allows a sender in an identity-based cryptography system to send multi-message to multi-receiver in a certificateless cryptography system with different master keys. At the same time, all users are mapped to a distinct pseudo-identity for conditional identity privacy preservation. A trusted authority could trace the real identity when necessary. Compared with existing schemes, the proposed scheme is more practical for actual applications. In addition, the proposed scheme has indistinguishability against adaptive chosen ciphertext attacks and existential unforgeability against adaptive chosen message attacks under the random oracle model.
ABSTRACT Signcryption is a cryptographic primitive that offers both confidentiality and authentication simultaneously, which combines the functionalities of signature and encryption in a provably secure manner. Indistinguishability against adaptive chosen‐ciphertext attacks (ind‐cca2) and unforgeability against adaptive chosen‐message attacks (euf‐cma2) are two important security requirements of a signcryption protocol. In a multi‐receiver signcryption with a threshold decryption scheme, the ciphertext can be decrypted and verified when arbitrary t or more receivers among the n candidate decrypters work together. Recently, Qin et al. [Security and Communication Networks, 2011] proposed an identity‐based multi‐receiver signcryption scheme with threshold decryption, and they declared that the scheme achieves ind‐cca2 and euf‐cma2 security. In this paper, we first indicate that Qin et al.'s scheme is not secure, that is, Qin et al.'s scheme is neither semantically secure against ind‐cca2 nor unforgeable against euf‐cma2. After that, we present an improved scheme to capture the security requirements. Furthermore, we construct an anonymous version that can preserve the identity privacy of the sender and receiver, and we give the performance evaluation to indicate that our scheme has lower communication overhead although it provides the identity privacy preservation. Copyright © 2012 John Wiley & Sons, Ltd.
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.
Signcryption is a public-key cryptographic primitive which combines the functions of public-key encryption and digital signature into a single logical step at low computational and communication costs. While multi-receiver signcryption is suited for a situation where a sender wants to send a signcrypted message to multiple receivers in a confidential and authenticated way. Due to this attractive property, recently, multi-receiver signcryption plays an important role in some practical applications such as virtual conference as well as authenticated mail transferring. In this paper, we present an efficient multi-receiver identity-based signcryption (MIBSC) scheme from lattice assumption which is believed to resist quantum computer attacks. The proposed scheme is provably secure in the random oracle model, which has the indistinguishability against chosen ciphertext attacks under the hardness of learning with errors (LWE), and existentially unforgeability against chosen message attacks under the small integer solution assumption (SIS). Moreover, we also compare our MIBSC scheme with existing schemes from performance efficiency and security, the result shows that our proposed scheme is more efficient and more secure. In particular, our scheme can be properly applied in the post-quantum communication environments.
Signcryption is a public-key cryptographic primitive which combines the functions of public-key encryption and digital signature into a single logical step at low computational and communication costs. While multi-receiver signcryption is suited for a situation where a sender wants to send a signcrypted message to multiple receivers in a confidential and authenticated way. Due to this attractive property, recently, multi-receiver signcryption plays an important role in some practical applications such as virtual conference as well as authenticated mail transferring. In this paper, we present an efficient multi-receiver identity-based signcryption (MIBSC) scheme from lattice assumption which is believed to resist quantum computer attacks. The proposed scheme is provably secure in the random oracle model, which has the indistinguishability against chosen ciphertext attacks under the hardness of learning with errors (LWE), and existentially unforgeability against chosen message attacks under the small integer solution assumption (SIS). Moreover, we also compare our MIBSC scheme with existing schemes from performance efficiency and security, the result shows that our proposed scheme is more efficient and more secure. In particular, our scheme can be properly applied in the post-quantum communication environments.
Abstract Signcryption as a cryptographic primitive can carry out signature and encryption simultaneously at a remarkably reduced cost. Identity‐based cryptography is more convenient than public key infrastructure‐based cryptography in certificate management. As a result, identity‐based signcryption has been studied extensively, and many efficient and provably secure constructions have been proposed. However, most of these schemes are based on intractability assumptions from number theory, and these assumptions have been threatened by the booming quantum computation. Therefore, a recent trend in cryptography is to construct cryptosystems that are based on lattice‐based intractability assumptions because of their plausible features of quantum attack resistance. In this paper, several identity‐based signcryption schemes from lattice hardness assumptions are proposed. In the standard model, these schemes are indistinguishable againstinneradaptively chosen ciphertext attacks (IND‐CCA2) and strongly unforgeable againstinnerchosen message attacks. In our construction, it does not matter whether the original encryption scheme used to construct signcryption is deterministic or probabilistic; the resulted signcryption schemes can reach IND‐CCA2 security. To achieve this, we carefully combine three techniques—the identity‐based encryption from lattice due to Agrawal–Boneh–Boyen (EUROCRYPT 2010), the framework of lattice‐based short signature due to Boyen (Public Key Cryptography 2010), and the Canetti–Halevi–Katz (abbr. CHK) technique, with necessary and tailored optimization—for transforming an (ℓ+ 1)‐level indistinguishable under chosen plaintext attack secure hierarchical identity‐based encryption (HIBE) into anℓlevel IND‐CCA2 secure HIBE scheme. In addition, our security proof also contains a more efficient simulation tool that might have separate interest in cryptographic applications. Copyright © 2015 John Wiley & Sons, Ltd.