Please use this identifier to cite or link to this item:
Title: Functional encryption for computational hiding in prime order groups via pair encodings
Authors: Kim, J
Susilo, W
Guo, F
Au, MH 
Issue Date: 2018
Source: Designs, codes, and cryptography, 2018, v. 86, no. 1, p. 97-120
Abstract: 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.
Keywords: Computational hiding
Functional encryption
Pair encodings
Prime order groups
Publisher: Springer
Journal: Designs, codes, and cryptography 
ISSN: 0925-1022
DOI: 10.1007/s10623-017-0327-7
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Jul 11, 2020


Last Week
Last month
Citations as of Jul 12, 2020

Page view(s)

Last Week
Last month
Citations as of Jul 13, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.