This paper presents efficient structure-preserving signature schemes based on assumptions as simple as Decisional-Linear. We first give two general frameworks for constructing fully secure signature schemes from weaker building blocks such as variations of one-time signatures and random-message secure signatures. They can be seen as refinements of the Even-Goldreich-Micali framework, and preserve many desirable properties of the underlying schemes such as constant signature size and structure preservation. We then instantiate them based on simple (i.e., not q-type) assumptions over symmetric and asymmetric bilinear groups. The resulting schemes are structure-preserving and yield constant-size signatures consisting of 11 to 17 group elements, which compares favorably to existing schemes relying on q-type assumptions for their security. © International Association for Cryptologic Research 2012.
CITATION STYLE
Abe, M., Chase, M., David, B., Kohlweiss, M., Nishimaki, R., & Ohkubo, M. (2012). Constant-size structure-preserving signatures: Generic constructions and simple assumptions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7658 LNCS, pp. 4–24). https://doi.org/10.1007/978-3-642-34961-4_3
Mendeley helps you to discover research relevant for your work.