@ARTICLE{Jurkiewicz_Mariusz_Binary_2021,
 author={Jurkiewicz, Mariusz},
 volume={vol. 67},
 number={No 4},
 journal={International Journal of Electronics and Telecommunications},
 pages={717-726},
 howpublished={online},
 year={2021},
 publisher={Polish Academy of Sciences Committee of Electronics and Telecommunications},
 abstract={In this paper we construct and consider a new group-based digital signature scheme with evolving secret key, which is built using a bilinear map. This map is an asymmetric pairing of Type 3, and although, for the reason of this paper, it is treated in a completely abstract fashion it ought to be viewed as being actually defined over E(Fqn)[p] × E(Fqnk )[p] → Fqnk [p]. The crucial element of the scheme is the key updater algorithm. With the adoption of pairings and binary trees where a number of leaves is the same as a number of time periods, we are assured that an updated secret key can not be used to recover any of its predecessors. This, in consequence, means that the scheme is forward-secure. To formally justify this assertion, we conduct analysis in fu-cma security model by reducing the security of the scheme to the computational hardness of solving the Weak ℓ-th Bilinear Diffie-Hellman Inversion problem type. We define this problem and explain why it can be treated as a source of security for cryptographic schemes. As for the reduction itself, in general case, it could be possible to make only in the random oracle model.},
 type={Article},
 title={Binary Tree Based Forward Secure Signature Scheme in the Random Oracle Model},
 URL={http://ochroma.man.poznan.pl/Content/121911/PDF-MASTER/99_3471_Jurkiewicz_skl.pdf},
 doi={10.24425/ijet.2021.137868},
 keywords={forward secure digital signature scheme, bilinear pairing of Type 3, random-oracle model, bilinear Diffie-Hellman inversion problem},
}