Short Signatures without Random Oracles

DMCA

Short Signatures without Random Oracles (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Dan Boneh , Xavier Boyen

Citations:

393 - 11 self

BibTeX

@INPROCEEDINGS{Boneh04shortsignatures,
    author = {Dan Boneh and Xavier Boyen},
    title = {Short Signatures without Random Oracles},
    booktitle = {},
    year = {2004},
    pages = {56--73},
    publisher = {Springer-Verlag}
}

OpenURL

Abstract

We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles. The security of our scheme depends on a new complexity assumption we call the Strong Di#e-Hellman assumption. This assumption has similar properties to the Strong RSA assumption, hence the name. Strong RSA was previously used to construct signature schemes without random oracles. However, signatures generated by our scheme are much shorter and simpler than signatures from schemes based on Strong RSA.

Keyphrases

random oracle short signature strong rsa chosen message attack signature scheme strong rsa assumption strong di e-hellman assumption short signature scheme new complexity assumption similar property

DMCA