Compact hierarchical identity-based encryption based on a harder decisional problem

David Galindo

doi:10.1080/00207160.2014.912278

Compact hierarchical identity-based encryption based on a harder decisional problem

David Galindo^*

^*Corresponding author for this work

Computer Science

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

We generalize the decisional problem that was used to prove the security of a well-known hierarchical identity-based encryption scheme by Boneh, Boyen and Goh. We argue that our new problem is strictly harder than the original problem, and thus the security of the aforementioned cryptographic primitive is laid on even stronger foundations.

Original language	English
Pages (from-to)	463-472
Number of pages	10
Journal	International Journal of Computer Mathematics
Volume	92
Issue number	3
Early online date	9 May 2014
DOIs	https://doi.org/10.1080/00207160.2014.912278
Publication status	Published - 2015

Keywords

decisional assumptions
generic model
hard problems
hierarchical identity-based encryption
standard model

ASJC Scopus subject areas

Applied Mathematics
Computer Science Applications
Computational Theory and Mathematics

Access to Document

10.1080/00207160.2014.912278Licence: None: All rights reserved

https://www.tandfonline.com/doi/abs/10.1080/00207160.2014.912278Licence: None: All rights reserved

Cite this

@article{8607a01db6fd434fb088cc0e5b700f47,

title = "Compact hierarchical identity-based encryption based on a harder decisional problem",

abstract = "We generalize the decisional problem that was used to prove the security of a well-known hierarchical identity-based encryption scheme by Boneh, Boyen and Goh. We argue that our new problem is strictly harder than the original problem, and thus the security of the aforementioned cryptographic primitive is laid on even stronger foundations.",

keywords = "decisional assumptions, generic model, hard problems, hierarchical identity-based encryption, standard model",

author = "David Galindo",

year = "2015",

doi = "10.1080/00207160.2014.912278",

language = "English",

volume = "92",

pages = "463--472",

journal = "International Journal of Computer Mathematics",

issn = "0020-7160",

publisher = "Taylor & Francis",

number = "3",

}

TY - JOUR

T1 - Compact hierarchical identity-based encryption based on a harder decisional problem

AU - Galindo, David

PY - 2015

Y1 - 2015

N2 - We generalize the decisional problem that was used to prove the security of a well-known hierarchical identity-based encryption scheme by Boneh, Boyen and Goh. We argue that our new problem is strictly harder than the original problem, and thus the security of the aforementioned cryptographic primitive is laid on even stronger foundations.

AB - We generalize the decisional problem that was used to prove the security of a well-known hierarchical identity-based encryption scheme by Boneh, Boyen and Goh. We argue that our new problem is strictly harder than the original problem, and thus the security of the aforementioned cryptographic primitive is laid on even stronger foundations.

KW - decisional assumptions

KW - generic model

KW - hard problems

KW - hierarchical identity-based encryption

KW - standard model

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

U2 - 10.1080/00207160.2014.912278

DO - 10.1080/00207160.2014.912278

M3 - Article

AN - SCOPUS:84920684284

SN - 0020-7160

VL - 92

SP - 463

EP - 472

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

IS - 3

ER -

Compact hierarchical identity-based encryption based on a harder decisional problem

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this