Predicate signatures from pair encodings via dual system proof technique
Recently, Attrapadung (Eurocrypt 2014) proposed a generic framework for fully (adaptively) secure predicate encryption (PE) based on a new primitive, called pair encodings. The author shows that if the underlying pair encoding scheme is either perfectly secure or computationally (doubly-selectively)...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2019-10-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2017-0007 |
id |
doaj-37faecd15abe49febf2a76d6a252e6a9 |
---|---|
record_format |
Article |
spelling |
doaj-37faecd15abe49febf2a76d6a252e6a92021-09-06T19:40:45ZengDe GruyterJournal of Mathematical Cryptology1862-29761862-29842019-10-01133-419722810.1515/jmc-2017-0007Predicate signatures from pair encodings via dual system proof techniqueNandi Mridul0Pandit Tapas1Applied Statistics Unit, Indian Statistical Institute, Kolkata, IndiaDepartment of CSA, Indian Institute of Science, Bangalore, IndiaRecently, Attrapadung (Eurocrypt 2014) proposed a generic framework for fully (adaptively) secure predicate encryption (PE) based on a new primitive, called pair encodings. The author shows that if the underlying pair encoding scheme is either perfectly secure or computationally (doubly-selectively) secure, then the PE scheme will be fully secure. Although the pair encodings were solely introduced for PE, we show that these can also be used to construct predicate signatures, a signature analogue of PE. More precisely, we propose a generic construction of predicate signature (PS) from pair encoding schemes. Our construction provides unconditional signer privacy, and unforgeability in the adaptive model. Thereafter, we instantiate many PS schemes with new results, e.g., the first practical PS schemes for regular languages, the first attribute-based signature (ABS) scheme with constant-size signatures in the adaptive model, unbounded ABS with large universes in key-policy flavor, etc.https://doi.org/10.1515/jmc-2017-0007pair encodingspredicate signaturesperfect privacyadaptive unforgeability11t71 94a60 94a62 14g50 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Nandi Mridul Pandit Tapas |
spellingShingle |
Nandi Mridul Pandit Tapas Predicate signatures from pair encodings via dual system proof technique Journal of Mathematical Cryptology pair encodings predicate signatures perfect privacy adaptive unforgeability 11t71 94a60 94a62 14g50 |
author_facet |
Nandi Mridul Pandit Tapas |
author_sort |
Nandi Mridul |
title |
Predicate signatures from pair encodings via dual system proof technique |
title_short |
Predicate signatures from pair encodings via dual system proof technique |
title_full |
Predicate signatures from pair encodings via dual system proof technique |
title_fullStr |
Predicate signatures from pair encodings via dual system proof technique |
title_full_unstemmed |
Predicate signatures from pair encodings via dual system proof technique |
title_sort |
predicate signatures from pair encodings via dual system proof technique |
publisher |
De Gruyter |
series |
Journal of Mathematical Cryptology |
issn |
1862-2976 1862-2984 |
publishDate |
2019-10-01 |
description |
Recently, Attrapadung (Eurocrypt 2014) proposed a generic framework for fully (adaptively) secure predicate encryption (PE) based on a new primitive, called pair encodings.
The author shows that if the underlying pair encoding scheme is either perfectly secure or computationally (doubly-selectively) secure, then the PE scheme will be fully secure.
Although the pair encodings were solely introduced for PE, we show that these can also be used to construct predicate signatures, a signature analogue of PE.
More precisely, we propose a generic construction of predicate signature (PS) from pair encoding schemes.
Our construction provides unconditional signer privacy, and unforgeability in the adaptive model.
Thereafter, we instantiate many PS schemes with new results, e.g., the first practical PS schemes for regular languages, the first attribute-based signature (ABS) scheme with constant-size signatures in the adaptive model, unbounded ABS with large universes in key-policy flavor, etc. |
topic |
pair encodings predicate signatures perfect privacy adaptive unforgeability 11t71 94a60 94a62 14g50 |
url |
https://doi.org/10.1515/jmc-2017-0007 |
work_keys_str_mv |
AT nandimridul predicatesignaturesfrompairencodingsviadualsystemprooftechnique AT pandittapas predicatesignaturesfrompairencodingsviadualsystemprooftechnique |
_version_ |
1717767884316344320 |