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

被引：0

作者：

Abe, Masayuki ^{[1
]}

Chase, Melissa ^{[2
]}

David, Bernardo ^{[3
]}

Kohlweiss, Markulf ^{[2
]}

Nishimaki, Ryo ^{[1
]}

Ohkubo, Miyako ^{[4
]}

机构：

[1] NTT Secure Platform Labs, Tokyo, Japan

[2] Microsoft Res, Redmond, WA USA

[3] Univ Brasilia, Brasilia, DF, Brazil

[4] NICT, NSRI, Secur Architecture Lab, Tokyo, Japan

来源：

ADVANCES IN CRYPTOLOGY - ASIACRYPT 2012 | 2012年 / 7658卷

关键词：

Structure-preserving signatures; One-time signatures; Groth-Sahai proof system; Random message attacks; VERIFIABLY ENCRYPTED SIGNATURES; BLIND SIGNATURES; SECURE; FOUNDATIONS; SCHEME; PROOFS;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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 thembased 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.

引用

页码：4 / 24

页数：21