Identity-based online/offline key encapsulation and encryption

Sherman Sze-Ming Chow, Joseph K Liu, Jianying Zhou

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

42 Citations (Scopus)

Abstract

An identity-based online/offline encryption (IBOOE) scheme splits the encryption process into two phases. The first phase performs most of the heavy computations, such as modular exponentiation or pairing over points on elliptic curve. The knowledge of the plaintext or the receiver s identity is not required until the second phase, where the ciphertext is produced by only light computations, such as integer addition/multiplication or hashing. This division of computations makes encryption affordable by devices with limited computation power since the preparation works can be executed\offline or possibly by some powerful devices. The identity-based (ID-based) nature of the scheme also allows the preparation of ciphertext without certificate verification. Since efficiency is the main concern, less burden in the computation requirements of all phases (i.e., both phases of encryption and the decryption phase) and smaller ciphertext size are desirable. In this paper, we propose new schemes with improved efficiency over previous schemes by assuming random oracles. Our first construction is a very efficient scheme secure against chosen-plaintext attack (CPA), which is just slightly modified from an existing scheme. We then proceed to propose a new notion called ID-based Online/Offline KEM (IBOOKEM) that allows the key encapsulation process to be split into offline and online stages, in the same way as IBOOE does. We also present a generic transformation to get security against chosen-ciphertext attack (CCA) for IBOOE from any IBOOKEM scheme with one-wayness only. Our schemes (both CPA and CCA) are the most efficient one in the state-of-the-art, in terms of online computation and ciphertext size, which are the two main focuses of online/offline schemes. Our schemes are very suitable to be deployed on embedded devices such as smartcard or wireless sensor which have very limited computation powers and the communication bandwidth is very expensive.
Original languageEnglish
Title of host publicationProceedings of the 6th ACM Symposium on Information, Computer and Communications Security (ASIACCS 2011)
EditorsRavi Sandhu, Duncan S Wong
Place of PublicationNew York NY USA
PublisherAssociation for Computing Machinery (ACM)
Pages52 - 60
Number of pages9
Volume1
ISBN (Print)9781450305648
DOIs
Publication statusPublished - 2011
Externally publishedYes
EventACM Symposium on Information, Computer and Communications Security 2011 - Hong Kong, China
Duration: 22 Mar 201124 Mar 2011
Conference number: 6th
http://www.cs.hku.hk/asiaccs2011/

Conference

ConferenceACM Symposium on Information, Computer and Communications Security 2011
Abbreviated titleAsiaCCS 2011
CountryChina
CityHong Kong
Period22/03/1124/03/11
Internet address

Cite this

Chow, S. S-M., Liu, J. K., & Zhou, J. (2011). Identity-based online/offline key encapsulation and encryption. In R. Sandhu, & D. S. Wong (Eds.), Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security (ASIACCS 2011) (Vol. 1, pp. 52 - 60). New York NY USA: Association for Computing Machinery (ACM). https://doi.org/10.1145/1966913.1966922
Chow, Sherman Sze-Ming ; Liu, Joseph K ; Zhou, Jianying. / Identity-based online/offline key encapsulation and encryption. Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security (ASIACCS 2011). editor / Ravi Sandhu ; Duncan S Wong. Vol. 1 New York NY USA : Association for Computing Machinery (ACM), 2011. pp. 52 - 60
@inproceedings{73d84762a2d64cfeb716325a65c10b82,
title = "Identity-based online/offline key encapsulation and encryption",
abstract = "An identity-based online/offline encryption (IBOOE) scheme splits the encryption process into two phases. The first phase performs most of the heavy computations, such as modular exponentiation or pairing over points on elliptic curve. The knowledge of the plaintext or the receiver s identity is not required until the second phase, where the ciphertext is produced by only light computations, such as integer addition/multiplication or hashing. This division of computations makes encryption affordable by devices with limited computation power since the preparation works can be executed\offline or possibly by some powerful devices. The identity-based (ID-based) nature of the scheme also allows the preparation of ciphertext without certificate verification. Since efficiency is the main concern, less burden in the computation requirements of all phases (i.e., both phases of encryption and the decryption phase) and smaller ciphertext size are desirable. In this paper, we propose new schemes with improved efficiency over previous schemes by assuming random oracles. Our first construction is a very efficient scheme secure against chosen-plaintext attack (CPA), which is just slightly modified from an existing scheme. We then proceed to propose a new notion called ID-based Online/Offline KEM (IBOOKEM) that allows the key encapsulation process to be split into offline and online stages, in the same way as IBOOE does. We also present a generic transformation to get security against chosen-ciphertext attack (CCA) for IBOOE from any IBOOKEM scheme with one-wayness only. Our schemes (both CPA and CCA) are the most efficient one in the state-of-the-art, in terms of online computation and ciphertext size, which are the two main focuses of online/offline schemes. Our schemes are very suitable to be deployed on embedded devices such as smartcard or wireless sensor which have very limited computation powers and the communication bandwidth is very expensive.",
author = "Chow, {Sherman Sze-Ming} and Liu, {Joseph K} and Jianying Zhou",
year = "2011",
doi = "10.1145/1966913.1966922",
language = "English",
isbn = "9781450305648",
volume = "1",
pages = "52 -- 60",
editor = "Ravi Sandhu and Wong, {Duncan S}",
booktitle = "Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security (ASIACCS 2011)",
publisher = "Association for Computing Machinery (ACM)",
address = "United States of America",

}

Chow, SS-M, Liu, JK & Zhou, J 2011, Identity-based online/offline key encapsulation and encryption. in R Sandhu & DS Wong (eds), Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security (ASIACCS 2011). vol. 1, Association for Computing Machinery (ACM), New York NY USA, pp. 52 - 60, ACM Symposium on Information, Computer and Communications Security 2011, Hong Kong, China, 22/03/11. https://doi.org/10.1145/1966913.1966922

Identity-based online/offline key encapsulation and encryption. / Chow, Sherman Sze-Ming; Liu, Joseph K; Zhou, Jianying.

Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security (ASIACCS 2011). ed. / Ravi Sandhu; Duncan S Wong. Vol. 1 New York NY USA : Association for Computing Machinery (ACM), 2011. p. 52 - 60.

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

TY - GEN

T1 - Identity-based online/offline key encapsulation and encryption

AU - Chow, Sherman Sze-Ming

AU - Liu, Joseph K

AU - Zhou, Jianying

PY - 2011

Y1 - 2011

N2 - An identity-based online/offline encryption (IBOOE) scheme splits the encryption process into two phases. The first phase performs most of the heavy computations, such as modular exponentiation or pairing over points on elliptic curve. The knowledge of the plaintext or the receiver s identity is not required until the second phase, where the ciphertext is produced by only light computations, such as integer addition/multiplication or hashing. This division of computations makes encryption affordable by devices with limited computation power since the preparation works can be executed\offline or possibly by some powerful devices. The identity-based (ID-based) nature of the scheme also allows the preparation of ciphertext without certificate verification. Since efficiency is the main concern, less burden in the computation requirements of all phases (i.e., both phases of encryption and the decryption phase) and smaller ciphertext size are desirable. In this paper, we propose new schemes with improved efficiency over previous schemes by assuming random oracles. Our first construction is a very efficient scheme secure against chosen-plaintext attack (CPA), which is just slightly modified from an existing scheme. We then proceed to propose a new notion called ID-based Online/Offline KEM (IBOOKEM) that allows the key encapsulation process to be split into offline and online stages, in the same way as IBOOE does. We also present a generic transformation to get security against chosen-ciphertext attack (CCA) for IBOOE from any IBOOKEM scheme with one-wayness only. Our schemes (both CPA and CCA) are the most efficient one in the state-of-the-art, in terms of online computation and ciphertext size, which are the two main focuses of online/offline schemes. Our schemes are very suitable to be deployed on embedded devices such as smartcard or wireless sensor which have very limited computation powers and the communication bandwidth is very expensive.

AB - An identity-based online/offline encryption (IBOOE) scheme splits the encryption process into two phases. The first phase performs most of the heavy computations, such as modular exponentiation or pairing over points on elliptic curve. The knowledge of the plaintext or the receiver s identity is not required until the second phase, where the ciphertext is produced by only light computations, such as integer addition/multiplication or hashing. This division of computations makes encryption affordable by devices with limited computation power since the preparation works can be executed\offline or possibly by some powerful devices. The identity-based (ID-based) nature of the scheme also allows the preparation of ciphertext without certificate verification. Since efficiency is the main concern, less burden in the computation requirements of all phases (i.e., both phases of encryption and the decryption phase) and smaller ciphertext size are desirable. In this paper, we propose new schemes with improved efficiency over previous schemes by assuming random oracles. Our first construction is a very efficient scheme secure against chosen-plaintext attack (CPA), which is just slightly modified from an existing scheme. We then proceed to propose a new notion called ID-based Online/Offline KEM (IBOOKEM) that allows the key encapsulation process to be split into offline and online stages, in the same way as IBOOE does. We also present a generic transformation to get security against chosen-ciphertext attack (CCA) for IBOOE from any IBOOKEM scheme with one-wayness only. Our schemes (both CPA and CCA) are the most efficient one in the state-of-the-art, in terms of online computation and ciphertext size, which are the two main focuses of online/offline schemes. Our schemes are very suitable to be deployed on embedded devices such as smartcard or wireless sensor which have very limited computation powers and the communication bandwidth is very expensive.

UR - http://goo.gl/j724FT

U2 - 10.1145/1966913.1966922

DO - 10.1145/1966913.1966922

M3 - Conference Paper

SN - 9781450305648

VL - 1

SP - 52

EP - 60

BT - Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security (ASIACCS 2011)

A2 - Sandhu, Ravi

A2 - Wong, Duncan S

PB - Association for Computing Machinery (ACM)

CY - New York NY USA

ER -

Chow SS-M, Liu JK, Zhou J. Identity-based online/offline key encapsulation and encryption. In Sandhu R, Wong DS, editors, Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security (ASIACCS 2011). Vol. 1. New York NY USA: Association for Computing Machinery (ACM). 2011. p. 52 - 60 https://doi.org/10.1145/1966913.1966922