CryptoDB

Paper: Identity Based Online/Offline Encryption Scheme

Authors: Sharmila Deva Selvi S Sree Vivek S Pandu Rangan C URL: http://eprint.iacr.org/2010/178 Search ePrint Search Google Consider the situation where a low power device with limited computational power has to perform cryptographic operation in order to do secure communication to the base station where the computational power is not limited. The most obvious way is to split each and every cryptographic operations into resource consuming, heavy operations (which are performed when the device is idle) and the fast light weight operations (which are executed on the fly). This concept is called online/offline cryptography. In this paper, we show the security weakness of an identity based online offline encryption scheme proposed in ACNS 09 by Liu et al. \cite{LiuZ09}. The scheme in \cite{LiuZ09} is the first identity based online offline encryption scheme in the random oracle model, in which the message and recipient are not known during the offline phase. We show that this scheme is not CCA secure. We show the weakness in the security proof of CCA secure online/offline encryption system proposed by Chow et al. in \cite{Chow10}. We propose a new provably secure identity based online offline encryption scheme in which the message and receiver are not known during the offline phase. Since all the CCA secure identity based online/offline encryption schemes are shown to have weakness, ours is the first provably secure scheme with the aforementioned properties.
BibTeX
@misc{eprint-2010-23079,
title={Identity Based Online/Offline Encryption Scheme},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / Identity Based, Encryption, Online/Offline, Cryptanalysis},
url={http://eprint.iacr.org/2010/178},
note={ sharmioshin@gmail.com, ssreevivek@gmail.com,sharmioshins@gmail.com 14820 received 2 Apr 2010, last revised 30 Jul 2010},
author={Sharmila Deva Selvi S and Sree Vivek S and Pandu Rangan C},
year=2010
}