Identity-Based Multi-Signcryption Scheme without Random Oracles

Zhang, Bo; Xu, Qiuliang

doi:10.3724/sp.j.1016.2010.00103

Cited by 14 publications

(25 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Namely, the length of public parameters of the new scheme is only about one half of that of the schemes in [23,24,26,27]. From this point of view, a shorter public parameter makes the new scheme more suitable for low storage requirement of applications.…”

Section: Comparisonsmentioning

confidence: 91%

“…The symbol × means it is vulnerable to the attack while √ indicates that it can resist the attack. Note that the scheme in [23,24,26,27] can not be regarded as secure since they suffer either the IND-CCA attack or the IND-CCA attack. The new scheme achieves both IND-CCA security and EUF-CMA security.…”

Section: Comparisonsmentioning

confidence: 99%

“…We compare the security and the performance efficiency of our scheme to those of the known ID-based signcryption without random oracles in [23,24,26,27]. M G , E G , M G T , E G T , I G T , andê, denote the multiplication in G, the exponentiation in G, the multiplication in G T , the exponentiation in G T , the inversion in G T and the pairing operation, respectively.…”

Section: Comparisonsmentioning

confidence: 99%

“…Assume that the output length of the secure hash functions used in the schemes are same, that is, n u = n m = n. 2n + 5 group elements are required as public parameters in [23,24,26,27] while only n + 6 elements are needed in our scheme. Namely, the length of public parameters of the new scheme is only about one half of that of the schemes in [23,24,26,27].…”

Section: Comparisonsmentioning

confidence: 99%

“…Unfortunately, recent cryptanalysis due to Li et al [25] shows that Jin et al's scheme [24] suffers from the indistinguishability against adaptive chosen ciphertexts attack and existential unforgeability against adaptive chosen messages attack. Zhang et al [26] also built another new scheme, but Li et al [27] found that Zhang et al's scheme does not have IND-CPA security and they proposed an improvement claiming it to achieve both IND-CCA2 and EUF-CMA security. However, a recent analysis due to Selvi et al [28] concluded that Li et al's scheme reaches neither IND-CCA2 property nor EUF-CMA property.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Novel Identity-Based Signcryption Scheme in the Standard Model

Huang

Yang

2017

Information

View full text Add to dashboard Cite

Identity-based signcryption is a useful cryptographic primitive that provides both authentication and confidentiality for identity-based crypto systems. It is challenging to build a secure identity-based signcryption scheme that can be proven secure in a standard model. In this paper, we address the issue and propose a novel construction of identity-based signcryption which enjoys IND-CCA security and existential unforgeability without resorting to the random oracle model. Comparisons demonstrate that the new scheme achieves stronger security, better performance efficiency and shorter system parameters.

show abstract

Section: Comparisonsmentioning

confidence: 91%

Section: Comparisonsmentioning

confidence: 99%

Section: Comparisonsmentioning

confidence: 99%

Section: Comparisonsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Novel Identity-Based Signcryption Scheme in the Standard Model

Huang

Yang

2017

Information

View full text Add to dashboard Cite

show abstract

ID Based Signcryption Scheme in Standard Model

et al. 2012

View full text Add to dashboard Cite

Abstract. Designing an ID based signcryption scheme in the standard model is among the most interesting and important problems in cryptography. However, all the existing systems in the ID based setting, in the standard model, do not have either the unforgeability property or the indistinguishability property or both of them. In this paper, we present the first provably secure ID based signcryption scheme in the standard model with both these properties. The unforgeability property of this scheme is based on the hardness of Computational Diffie-Hellman problem and the indistinguishability property of this scheme is based on the hardness of Decisional Bilinear Diffie-Hellman problem. Our scheme is strongly unforgeable in the strong attack mode called insider security. Moreover, our scheme possess an interesting property called public verifiability of the ciphertext. Our scheme integrates cleverly, a modified version of Waters' IBE and a suitably modified version of the ID based signature scheme in the standard model proposed by Paterson et al. However, our security reductions are more efficient. Specifically, while the security reductions for indistinguishability is similar to the bounds of Waters' scheme, the unforgeability reductions are way better than the bounds for Paterson et al.'s scheme.

show abstract