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

Post-quantum Fujisaki-Okamoto Transformation for Anonymous Identity-Based Encryption

Tsuchiya Yui, Toi Tomita, Junji Shikata

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-981-95-8034-7_9

Related papers

Applying Fujisaki-Okamoto to Identity-Based Encryption

Peng Yang, Takashi Kitagawa, Goichiro Hanaoka +3 more

Lecture notes in computer science•Jan 1, 2006•27 citations

Security Tightness Evaluation of Fujisaki-Okamoto Conversion in Identity Based Encryption

Peng Yang, Takashi Kitagawa, Goichiro Hanaoka +4 more

IEEE International Symposium on Information Theory (ISIT)•Nov 28, 2006•0 citations

Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms

Ehsan Ebrahimi, Dominique Unruh

Lecture notes in computer science•Jan 1, 2016•122 citations

Anonymous, Robust Post-quantum Public Key Encryption

Paul Grubbs, Varun Maram, Kenneth G. Paterson

Lecture notes in computer science•Jan 1, 2022•38 citations

Revisiting Anonymity in Post-quantum Public Key Encryption

Yao Cheng, Xianhui Lu, Ziyi Li +1 more

Lecture notes in computer science•Jan 1, 2024•0 citations

On the Anonymity of Multi-Receiver Identity-Based Encryption Based on Fujisaki–Okamoto Transformation

Yi‐Fan Tseng, Chun‐I Fan, Cheng-Wei Sung

In 2010, Fan et al. first introduced the concept of anonymous multi-receiver identity-based encryption (AMRIBE). They used the concept of Fujisaki–Okamoto transformation (F.O. transformation) to support their proof in random oracle models. Recently, many works on this topic have been proposed. Most of them adopted Fujisaki–Okamoto transformation to achieve the indistinguishability of encryptions under multi-ID, chosen-ciphertext attacks (IND-MID-CCA) security. However, we find out that these schemes do not gain anonymity against insider attacks. In this manuscript, we use a sequence of games to prove that any AMRIBE scheme will fail to gain anonymity under chosen-ciphertext attacks and chosen-plaintext attacks if the IND-MID-CCA security is proven using Fujisaki–Okamoto transformation.

International Journal of Foundations of Computer Science•Jun 1, 2019•0 citations
In 2010, Fan et al. first introduced the concept of anonymous multi-receiver identity-based encryption (AMRIBE). They used the concept of Fujisaki–Okamoto transformation (F.O. transformation) to support their proof in random oracle models. Recently, many works on this topic have been proposed. Most of them adopted Fujisaki–Okamoto transformation to achieve the indistinguishability of encryptions under multi-ID, chosen-ciphertext attacks (IND-MID-CCA) security. However, we find out that these schemes do not gain anonymity against insider attacks. In this manuscript, we use a sequence of games to prove that any AMRIBE scheme will fail to gain anonymity under chosen-ciphertext attacks and chosen-plaintext attacks if the IND-MID-CCA security is proven using Fujisaki–Okamoto transformation.