You are looking at a specific version 20081216:215857 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Presented at U. Calgary and at b.Recent Developments in Cryptography and Information Security , Sept. 2008
- Keywords
- The Diffie-Hellman assumption
- Contact author(s)
- yacov @ microsoft com
- History
- 2008-12-16: received
- Short URL
- https://ia.cr/2008/525
- License
-
CC BY
