Name
Abstract | ||
|---|---|---|
We propose a generic construction for fully secure decentralized multiauthority predicate encryption. In such multiauthority predicate encryption scheme, ciphertexts are associated with one or more predicates from various authorities and only if a user has a set of decryption keys that evaluates all predicates to true, the user is able to recover the message. In our decentralized system, anyone can create a new authority and issue decryption keys for their own predicates. We introduce the concept of a multi-authority admissible pair encoding scheme and, based on these encodings, we give a generic conversion algorithm that allows us to easily combine various predicate encryption schemes into a multi-authority predicate encryption variant. The resulting encryption schemes are proven fully secure under standard subgroup decision assumptions in the random oracle model. Finally, by instantiating several concrete multi-authority admissible pair encoding schemes and applying our conversion algorithm, we are able to create a variety of novel multi-authority predicate encryption schemes. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s10623-019-00686-x | Designs, Codes and Cryptography |
Keywords | Field | DocType |
Generic construction, Multi-authority predicate encryption, Pair encoding, Pairing-based cryptography, 68P25, 94A60 | Discrete mathematics,Decentralised system,Pairing-based cryptography,Random oracle,Encryption,Theoretical computer science,If and only if,Predicate (grammar),Predicate encryption,Mathematics,Encoding (memory) | Journal |
Volume | Issue | ISSN |
88 | 2 | 0925-1022 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tim van de Kamp | 1 | 1 | 1.07 |
| Andreas Peter | 2 | 233 | 20.57 |
| Willem Jonker | 3 | 640 | 55.71 |