Paper 2021/677

Generalized Galbraith's Test: Characterization and Applications to Anonymous IBE Schemes

Paul Cotan and George Teseleanu


The main approaches currently used to construct identity based encryption (IBE) schemes are based on bilinear mappings, quadratic residues and lattices. Among them, the most attractive approach is the one based on quadratic residues, due to the fact that the underlying security assumption is a well understood hard problem. The first such IBE scheme was constructed by Cocks and some of its deficiencies were addressed in subsequent works. In this paper, we will focus on two constructions that address the anonymity problem inherent in Cocks' scheme and we will tackle some of their incomplete theoretical claims. More precisely, we rigorously study Clear et. al and Zhao et. al's schemes and give accurate probabilities of successful decryption and identity detection in the non-anonymized version of the schemes. Also, in the case of Zhao \emph{et. al}'s scheme, we give a proper description of the underlying security assumptions.

Available format(s)
Public-key cryptography
Publication info
Published elsewhere. Minor revision.MDPI Mathematics
Galbraith's testanonymityidentity-based encryptionprobability distributionstatistical distance
Contact author(s)
george teseleanu @ yahoo com
paulcotan @ gmail com
2022-03-15: revised
2021-05-25: received
See all versions
Short URL
Creative Commons Attribution


      author = {Paul Cotan and George Teseleanu},
      title = {Generalized Galbraith's Test: Characterization and Applications to Anonymous IBE Schemes},
      howpublished = {Cryptology ePrint Archive, Paper 2021/677},
      year = {2021},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.