forking
2.Branching characterized by successive forking into two approximately equal divisions.
3.Conceptually, the stipulation of a forking chain is ad hoc, and incompatible to our well-recognized feature checking operations.
4.In the random oracle model, using forking lemma proposed byPointcheval and Stern, breaking of the scheme is equivalent to solve discrete logarithm problem.
5.Leaves tufted; stipes 15-30 cm long, densely scaly at base, glabrous above; sterile lamina about 60 cm long and 20 cm wide, simply pinnate; pinnae numerous, alternate or subopposite, linear-lanceolate, the largest about 12 cm long and 1 cm wide, base cordate, apex acuminate, margin finely toothed; veins close, forking once or twice and forming areoles near the midrib; fertile lamina similar to sterile ones, but somewhat reduced, about 8 cm long and 0.4 cm wide, lower surface almost entirely covered with sporangia.
6.The theoretical result can be viewed as an extension of the Forking Lemma due to Pointcheval and Stern for ID-based signature schemes, and can help to understand and simplify the security proofs of previous work such as Cha-Cheon’s scheme, Hess’s scheme-1, Cheon-Kim-Yoon’s scheme, and so on.
