We generalize the Strong Boneh-Boyen (SBB) signature scheme to sign vectors; we call this scheme GSBB. We show that if a particular (but most natural) average case reduction from SBB to GSBB exists, then the Strong Diffie-Hellman (SDH) and the Computational Diffie-Hellman (CDH) have the same worst-case complexity.
CITATION STYLE
Bhaskar, R., Chandrasekaran, K., Lokam, S. V., Montgomery, P. L., Venkatesan, R., & Yacobi, Y. (2009). An Observation about Variations of the Diffie-Hellman Assumption. Serdica Journal of Computing, 3(3), 309–318. https://doi.org/10.55630/sjc.2009.3.309-318
Mendeley helps you to discover research relevant for your work.