Abstract | ||
---|---|---|
This paper provides a framework to treat the problem of building signature schemes from identification schemes in a unified and systematic way. The outcomes are 1 Alternatives to the Fiat-Shamir transform that, applied to trapdoor identification schemes, yield signature schemes with tight security reductions to standard assumptions 2 An understanding and characterization of existing transforms in the literature. One of our transforms has the added advantage of producing signatures shorter than produced by the Fiat-Shamir transform. Reduction tightness is important because it allows the implemented scheme to use small parameters thereby being as efficient as possible while retaining provable security. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1007/978-3-662-53890-6_15 | ASIACRYPT |
Field | DocType | Volume |
Data mining,Discrete mathematics,Identification scheme,Computer science,Random oracle,Theoretical computer science,Short signature,Provable security | Conference | 10032 |
ISSN | Citations | PageRank |
0302-9743 | 11 | 0.57 |
References | Authors | |
27 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Mihir Bellare | 1 | 16437 | 1481.16 |
Bertram Poettering | 2 | 223 | 18.74 |
Douglas Stebila | 3 | 578 | 48.66 |