A Survey of Identity-based Signcryption

Li, Fagen; Khan, Muhammad Khurram

doi:10.4103/0256-4602.81236

Cited by 19 publications

(12 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The idea of this kind of primitive is to carry out encryption and signature in a single logical step, to obtain confi dentiality and authentication more eff iciently than the traditional signature-then-encryption approach. Due to the advantages, less computational complexity and lower communication cost, signcryption is suitable for many practical applications which require secure and authenticated message delivery using resource constrained devices [8,12]. The original scheme in [16] is based on the discrete logarithm problem but no security proof is given.…”

Section: Introductionmentioning

confidence: 99%

“…Subsequently, other identity based signcryption schemes using pairing were proposed in the literature [2,4,5,7,9,14]. With these identity based signature schemes and signcryption schemes a lot of new extensions such as proxy signcryption, blind signcryption, ring signcryption, multi-signcryption etc., have been proposed in the literature [8].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Identity Based Multi-Signcryption Scheme with Public Verifiability

Swapna¹,

Reddy²

2014

Journal of Discrete Mathematical Sciences and Cryptography

View full text Add to dashboard Cite

Signcryption is a cryptographic primitive that provides the functionalities of digital signature and public key encryption simultaneously, at a lower computational costs and communication overheads than the traditional signature-then-encryption approach. In some applications, it is often required that multiple senders have to send a message in a secure and authenticated way. If signcryptions are performed individually by the group of senders, the cost involved in unsigncryption is high. So that it is not an eff icient way to signcrypt the message separately. An eff icient alternative method is multi-signcryption. In this paper, we propose an eff icient identity based multi-signcryption scheme with public verifi ability. This scheme provides the functionalities of both multi signatures and secure encryption for multiple senders; and these schemes enables to perform unsigncryption with the cost equal to a single unsigncryption irrespective of the number of senders. We discuss the security requirements such as confi dentiality and unforgeability of the proposed scheme with the assumptions that the CBDH and CDH problems are intractable. Finally, we compare our scheme with the related schemes in terms of computational point of view.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Efficient Identity Based Multi-Signcryption Scheme with Public Verifiability

Swapna¹,

Reddy²

2014

Journal of Discrete Mathematical Sciences and Cryptography

View full text Add to dashboard Cite

show abstract

“…There are some signcryption schemes [9–12] have been proposed to advance the signcryption research. For the multi-receiver cryptography, multi-receiver signcryption gradually becomes the research focus.…”

Section: Introductionmentioning

confidence: 99%

A Novel Multi-Receiver Signcryption Scheme with Complete Anonymity

et al. 2016

View full text Add to dashboard Cite

Anonymity, which is more and more important to multi-receiver schemes, has been taken into consideration by many researchers recently. To protect the receiver anonymity, in 2010, the first multi-receiver scheme based on the Lagrange interpolating polynomial was proposed. To ensure the sender’s anonymity, the concept of the ring signature was proposed in 2005, but afterwards, this scheme was proven to has some weakness and at the same time, a completely anonymous multi-receiver signcryption scheme is proposed. In this completely anonymous scheme, the sender anonymity is achieved by improving the ring signature, and the receiver anonymity is achieved by also using the Lagrange interpolating polynomial. Unfortunately, the Lagrange interpolation method was proven a failure to protect the anonymity of receivers, because each authorized receiver could judge whether anyone else is authorized or not. Therefore, the completely anonymous multi-receiver signcryption mentioned above can only protect the sender anonymity. In this paper, we propose a new completely anonymous multi-receiver signcryption scheme with a new polynomial technology used to replace the Lagrange interpolating polynomial, which can mix the identity information of receivers to save it as a ciphertext element and prevent the authorized receivers from verifying others. With the receiver anonymity, the proposed scheme also owns the anonymity of the sender at the same time. Meanwhile, the decryption fairness and public verification are also provided.

show abstract

“…In 1997, Zhang [2] proposed a cryptographic primitive, called signcryption, to achieve the combined functionalities of digital signatures and encryption in an efficient manner. Many researchers have proposed a variety of signcryption schemes [3]. One of these variants is a proxy signcryption scheme which efficiently combines a proxy signature scheme with an encryption mechanism.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Proxy Signcryption Scheme Based on the Discrete Logarithm Problem

Elkamchouchi¹,

Elkhair²,

Abouelseoud³

2013

IJITMC

View full text Add to dashboard Cite

Signcryption is a cryptographic primitive which simultaneously provides both confidentiality and authenticity in a single logical step. In a proxy signature scheme, an original signer delegates his signing power to a proxy agent, who signs a message on behalf of him. This paper introduces a new proxy signcryption scheme based on the Discrete Logarithm Problem (DLP) with a reduced computational complexity compared to other schemes in literature. In this proposed scheme, the receiver is the only one who can verify the origin of the ciphertext. Moreover, in this scheme, an authorized proxy signcrypter can create valid proxy signatures after verifying the identity of the original signcrypter. The proposed scheme achieves the various desirable security requirements. An elliptic curve based version of the proposed proxy signcryption scheme has been implemented using Mathematica for realistic (256-bit) parameters to emphasize the ease of its practical use.

show abstract

A Survey of Identity-based Signcryption

Cited by 19 publications

References 44 publications

Efficient Identity Based Multi-Signcryption Scheme with Public Verifiability

Efficient Identity Based Multi-Signcryption Scheme with Public Verifiability

A Novel Multi-Receiver Signcryption Scheme with Complete Anonymity

An Efficient Proxy Signcryption Scheme Based on the Discrete Logarithm Problem

Contact Info

Product

Resources

About