Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/67131
Title: Leakage-resilient functional encryption via pair encodings
Authors: Yu, ZX 
Au, MH 
Xu, QL
Yang, RP
Han, JG
Issue Date: 2016
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2016, v. 9722, p. 443-460 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: Leakage-resilient cryptography is proposed to address physical attacks on real world crypto-systems. Dual system encryption methodology is developed to guide design and analysis of various functional encryption schemes (FEs) with adaptive security. Observing the compatibility of dual system methodology and leakage-resilience, Lewko et al. present constructions of a number of strong leakage-resilient functional encryptions. In particular, they present fully secure identity-based encryption (IBE), hierarchical IBE (HIBE) and attribute-based encryption (ABE) satisfying the continual memory leakage (CML) model, one of the strongest models that allows continuous leakage on both user and master secret keys.
Inspired by the recent work from Attrapadung on pair encodings which greatly simplifies the design and analysis of FE, we propose a generic framework for constructing fully secure FEs in the CML model (LR-FEs). Specifically, our framework “compiles” predicate encodings into fully secure LR-FEs in a two-step process. Firstly, we propose a generic transformation of pair encoding schemes into their leakage-resilient forms. Next, we present another conversion that turns leakage-resilient pair encodings into fully secure LR-FEs. Our framework is highly compatible with Attrapadung’s, meaning that it is applicable to many existing pair encoding schemes.
The contribution of this paper is threefold. Firstly, our framework simplifies the design and analysis of LR-FEs into the design and analysis of predicate encodings. Secondly, our framework allows us to improve the security of some existing LR-FEs, such as LR-IBE with a tighter reduction. Thirdly, we discover new adaptively secure LR-FEs, including FE for regular languages, ABE for large universe and ABE with short ciphertext.
Description: 21st Australasian Conference on Information Security and Privacy (ACISP), Jul 4-6, 2016, Melbourne, Australia
URI: http://hdl.handle.net/10397/67131
ISBN: 978-3-319-40253-6
978-3-319-40252-9
ISSN: 0302-9743
EISSN: 1611-3349
DOI: 10.1007/978-3-319-40253-6_27
Appears in Collections:Conference Paper

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

SCOPUSTM   
Citations

4
Last Week
1
Last month
Citations as of Nov 30, 2018

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
Citations as of Dec 9, 2018

Page view(s)

46
Last Week
0
Last month
Citations as of Dec 3, 2018

Google ScholarTM

Check

Altmetric


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