Short Signatures without Random Oracles Export

@misc{citeulike:438345, 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...}, author = {Boneh, D. and Boyen, X.}, citeulike-article-id = {438345}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.8061}, keywords = {oracle, pairings, random, signature}, posted-at = {2008-03-10 15:52:13}, priority = {4}, title = {Short Signatures without Random Oracles}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.8061}, year = {2004} }

TY - GEN ID - citeulike:438345 L3 - citeulike-article-id:438345 N2 - 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... TI - Short Signatures without Random Oracles KW - oracle KW - pairings KW - random KW - signature AU - Boneh, D AU - Boyen, X PY - 2004/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.8061 ER -