Efficient leakage-resilient identity-based encryption with CCA security

Shi-Feng Sun, Dawu Gu, Shengli Liu

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

Abstract

Due to the proliferation of side-channel attacks, lots of efforts have been made to construct cryptographic systems that are still secure even if part of the secret information is leaked to the adversary. Recently, many identity-based encryption (IBE) schemes have been proposed in this context, almost all of which, however, are only proved CPA secure. As far as we know, the IBE scheme presented by Alwen et al. is the unique CCA secure and the most practical one in the standard model. Unfortunately, this scheme suffers from an undesirable shortcoming that the leakage parameter λ and the message length m are subject to λ+m ≤ logp-ω(logκ), where κ is the security parameter and p is the prime order of the underlying group. To overcome this drawback, we designed a new IBE scheme based on Gentry's IBE in this paper, which is λ-leakage resilient CCA2 secure in the standard model where λ ≤ logp-ω(logκ). In contrast, the leakage parameter λ in our proposal is independent of the size of the message space. Moreover, our scheme is quite practical and almost as efficient as the original scheme. To the best of our knowledge, it is the first practical leakage-resilient fully CCA2 secure IBE scheme in the standard model, tolerating up to (logp-ω(logκ))-bit leakage of the private key, the leakage parameter of which is independent of the message length.

Original languageEnglish
Title of host publicationPairing-Based Cryptography – Pairing 2013
Subtitle of host publication6th International Conference Beijing, China, November 22-24, 2013 Revised Selected Papers
EditorsZhenfu Cao, Fangguo Zhang
Place of PublicationCham Switzerland
PublisherSpringer
Pages149-167
Number of pages19
ISBN (Electronic)9783319048734
ISBN (Print)9783319048727
DOIs
Publication statusPublished - 2014
Externally publishedYes
EventInternational Conference on Pairing-based Cryptography 2013 - Beijing, China
Duration: 22 Nov 201324 Nov 2013
Conference number: 6
http://www.ieccr.net/2013/Pairing2013/index.html

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume8365
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Pairing-based Cryptography 2013
Abbreviated titlePairing 2013
CountryChina
CityBeijing
Period22/11/1324/11/13
Internet address

Keywords

  • Bounded Memory Leakage
  • Chosen Ciphertext Security
  • Identity-Based Encryption
  • Leakage-Resilient

Cite this

Sun, S-F., Gu, D., & Liu, S. (2014). Efficient leakage-resilient identity-based encryption with CCA security. In Z. Cao, & F. Zhang (Eds.), Pairing-Based Cryptography – Pairing 2013: 6th International Conference Beijing, China, November 22-24, 2013 Revised Selected Papers (pp. 149-167). (Lecture Notes in Computer Science; Vol. 8365). Cham Switzerland: Springer. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) https://doi.org/10.1007/978-3-319-04873-4_9
Sun, Shi-Feng ; Gu, Dawu ; Liu, Shengli. / Efficient leakage-resilient identity-based encryption with CCA security. Pairing-Based Cryptography – Pairing 2013: 6th International Conference Beijing, China, November 22-24, 2013 Revised Selected Papers. editor / Zhenfu Cao ; Fangguo Zhang. Cham Switzerland : Springer, 2014. pp. 149-167 (Lecture Notes in Computer Science). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9dea9cd9aef842288d01de9ec2077cfa,
title = "Efficient leakage-resilient identity-based encryption with CCA security",
abstract = "Due to the proliferation of side-channel attacks, lots of efforts have been made to construct cryptographic systems that are still secure even if part of the secret information is leaked to the adversary. Recently, many identity-based encryption (IBE) schemes have been proposed in this context, almost all of which, however, are only proved CPA secure. As far as we know, the IBE scheme presented by Alwen et al. is the unique CCA secure and the most practical one in the standard model. Unfortunately, this scheme suffers from an undesirable shortcoming that the leakage parameter λ and the message length m are subject to λ+m ≤ logp-ω(logκ), where κ is the security parameter and p is the prime order of the underlying group. To overcome this drawback, we designed a new IBE scheme based on Gentry's IBE in this paper, which is λ-leakage resilient CCA2 secure in the standard model where λ ≤ logp-ω(logκ). In contrast, the leakage parameter λ in our proposal is independent of the size of the message space. Moreover, our scheme is quite practical and almost as efficient as the original scheme. To the best of our knowledge, it is the first practical leakage-resilient fully CCA2 secure IBE scheme in the standard model, tolerating up to (logp-ω(logκ))-bit leakage of the private key, the leakage parameter of which is independent of the message length.",
keywords = "Bounded Memory Leakage, Chosen Ciphertext Security, Identity-Based Encryption, Leakage-Resilient",
author = "Shi-Feng Sun and Dawu Gu and Shengli Liu",
year = "2014",
doi = "10.1007/978-3-319-04873-4_9",
language = "English",
isbn = "9783319048727",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "149--167",
editor = "Zhenfu Cao and Fangguo Zhang",
booktitle = "Pairing-Based Cryptography – Pairing 2013",

}

Sun, S-F, Gu, D & Liu, S 2014, Efficient leakage-resilient identity-based encryption with CCA security. in Z Cao & F Zhang (eds), Pairing-Based Cryptography – Pairing 2013: 6th International Conference Beijing, China, November 22-24, 2013 Revised Selected Papers. Lecture Notes in Computer Science, vol. 8365, Springer, Cham Switzerland, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 149-167, International Conference on Pairing-based Cryptography 2013, Beijing, China, 22/11/13. https://doi.org/10.1007/978-3-319-04873-4_9

Efficient leakage-resilient identity-based encryption with CCA security. / Sun, Shi-Feng; Gu, Dawu; Liu, Shengli.

Pairing-Based Cryptography – Pairing 2013: 6th International Conference Beijing, China, November 22-24, 2013 Revised Selected Papers. ed. / Zhenfu Cao; Fangguo Zhang. Cham Switzerland : Springer, 2014. p. 149-167 (Lecture Notes in Computer Science; Vol. 8365).

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

TY - GEN

T1 - Efficient leakage-resilient identity-based encryption with CCA security

AU - Sun, Shi-Feng

AU - Gu, Dawu

AU - Liu, Shengli

PY - 2014

Y1 - 2014

N2 - Due to the proliferation of side-channel attacks, lots of efforts have been made to construct cryptographic systems that are still secure even if part of the secret information is leaked to the adversary. Recently, many identity-based encryption (IBE) schemes have been proposed in this context, almost all of which, however, are only proved CPA secure. As far as we know, the IBE scheme presented by Alwen et al. is the unique CCA secure and the most practical one in the standard model. Unfortunately, this scheme suffers from an undesirable shortcoming that the leakage parameter λ and the message length m are subject to λ+m ≤ logp-ω(logκ), where κ is the security parameter and p is the prime order of the underlying group. To overcome this drawback, we designed a new IBE scheme based on Gentry's IBE in this paper, which is λ-leakage resilient CCA2 secure in the standard model where λ ≤ logp-ω(logκ). In contrast, the leakage parameter λ in our proposal is independent of the size of the message space. Moreover, our scheme is quite practical and almost as efficient as the original scheme. To the best of our knowledge, it is the first practical leakage-resilient fully CCA2 secure IBE scheme in the standard model, tolerating up to (logp-ω(logκ))-bit leakage of the private key, the leakage parameter of which is independent of the message length.

AB - Due to the proliferation of side-channel attacks, lots of efforts have been made to construct cryptographic systems that are still secure even if part of the secret information is leaked to the adversary. Recently, many identity-based encryption (IBE) schemes have been proposed in this context, almost all of which, however, are only proved CPA secure. As far as we know, the IBE scheme presented by Alwen et al. is the unique CCA secure and the most practical one in the standard model. Unfortunately, this scheme suffers from an undesirable shortcoming that the leakage parameter λ and the message length m are subject to λ+m ≤ logp-ω(logκ), where κ is the security parameter and p is the prime order of the underlying group. To overcome this drawback, we designed a new IBE scheme based on Gentry's IBE in this paper, which is λ-leakage resilient CCA2 secure in the standard model where λ ≤ logp-ω(logκ). In contrast, the leakage parameter λ in our proposal is independent of the size of the message space. Moreover, our scheme is quite practical and almost as efficient as the original scheme. To the best of our knowledge, it is the first practical leakage-resilient fully CCA2 secure IBE scheme in the standard model, tolerating up to (logp-ω(logκ))-bit leakage of the private key, the leakage parameter of which is independent of the message length.

KW - Bounded Memory Leakage

KW - Chosen Ciphertext Security

KW - Identity-Based Encryption

KW - Leakage-Resilient

UR - http://www.scopus.com/inward/record.url?scp=84894463172&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-04873-4_9

DO - 10.1007/978-3-319-04873-4_9

M3 - Conference Paper

SN - 9783319048727

T3 - Lecture Notes in Computer Science

SP - 149

EP - 167

BT - Pairing-Based Cryptography – Pairing 2013

A2 - Cao, Zhenfu

A2 - Zhang, Fangguo

PB - Springer

CY - Cham Switzerland

ER -

Sun S-F, Gu D, Liu S. Efficient leakage-resilient identity-based encryption with CCA security. In Cao Z, Zhang F, editors, Pairing-Based Cryptography – Pairing 2013: 6th International Conference Beijing, China, November 22-24, 2013 Revised Selected Papers. Cham Switzerland: Springer. 2014. p. 149-167. (Lecture Notes in Computer Science). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-04873-4_9