TY - JOUR
T1 - Extended Galbraith’s test on the anonymity of IBE schemes from higher residuosity
AU - Zhao, Xiaopeng
AU - Cao, Zhenfu
AU - Dong, Xiaolei
AU - Shao, Jun
N1 - Publisher Copyright:
© 2020, Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2021/2
Y1 - 2021/2
N2 - At PKC 2019, Clear and McGoldrick presented the first identity-based encryption (IBE) scheme that is group homomorphic for addition modulo a poly-sized prime e. Assuming that deciding solvability of a special system of multivariate polynomial equations is hard, they proved that their scheme for e> 2 is anonymous. In this paper, we review the classical Galbraith’s test on the anonymity of the first pairing-free IBE scheme due to Cocks. With the eye of the reciprocity law for Fq[x] , we can have a profound understanding of the test and naturally extend it to give a practical attack on the anonymity of the Clear–McGoldrick IBE scheme. Furthermore, we believe that our technique plays a crucial role in anonymizing IBE schemes from higher residuosity.
AB - At PKC 2019, Clear and McGoldrick presented the first identity-based encryption (IBE) scheme that is group homomorphic for addition modulo a poly-sized prime e. Assuming that deciding solvability of a special system of multivariate polynomial equations is hard, they proved that their scheme for e> 2 is anonymous. In this paper, we review the classical Galbraith’s test on the anonymity of the first pairing-free IBE scheme due to Cocks. With the eye of the reciprocity law for Fq[x] , we can have a profound understanding of the test and naturally extend it to give a practical attack on the anonymity of the Clear–McGoldrick IBE scheme. Furthermore, we believe that our technique plays a crucial role in anonymizing IBE schemes from higher residuosity.
KW - Anonymity
KW - Galbraith’s test
KW - Identity-based encryption
KW - Reciprocity law for F[x]
UR - https://www.scopus.com/pages/publications/85095788482
U2 - 10.1007/s10623-020-00816-w
DO - 10.1007/s10623-020-00816-w
M3 - 文章
AN - SCOPUS:85095788482
SN - 0925-1022
VL - 89
SP - 241
EP - 253
JO - Designs, Codes, and Cryptography
JF - Designs, Codes, and Cryptography
IS - 2
ER -