Cryptology ePrint Archive: Report 2020/1505

Binary Tree Based Forward Secure Signature Scheme in the Random Oracle Model

Mariusz Jurkiewicz

Abstract: In this paper we construct and consider a signature scheme with evolving secret key, where there is used Type 3 pairing. The idea is based on some properties of binary trees, with a number of leaves being the same as a number of time periods in the scheme. This lets us to gain such conditions, that allows to prove the forward-security of the considered scheme in the random oracle model. The proof is conducted by reducing the security of the scheme to the difficulty of solving a certain counterpart of the Weak $\ell$-th Bilinear Diffie-Hellman Inversion problem. In addition to that, we construct an interactive signature scheme with evolving private key and justify that it is forward-secure blind scheme.

Category / Keywords: public-key cryptography / forward security, bilinear pairing of Type 3, random-oracle model, bilinear DH inversion problem, blindness