Digital Signatures Boneh-Boyen Signatures Vector Signatures Strong Diffie-Hellman Computational Diffie-Hellman Average Case Complexity
Issue Date:
2009
Publisher:
Institute of Mathematics and Informatics Bulgarian Academy of Sciences
Citation:
Serdica Journal of Computing, Vol. 3, No 3, (2009), 309p-318p
Abstract:
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.