Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions

摘要: This paper presents efficient structure-preserving signature schemes based on assumptions as simple Decisional-Linear. We first give two general frameworks for constructing fully secure from weaker building blocks such variations of one-time signatures and random-message signatures. They can be seen refinements the Even-Goldreich-Micali framework, preserve many desirable properties underlying constant size structure preservation. then instantiate them (i.e., not q-type) over symmetric asymmetric bilinear groups. The resulting are yield constant-size consisting 11 to 17 group elements, which compares favorably existing relying q-type their security.