Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Making the Identity-Based Diffie–Hellman Key Exchange Efficiently Revocable

Kohei Nakagawa, Atsushi Fujioka, 彰 永井, Junichi Tomida, Keita Xagawa, Kan Yasuda

Published Jan 1, 2023• 0 citations
Publisher
DOI
10.1007/978-3-031-44469-2_9

Related papers

Making the Diffie-Hellman Protocol Identity-Based

Dario Fiore, Rosario Gennaro

Lecture notes in computer science•Jan 1, 2010•50 citations

Signed Diffie-Hellman Key Exchange with Tight Security

Jiaxin Pan, Chen Qian, Magnus Ringerud

Lecture notes in computer science•Jan 1, 2021•12 citations

Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions

Emmanuel Bresson, Olivier Chevassut, David Pointcheval

Lecture notes in computer science•Jan 1, 2002•221 citations

Fully Robust Tree-Diffie-Hellman Group Key Exchange

Timo Brecher, Emmanuel Bresson, Mark Manulis

Lecture notes in computer science•Jan 1, 2009•20 citations

Quantum Diffie-Hellman Key Exchange.

Dirk Fischer

•Jan 1, 2021•1 citation

Revocable identity‐based matchmaking encryption in the standard model

Zhe Jiang, Xiwen Wang, Kai Zhang +3 more

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.

IET Information Security•May 9, 2023•21 citations
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.