Revocable identity‐based matchmaking encryption in the standard model
Abstract Identity‐based Matchmaking Encryption (IB‐ME) is an extension notion of matchmaking encryption (CRYPTO 2019), where a sender and a receiver can specify an access policy for the other party. In IB‐ME, data encryption is performed by not only a receiver identity but also a sender's encry...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-07-01
|
| Series: | IET Information Security |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/ise2.12116 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832558523886600192 |
|---|---|
| author | Zhe Jiang Xiwen Wang Kai Zhang Junqing Gong Jie Chen Haifeng Qian |
| author_facet | Zhe Jiang Xiwen Wang Kai Zhang Junqing Gong Jie Chen Haifeng Qian |
| author_sort | Zhe Jiang |
| collection | DOAJ |
| description | Abstract Identity‐based Matchmaking Encryption (IB‐ME) is an extension notion of matchmaking encryption (CRYPTO 2019), where a sender and a receiver can specify an access policy for the other party. In IB‐ME, data encryption is performed by not only a receiver identity but also a sender's encryption key. Nevertheless, previous IB‐ME schemes have not considered the problem of efficient revocation. Hence, the authors introduce a new notion of revocable IB‐ME (RIB‐ME) and formalise the syntax and security model of RIB‐ME. In particular, the authors give an effective and simple construction of RIB‐ME in the standard model, whose security is reduced to the hardness of decisional bilinear Diffie—Hellman problem and computational Diffie—Hellman problem. In addition, the authors show two extensions of our RIB‐ME scheme to consider chosen‐ciphertext security and forward privacy. |
| format | Article |
| id | doaj-art-4d49c706c28949c18ec851557640e7fa |
| institution | Kabale University |
| issn | 1751-8709 1751-8717 |
| language | English |
| publishDate | 2023-07-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Information Security |
| spelling | doaj-art-4d49c706c28949c18ec851557640e7fa2025-02-03T01:32:08ZengWileyIET Information Security1751-87091751-87172023-07-0117456758110.1049/ise2.12116Revocable identity‐based matchmaking encryption in the standard modelZhe Jiang0Xiwen Wang1Kai Zhang2Junqing Gong3Jie Chen4Haifeng Qian5College of Computer Science and Technology Shanghai University of Electric Power Shanghai ChinaCollege of Computer Science and Technology Shanghai University of Electric Power Shanghai ChinaCollege of Computer Science and Technology Shanghai University of Electric Power Shanghai ChinaSoftware Engineering Institute East China Normal University Shanghai ChinaSoftware Engineering Institute East China Normal University Shanghai ChinaSoftware Engineering Institute East China Normal University Shanghai ChinaAbstract Identity‐based Matchmaking Encryption (IB‐ME) is an extension notion of matchmaking encryption (CRYPTO 2019), where a sender and a receiver can specify an access policy for the other party. In IB‐ME, data encryption is performed by not only a receiver identity but also a sender's encryption key. Nevertheless, previous IB‐ME schemes have not considered the problem of efficient revocation. Hence, the authors introduce a new notion of revocable IB‐ME (RIB‐ME) and formalise the syntax and security model of RIB‐ME. In particular, the authors give an effective and simple construction of RIB‐ME in the standard model, whose security is reduced to the hardness of decisional bilinear Diffie—Hellman problem and computational Diffie—Hellman problem. In addition, the authors show two extensions of our RIB‐ME scheme to consider chosen‐ciphertext security and forward privacy.https://doi.org/10.1049/ise2.12116cryptographypublic key cryptography |
| spellingShingle | Zhe Jiang Xiwen Wang Kai Zhang Junqing Gong Jie Chen Haifeng Qian Revocable identity‐based matchmaking encryption in the standard model IET Information Security cryptography public key cryptography |
| title | Revocable identity‐based matchmaking encryption in the standard model |
| title_full | Revocable identity‐based matchmaking encryption in the standard model |
| title_fullStr | Revocable identity‐based matchmaking encryption in the standard model |
| title_full_unstemmed | Revocable identity‐based matchmaking encryption in the standard model |
| title_short | Revocable identity‐based matchmaking encryption in the standard model |
| title_sort | revocable identity based matchmaking encryption in the standard model |
| topic | cryptography public key cryptography |
| url | https://doi.org/10.1049/ise2.12116 |
| work_keys_str_mv | AT zhejiang revocableidentitybasedmatchmakingencryptioninthestandardmodel AT xiwenwang revocableidentitybasedmatchmakingencryptioninthestandardmodel AT kaizhang revocableidentitybasedmatchmakingencryptioninthestandardmodel AT junqinggong revocableidentitybasedmatchmakingencryptioninthestandardmodel AT jiechen revocableidentitybasedmatchmakingencryptioninthestandardmodel AT haifengqian revocableidentitybasedmatchmakingencryptioninthestandardmodel |