We extend the techniques of Kiltz et al. (in ASIACRYPT 2010) and Galindo et al. (in SAC 2012) to construct two efficient leakage-resilient signature schemes. Our schemes based on Boneh-Lynn-Shacham (BLS) short signature and Waters signature schemes, respectively. Both of them are more efficient than Galindo et al.'s scheme, and can tolerate leakage of (1 - o(1))/2 of the secret key at every signature invocation. The security of the proposed schemes are proved in the generic bilinear group model (in our first scheme which is based on the BLS signature, a random oracle is needed for the proof). © 2014 Springer International Publishing.
CITATION STYLE
Tang, F., Li, H., Niu, Q., & Liang, B. (2014). Efficient leakage-resilient signature schemes in the generic bilinear group model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8434 LNCS, pp. 418–432). Springer Verlag. https://doi.org/10.1007/978-3-319-06320-1_31
Mendeley helps you to discover research relevant for your work.