Cryptology ePrint Archive: Report 2008/525

On The Diffie-Hellman Assumption

R. Bhaskar, K. Chandrasekaran, S. Lokam, P.L. Montgomery, R. Venkatesan, Y. Yacobi

Abstract: We generalize the Strong Boneh-Boyen (SBB) signature scheme to sign vectors (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.

Category / Keywords: foundations / The Diffie-Hellman assumption

Publication Info: Presented at U. Calgary and at b. Recent Developments in Cryptography and Information Security , Sept. 2008

Date: received 16 Dec 2008

Contact author: yacov at microsoft com

Available format(s): PDF | BibTeX Citation

Version: 20081216:215857 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]