| Download | - View final version: Revocable policy-based chameleon hash using lattices (PDF, 4.6 MiB)
|
|---|
| DOI | Resolve DOI: https://doi.org/10.1515/jmc-2023-0012 |
|---|
| Author | Search for: Klamti, Jean Belo1; Search for: Hasan, Mohammed Anwarul |
|---|
| Affiliation | - National Research Council of Canada. Digital Technologies
|
|---|
| Format | Text, Article |
|---|
| Subject | lattice-based cryptography; hash function; chameleon hash function; attribute-based encryption |
|---|
| Abstract | A chameleon hash function is a type of hash function that involves a trapdoor to help find collisions, i.e., it allows the rewriting of a message without modifying the hash. For some applications, it is important to have the feature of revoking the rewriting privilege of the trapdoor holder. In this paper, using lattice-based hard problems that are considered quantum-safe, we first introduce a lattice-based chameleon hash with an ephemeral trapdoor (CHET) and then a revocable attribute-based encryption (RABE) scheme that is adaptively indistinguishable. We also give security analyses of our schemes and compare our RABE scheme to two relevant schemes proposed recently. Furthermore, we combine our CHET and RABE to design a new revocable policy-based chameleon hash. |
|---|
| Publication date | 2024-11-28 |
|---|
| Publisher | Walter de Gruyter |
|---|
| Licence | |
|---|
| In | |
|---|
| Language | English |
|---|
| Peer reviewed | Yes |
|---|
| Export citation | Export as RIS |
|---|
| Report a correction | Report a correction (opens in a new tab) |
|---|
| Record identifier | a586405b-8a5f-4a8c-960b-1ceb5b355aa9 |
|---|
| Record created | 2024-12-02 |
|---|
| Record modified | 2024-12-05 |
|---|
