Complete robustness in identity-based encryption

Hui Cui; Yi Mu; Man Ho Allen Au

doi:10.1007/978-3-319-12475-9_26

Complete robustness in identity-based encryption

Hui Cui
, Yi Mu
, Man Ho Allen Au

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

1 Citation (Scopus)

Abstract

Complete robustness (CROB) was proposed to guarantee that for a public key encryption scheme, decryption attempts will fail with high probability if the wrong decryption key is used to decrypt a ciphertext, even if the keys are maliciously generated by the adversary. In this paper, we extend the notion of complete robustness to the identity-based setting. We firstly formalize the CROB for identity-based encryption, and present a generic construction achieving CROB from an arbitrary identity-based encryption scheme. After that, we investigate whether there exist some kind of relations between CROB and relatedkey attack (RKA) security for the case of identity-based encryption. We conclude that these two notions (CROB and RKA security) are separable for identity-based encryption, but with a slight modification to our generic construction, an identity-based encryption scheme offering complete robustness with security against related-key attacks can be constructed from any identity-based encryption scheme.

Original language	English
Title of host publication	Provable Security - 8th International Conference, ProvSec 2014, Proceedings
Editors	Sherman S.M. Chow, Joseph K. Liu, Lucas C.K. Hui, Siu Ming Yiu
Publisher	Springer-Verlag London Ltd.
Pages	342-349
Number of pages	8
ISBN (Electronic)	9783319124742
DOIs	https://doi.org/10.1007/978-3-319-12475-9_26
Publication status	Published - 2014
Externally published	Yes
Event	International Conference on Provable Security 2014 - Hong Kong, China Duration: 9 Oct 2014 → 10 Oct 2014 https://link.springer.com/book/10.1007/978-3-319-12475-9

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8782
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	International Conference on Provable Security 2014
Abbreviated title	ProvSec 2014
Country/Territory	China
City	Hong Kong
Period	9/10/14 → 10/10/14
Internet address	https://link.springer.com/book/10.1007/978-3-319-12475-9

Keywords

CROB
Identity-based encryption
RKA security

Access to Document

10.1007/978-3-319-12475-9_26

Cite this

Cui, H., Mu, Y., & Au, M. H. A. (2014). Complete robustness in identity-based encryption. In S. S. M. Chow, J. K. Liu, L. C. K. Hui, & S. M. Yiu (Eds.), Provable Security - 8th International Conference, ProvSec 2014, Proceedings (pp. 342-349). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8782). Springer-Verlag London Ltd.. https://doi.org/10.1007/978-3-319-12475-9_26

Cui, Hui ; Mu, Yi ; Au, Man Ho Allen. / Complete robustness in identity-based encryption. Provable Security - 8th International Conference, ProvSec 2014, Proceedings. editor / Sherman S.M. Chow ; Joseph K. Liu ; Lucas C.K. Hui ; Siu Ming Yiu. Springer-Verlag London Ltd., 2014. pp. 342-349 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{89511c3fb67a47909d5a96ff10e69aa6,

title = "Complete robustness in identity-based encryption",

abstract = "Complete robustness (CROB) was proposed to guarantee that for a public key encryption scheme, decryption attempts will fail with high probability if the wrong decryption key is used to decrypt a ciphertext, even if the keys are maliciously generated by the adversary. In this paper, we extend the notion of complete robustness to the identity-based setting. We firstly formalize the CROB for identity-based encryption, and present a generic construction achieving CROB from an arbitrary identity-based encryption scheme. After that, we investigate whether there exist some kind of relations between CROB and relatedkey attack (RKA) security for the case of identity-based encryption. We conclude that these two notions (CROB and RKA security) are separable for identity-based encryption, but with a slight modification to our generic construction, an identity-based encryption scheme offering complete robustness with security against related-key attacks can be constructed from any identity-based encryption scheme.",

keywords = "CROB, Identity-based encryption, RKA security",

author = "Hui Cui and Yi Mu and Au, \{Man Ho Allen\}",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2014.; International Conference on Provable Security 2014, ProvSec 2014 ; Conference date: 09-10-2014 Through 10-10-2014",

year = "2014",

doi = "10.1007/978-3-319-12475-9\_26",

language = "English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag London Ltd.",

pages = "342--349",

editor = "Chow, \{Sherman S.M.\} and Liu, \{Joseph K.\} and Hui, \{Lucas C.K.\} and Yiu, \{Siu Ming\}",

booktitle = "Provable Security - 8th International Conference, ProvSec 2014, Proceedings",

address = "Germany",

url = "https://link.springer.com/book/10.1007/978-3-319-12475-9",

}

Cui, H, Mu, Y & Au, MHA 2014, Complete robustness in identity-based encryption. in SSM Chow, JK Liu, LCK Hui & SM Yiu (eds), Provable Security - 8th International Conference, ProvSec 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8782, Springer-Verlag London Ltd., pp. 342-349, International Conference on Provable Security 2014, Hong Kong, China, 9/10/14. https://doi.org/10.1007/978-3-319-12475-9_26

Complete robustness in identity-based encryption. / Cui, Hui; Mu, Yi; Au, Man Ho Allen.
Provable Security - 8th International Conference, ProvSec 2014, Proceedings. ed. / Sherman S.M. Chow; Joseph K. Liu; Lucas C.K. Hui; Siu Ming Yiu. Springer-Verlag London Ltd., 2014. p. 342-349 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8782).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Complete robustness in identity-based encryption

AU - Cui, Hui

AU - Mu, Yi

AU - Au, Man Ho Allen

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2014.

PY - 2014

Y1 - 2014

N2 - Complete robustness (CROB) was proposed to guarantee that for a public key encryption scheme, decryption attempts will fail with high probability if the wrong decryption key is used to decrypt a ciphertext, even if the keys are maliciously generated by the adversary. In this paper, we extend the notion of complete robustness to the identity-based setting. We firstly formalize the CROB for identity-based encryption, and present a generic construction achieving CROB from an arbitrary identity-based encryption scheme. After that, we investigate whether there exist some kind of relations between CROB and relatedkey attack (RKA) security for the case of identity-based encryption. We conclude that these two notions (CROB and RKA security) are separable for identity-based encryption, but with a slight modification to our generic construction, an identity-based encryption scheme offering complete robustness with security against related-key attacks can be constructed from any identity-based encryption scheme.

AB - Complete robustness (CROB) was proposed to guarantee that for a public key encryption scheme, decryption attempts will fail with high probability if the wrong decryption key is used to decrypt a ciphertext, even if the keys are maliciously generated by the adversary. In this paper, we extend the notion of complete robustness to the identity-based setting. We firstly formalize the CROB for identity-based encryption, and present a generic construction achieving CROB from an arbitrary identity-based encryption scheme. After that, we investigate whether there exist some kind of relations between CROB and relatedkey attack (RKA) security for the case of identity-based encryption. We conclude that these two notions (CROB and RKA security) are separable for identity-based encryption, but with a slight modification to our generic construction, an identity-based encryption scheme offering complete robustness with security against related-key attacks can be constructed from any identity-based encryption scheme.

KW - CROB

KW - Identity-based encryption

KW - RKA security

UR - https://www.scopus.com/pages/publications/84910007714

U2 - 10.1007/978-3-319-12475-9_26

DO - 10.1007/978-3-319-12475-9_26

M3 - Conference Paper

AN - SCOPUS:84910007714

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 342

EP - 349

BT - Provable Security - 8th International Conference, ProvSec 2014, Proceedings

A2 - Chow, Sherman S.M.

A2 - Liu, Joseph K.

A2 - Hui, Lucas C.K.

A2 - Yiu, Siu Ming

PB - Springer-Verlag London Ltd.

T2 - International Conference on Provable Security 2014

Y2 - 9 October 2014 through 10 October 2014

ER -

Cui H, Mu Y, Au MHA. Complete robustness in identity-based encryption. In Chow SSM, Liu JK, Hui LCK, Yiu SM, editors, Provable Security - 8th International Conference, ProvSec 2014, Proceedings. Springer-Verlag London Ltd. 2014. p. 342-349. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-12475-9_26

Complete robustness in identity-based encryption

Abstract

Publication series

Other

Keywords

Access to Document

Other files and links

Cite this