Security Analysis of Two Signcryption Schemes

Wang, Guilin; Deng, Robert H.; Kwak, Dong Jin; Moon, SangJae

doi:10.1007/978-3-540-30144-8_11

Cited by 11 publications

(10 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Huang and Chang (2003), point out that Wu and Hsu (2003), scheme is not safe, since the adversary is capable of signature conversion, if he has the knowledge of the actual message and project an improvised scheme. Unfortunately, Wang et al (2004), scheme given by Huang and Chang (2003), is also insecure against known plain text attack. They analyzes that a new ciphertext can be decrypted by an adversary, if he has an idea of some of the of previous valid ciphertext.…”

Section: Introductionmentioning

confidence: 99%

A CAE Scheme Using ECC Based Self Certified PKC

Chande¹,

Lee²,

Li³

2016

Journal of Computer Science

View full text Add to dashboard Cite

Abstract:The Convertible Authentication Encryption (CAE) scheme, allows the signer to generate an authentic ciphertext signature, which can be recuperated and validated by a specific recipient only. In case of any kind of dispute the recipient is capable enough to convert the ciphertext signature as a normal signature and that can be validated publicly. The CAE schemes are used for transformation of confidential information over insecure networks, because they provide confidentiality, authenticity and integrity for the transmitted message or information. We propose a new CAE scheme by integrating the concepts of ECC-based self-certified public keys and encryption scheme. The security analysis shows that the proposed CAE scheme fulfill the basic security conditions such as indistinguishability of ciphertext signature, unforgeability and nonrepudiation. The performance analysis shows that our proposed CAE scheme has little advantage over Wu and Lin scheme regarding computational complexity and timings.

show abstract

Section: Introductionmentioning

confidence: 99%

A CAE Scheme Using ECC Based Self Certified PKC

Chande¹,

Lee²,

Li³

2016

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…Furthermore the Huang-Chang scheme which is the combination of the ElGamal encryption scheme and the Schnorr signature scheme at the same time is widely believed that the ElGamal cryptosystem is very secure, and the security of the Schnorr signature scheme is proved to be equivalent to the discrete log problem [9]. We note that the Huang-Chang scheme is indeed satisfying the unforgeability and non-repudiation requirements of any cryptographic algorithm [12].…”

Section: Schnorr Signcryption Schemementioning

confidence: 99%

“…The Schnorr Signcryption scheme is based on The Huang-Chang Scheme, which is a combination of ElGamal encryption scheme and the Schnorr digital signature scheme [9]. There are four phases in this scheme: setup, Signcryption, Unsigncryption and conversion.…”

Section: Schnorr Signcryption Schemementioning

confidence: 99%

“…The random message encryption would then be encrypted using the recipient's public key. These cryptographic operations are performed in the order of signature-then-encryption [9,13]. This approach consume machine cycle and also introduce expanded bits to the original message, moreover it consume a comparable amount of computational time required for signature verification and decryption.…”

Section: Information Securitymentioning

confidence: 99%

“…In the event of a dispute, Bob converts a valid ciphertext into a publicly verifiable signature to convince a judge (or any third party) that the ciphertext is indeed generated by Alice [9]. Furthermore the Huang-Chang scheme which is the combination of the ElGamal encryption scheme and the Schnorr signature scheme at the same time is widely believed that the ElGamal cryptosystem is very secure, and the security of the Schnorr signature scheme is proved to be equivalent to the discrete log problem [9].…”

Section: Schnorr Signcryption Schemementioning

confidence: 99%

See 2 more Smart Citations

Implementation of Schnorr Signcryption Algorithm on DSP

Elshobaky¹,

Rasslan²,

Guirguis³

2015

IJSIA

View full text Add to dashboard Cite

show abstract

Self‐certified proxy convertible authenticated encryption: formal definitions and a provably secure scheme

Xie

Wang

Xia

et al. 2013

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

SUMMARYIn 2009, Wu and Lin introduced the concept of self‐certified proxy convertible authenticated encryption (SP‐CAE) by integrating self‐certified public‐key system and designated verifier proxy signature with message recovery. They also presented the first SP‐CAE scheme which is based the discrete logarithm problem. However, Wu‐Lin scheme is not secure as Xie et al. recently showed that this scheme is existentially forgeable under adaptive chosen warrants, unconfidentiable and verifiable under adaptive chosen messages and designated verifiers. In this paper, we first discuss the security requirements of SP‐CAE and then formally define unforgeability, message confidentiality, and unverifiability. Consequently, the first complete formal model of SP‐CAE is proposed. After that, we propose a provably secure SP‐CAE scheme by using two‐party Schnorr signature introduced by Nicolosi et al. in 2003. Finally, we prove the formal security of the proposed scheme in the random oracle model under the discrete logarithm assumption. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Security Analysis of Two Signcryption Schemes

Cited by 11 publications

References 24 publications

A CAE Scheme Using ECC Based Self Certified PKC

A CAE Scheme Using ECC Based Self Certified PKC

Implementation of Schnorr Signcryption Algorithm on DSP

Self‐certified proxy convertible authenticated encryption: formal definitions and a provably secure scheme

Contact Info

Product

Resources

About