Encrypted Message Authentication by Firewalls

Gamage, Chandana; Leiwo, Jussipekka; Zheng, Yuliang

doi:10.1007/3-540-49162-7_6

Cited by 78 publications

(46 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The knowledge of the plaintext m is not required for the public verification of a message's origin. Therefore, our scheme provides the ciphertext authenticity [5] which is very useful in firewalls [24] . If required, the anonymity property is obtained by scrambling the sender's public key Y S together with the message at step 3 of Signcrypt(i.e.…”

Section: Computementioning

confidence: 99%

Efficient and provably secure multi-recipient signcryption from bilinear pairings

Liu

2007

Wuhan Univ. J. of Nat. Sci.

View full text Add to dashboard Cite

Abstract:Signcryption is a cryptographic primitive that performs signature and encryption simultaneously, at a lower computational costs and communication overheads than the signature-then-encryption approach. In this paper, we propose an efficient multi-recipient signcryption scheme based on the bilinear pairings which broadcasts a message to multiple users in a secure and authenticated manner. We prove its semantic security and unforgeability under the Gap Diffie-Hellman problem assumption in the random oracle model. The proposed scheme is more efficient than re-signcrypting a message n times using a signcryption scheme in terms of computational costs and communication overheads.

show abstract

Section: Computementioning

confidence: 99%

Efficient and provably secure multi-recipient signcryption from bilinear pairings

Liu

2007

Wuhan Univ. J. of Nat. Sci.

View full text Add to dashboard Cite

show abstract

“…For the larger part of its history, cryptography remained an art, a game of ad hoc designs and attacks [10]. Although the field retains some of this flavor, the last twenty-five years have brought in something new.…”

Section: Introductionmentioning

confidence: 99%

“…Analyzing this security scheme from an application-oriented point of view [10], can be observed that a great amount of electronic commerce can take advantage of signcryption to provide efficient security solutions in the following areas:…”

Section: Introductionmentioning

confidence: 99%

A survey on new approaches in SignCryption

2015

IJRA

View full text Add to dashboard Cite

SignCryption is a new-fangledmodel in public key type ofcryptography to provide confidentiality and authentication in a solitary logical step at the lower computation cost and communiqué overhead compared to the long-standing signature-then-encryption mechanism [1]. This paper may contain few assessment documents exist, which described that how long had been the signcryption schemes used by the authors. We propose a new style to implementing existing signcryption with the new scheme. Our offered scheme is aprogressed version of existing mechanism followed in Bao & Deng, in which publicly verifiable signcryption is designed [3]. In this scheme, we make sure the security feature of forward secrecy to the signcryption, without an increase in computational cost. Also, this new signcryption procedure delivers the security services of message confidentiality and Authentication using public verifiability

show abstract

“…Signcryption, first proposed by Zheng in 1997 [31], is a cryptographic primitive that performs digital signature and public key encryption simultaneously, at lower computational costs and communication overheads than the signature-then-encryption approach. Several efficient signcryption schemes have been proposed since 1997 [3,11,20,23,25,28]. The original scheme in [31] is based on the discrete logarithm problem but no security proof is given.…”

Section: Introductionmentioning

confidence: 99%

Analysis and improvement of authenticatable ring signcryption scheme

Shirase

Takagi

2008

J. Shanghai Jiaotong Univ. (Sci.)

View full text Add to dashboard Cite

Abstract. Ring signcryption is an anonymous signcryption which allows a user to anonymously signcrypt a message on behalf of a set of users including himself. In an ordinary ring signcryption scheme, even if a user of the ring generates a signcryption, he also cannot prove that the signcryption was produced by himself. In 2008, Zhang, Yang, Zhu, and Zhang solve the problem by introducing an identity-based authenticatable ring signcryption scheme (denoted as the ZYZZ scheme). In the ZYZZ scheme, the actual signcrypter can prove that the ciphertext is generated by himself, and the others cannot authenticate it. However, in this paper, we show that the ZYZZ scheme is not secure against chosen plaintext attacks. Furthermore, we propose an improved scheme that remedies the weakness of the ZYZZ scheme. The improved scheme has shorter ciphertext size than the ZYZZ scheme. We then prove that the improved scheme satisfies confidentiality, unforgeability, anonymity and authenticatability.

show abstract

Encrypted Message Authentication by Firewalls

Cited by 78 publications

References 24 publications

Efficient and provably secure multi-recipient signcryption from bilinear pairings

Efficient and provably secure multi-recipient signcryption from bilinear pairings

A survey on new approaches in SignCryption

Analysis and improvement of authenticatable ring signcryption scheme

Contact Info

Product

Resources

About