scispace - formally typeset
Open AccessBook ChapterDOI

A Signcryption Scheme with Signature Directly Verifiable by Public Key

Reads0
Chats0
TLDR
Zheng's scheme is modified so that the recipient's private key is no longer needed in signature verification, and the computational cost is higher than that of Zheng's scheme but lower than that that of the signature-then-encryption approach.
Abstract
Signcryption, first proposed by Zheng [4, 5], is a cryptographic primitive which combines both the functions of digital signature and public key encryption in a logical single step, and with a computational cost siginficantly lower than that needed by the traditional signature-then-encryption approach. In Zheng's scheme, the signature verification can be done either by the recipient directly (using his private key) or by engaging a zero-knowledge interative protocol with a third party, without disclosing recipient's private key. In this note, we modify Zheng's scheme so that the recipient's private key is no longer needed in signature verification. The computational cost of the modified scheme is higher than that of Zheng's scheme but lower than that of the signature-then-encryption approach.

read more

Citations
More filters
Posted Content

New identity based signcryption schemes from pairings.

TL;DR: In this paper, a new identity-based scheme based on pairings over elliptic curves was proposed, which combines the functionalities of signature and encryption and is provably secure in the random oracle model.
Proceedings ArticleDOI

A new identity based signcryption scheme from pairings

TL;DR: In this paper, a new identity based scheme using pairings over elliptic curves is presented, which combines the functionalities of signature and encryption and is provably secure in the random oracle model.
Journal ArticleDOI

Practical Secure Communication for Integrating Wireless Sensor Networks Into the Internet of Things

Fagen Li, +1 more
- 25 Jun 2013 - 
TL;DR: A heterogeneous online and offline signcryption scheme to secure communication between a sensor node and an Internet host is proposed and it is proved that this scheme is indistinguishable against adaptive chosen ciphertext attacks under the bilinear Diffie-Hellman inversion problem and existential unforgeability against adaptive choices messages attacksunder the q-strong Diffie -Hellman problem in the random oracle model.
Proceedings ArticleDOI

SoK: Sharding on Blockchain

TL;DR: Sharding has emerged as a good candidate that can overcome both the scalability and performance problems in blockchain this article, however, there is no systematic work that analyzes the sharding protocols.
Book ChapterDOI

Efficient signcryption with key privacy from gap Diffie-Hellman groups

TL;DR: This scheme is built on the scheme proposed by Boneh, Lynn and Shacham in 2001 to produce short signatures and introduces some randomness into this signature to increase its level of security in the random oracle model and to re-use that randomness to perform encryption.
References
More filters
Journal ArticleDOI

A public key cryptosystem and a signature scheme based on discrete logarithms

TL;DR: A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.
Book ChapterDOI

A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms

TL;DR: In this article, a new signature scheme is proposed together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem and the security of both systems relies on the difficulty of computing discrete logarithms over finite fields.
Book ChapterDOI

Efficient Identification and Signatures for Smart Cards

TL;DR: An efficient interactive identification scheme and a related signature scheme that are based on discrete logarithms and which are particularly suited for smart cards are presented.
Book ChapterDOI

Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption)

TL;DR: Signcryption as discussed by the authors is a new cryptographic primitive which simultaneously fulfills both the functions of digital signature and public key encryption in a logically single step, and with a cost significantly lower than that required by signature-then-encryption.
Journal ArticleDOI

Cryptanalysis and improvement of signcryption schemes

H. Petersen, +1 more
TL;DR: In this paper, a serious problem with two new schemes for authenticated encryption, called signcryption, are pointed out and a solution is outlined that helps to overcome the problem.