You are looking at a specific version 20050215:152312 of this paper. See the latest version.

Paper 2004/244

Signcryption in Hierarchical Identity Based Cryptosystem

Sherman S.M. Chow and Tsz Hon Yuen and Lucas C.K. Hui and S.M. Yiu

Abstract

In many situations we want to enjoy confidentiality, authenticity and non-repudiation of message simultaneously. One approach to achieve this objective is to "sign-then-encrypt" the message, or we can employ special cryptographic scheme like signcryption. Two open problems about identity-based (ID-based) signcryption were proposed in \cite{CryptoePrint:2003:023}. The first one is to devise an efficient forward-secure signcryption scheme with public verifiability and public ciphertext authenticity, which is promptly closed by \cite{LNCS2971:ICISC2003:CYHC}. Another one which still remains open is to devise a hierarchical ID-based signcryption scheme that allows the user to receive signcrypted messages from sender who is under another sub-tree of the hierarchy. This paper aims at solving this problem by proposing two concrete constructions of hierarchical ID-based signcryption.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. To appear in Security and Privacy in the Age of Ubiquitous Computing, IFIP TC11 20th International Conference on Information Security (SEC 2005), May 30 - June 1, 2005, Chiba, Japan.
Keywords
ID-based cryptographySigncryptionHierarchical ID-based CryptosystemBilinear pairings
Contact author(s)
smchow @ cs hku hk
History
2005-02-15: last of 12 revisions
2004-09-22: received
See all versions
Short URL
https://ia.cr/2004/244
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.