An Observation about Variations of the Diffie-Hellman Assumption

Authors

  • Raghav Bhaskar
  • Karthekeyan Chandrasekaran
  • Satyanaryana V. Lokam
  • Peter L. Montgomery
  • Ramarathnam Venkatesan
  • Yacov Yacobi

DOI:

https://doi.org/10.55630/sjc.2009.3.309-318

Keywords:

Digital Signatures, Boneh-Boyen Signatures, Vector Signatures, Strong Diffie-Hellman, Computational Diffie-Hellman, Average Case Complexity

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.

Downloads

Published

2009-11-03

Issue

Section

Articles