File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Functional encryption for computational hiding in prime order groups via pair encodings

TitleFunctional encryption for computational hiding in prime order groups via pair encodings
Authors
KeywordsFunctional encryption
Pair encodings
Prime order groups
Computational hiding
Issue Date2018
Citation
Designs, Codes, and Cryptography, 2018, v. 86, n. 1, p. 97-120 How to Cite?
Abstract© 2017, Springer Science+Business Media New York. Lewko and Waters introduced the computational hiding technique in Crypto’12. In their technique, two computational assumptions that achieve selective and co-selective security proofs lead to adaptive security of an encryption scheme. Later, pair encoding framework was introduced by Attrapadung in Eurocrypt’14. The pair encoding framework generalises the computational hiding technique for functional encryption (FE). It has been used to achieve a number of new FE schemes such as FE for regular languages and unbounded attribute based encryption allowing multi-use of attributes. Nevertheless, the generalised construction of Attrapadung’s pair encoding for those schemes is adaptively secure only in composite order groups, which leads to efficiency loss. It remains a challenging task to explore constructions in prime order groups for gaining efficiency improvement, which leaves the research gap in the existing literature. In this work, we aim to address this drawback by proposing a new generalised construction for pair encodings in prime order groups. Our construction will lead to a number of new FE schemes in prime order groups, which have been previously introduced only in composite order groups by Attrapadung.
Persistent Identifierhttp://hdl.handle.net/10722/280617
ISSN
2023 Impact Factor: 1.4
2023 SCImago Journal Rankings: 1.142
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorKim, Jongkil-
dc.contributor.authorSusilo, Willy-
dc.contributor.authorGuo, Fuchun-
dc.contributor.authorAu, Man Ho-
dc.date.accessioned2020-02-17T14:34:29Z-
dc.date.available2020-02-17T14:34:29Z-
dc.date.issued2018-
dc.identifier.citationDesigns, Codes, and Cryptography, 2018, v. 86, n. 1, p. 97-120-
dc.identifier.issn0925-1022-
dc.identifier.urihttp://hdl.handle.net/10722/280617-
dc.description.abstract© 2017, Springer Science+Business Media New York. Lewko and Waters introduced the computational hiding technique in Crypto’12. In their technique, two computational assumptions that achieve selective and co-selective security proofs lead to adaptive security of an encryption scheme. Later, pair encoding framework was introduced by Attrapadung in Eurocrypt’14. The pair encoding framework generalises the computational hiding technique for functional encryption (FE). It has been used to achieve a number of new FE schemes such as FE for regular languages and unbounded attribute based encryption allowing multi-use of attributes. Nevertheless, the generalised construction of Attrapadung’s pair encoding for those schemes is adaptively secure only in composite order groups, which leads to efficiency loss. It remains a challenging task to explore constructions in prime order groups for gaining efficiency improvement, which leaves the research gap in the existing literature. In this work, we aim to address this drawback by proposing a new generalised construction for pair encodings in prime order groups. Our construction will lead to a number of new FE schemes in prime order groups, which have been previously introduced only in composite order groups by Attrapadung.-
dc.languageeng-
dc.relation.ispartofDesigns, Codes, and Cryptography-
dc.subjectFunctional encryption-
dc.subjectPair encodings-
dc.subjectPrime order groups-
dc.subjectComputational hiding-
dc.titleFunctional encryption for computational hiding in prime order groups via pair encodings-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/s10623-017-0327-7-
dc.identifier.scopuseid_2-s2.0-85010738948-
dc.identifier.volume86-
dc.identifier.issue1-
dc.identifier.spage97-
dc.identifier.epage120-
dc.identifier.eissn1573-7586-
dc.identifier.isiWOS:000419489000005-
dc.identifier.issnl0925-1022-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats