Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups Export

@article{citeulike:4546097, abstract = {Abstract\ \  We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in groups equipped with an efficient bilinear map, or, more generally, an algorithm for the Decision Diffie-Hellman problem. The security of our scheme depends on a new intractability assumption we call Strong Diffie-Hellman (SDH), by analogy to the Strong RSA assumption with which it shares many properties. Signature generation in our system is fast and the resulting signatures are as short as DSA signatures for comparable security. We give a tight reduction proving that our scheme is secure in any group in which the SDH assumption holds, without relying on the random oracle model.}, author = {Boneh, Dan and Boyen, Xavier}, citeulike-article-id = {4546097}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/s00145-007-9005-7}, citeulike-linkout-1 = {http://www.springerlink.com/content/v58685l030653286}, day = {20}, doi = {10.1007/s00145-007-9005-7}, journal = {Journal of Cryptology}, keywords = {pairings, signature}, month = {April}, number = {2}, pages = {149--177}, posted-at = {2009-05-19 22:16:19}, priority = {2}, title = {Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups}, url = {http://dx.doi.org/10.1007/s00145-007-9005-7}, volume = {21}, year = {2008} }

TY - JOUR ID - citeulike:4546097 L3 - citeulike-article-id:4546097 N2 - Abstract   We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in groups equipped with an efficient bilinear map, or, more generally, an algorithm for the Decision Diffie-Hellman problem. The security of our scheme depends on a new intractability assumption we call Strong Diffie-Hellman (SDH), by analogy to the Strong RSA assumption with which it shares many properties. Signature generation in our system is fast and the resulting signatures are as short as DSA signatures for comparable security. We give a tight reduction proving that our scheme is secure in any group in which the SDH assumption holds, without relying on the random oracle model. IS - 2 JF - Journal of Cryptology EP - 177 TI - Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups VL - 21 SP - 149 KW - pairings KW - signature AU - Boneh, Dan AU - Boyen, Xavier PY - 2008/04/20/ UR - http://dx.doi.org/10.1007/s00145-007-9005-7 ER -