An Observation about Variations of the Diffie-Hellman Assumption
Bhaskar, Raghav; Chandrasekaran, Karthekeyan; V. Lokam, Satyanaryana; L. Montgomery, Peter; Venkatesan, Ramarathnam; Yacobi, Yacov
Serdica Journal of Computing (2009)
- Volume: 3, Issue: 3, page 309-318
- ISSN: 1312-6555
Access Full Article
topAbstract
topHow to cite
topBhaskar, Raghav, et al. "An Observation about Variations of the Diffie-Hellman Assumption." Serdica Journal of Computing 3.3 (2009): 309-318. <http://eudml.org/doc/11364>.
@article{Bhaskar2009,
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.},
author = {Bhaskar, Raghav, Chandrasekaran, Karthekeyan, V. Lokam, Satyanaryana, L. Montgomery, Peter, Venkatesan, Ramarathnam, Yacobi, Yacov},
journal = {Serdica Journal of Computing},
keywords = {Digital Signatures; Boneh-Boyen Signatures; Vector Signatures; Strong Diffie-Hellman; Computational Diffie-Hellman; Average Case Complexity; digital signatures; vector signatures; Boneh-Boyen signatures; computational Diffie-Hellman; average case complexity},
language = {eng},
number = {3},
pages = {309-318},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {An Observation about Variations of the Diffie-Hellman Assumption},
url = {http://eudml.org/doc/11364},
volume = {3},
year = {2009},
}
TY - JOUR
AU - Bhaskar, Raghav
AU - Chandrasekaran, Karthekeyan
AU - V. Lokam, Satyanaryana
AU - L. Montgomery, Peter
AU - Venkatesan, Ramarathnam
AU - Yacobi, Yacov
TI - An Observation about Variations of the Diffie-Hellman Assumption
JO - Serdica Journal of Computing
PY - 2009
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 3
IS - 3
SP - 309
EP - 318
AB - 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.
LA - eng
KW - Digital Signatures; Boneh-Boyen Signatures; Vector Signatures; Strong Diffie-Hellman; Computational Diffie-Hellman; Average Case Complexity; digital signatures; vector signatures; Boneh-Boyen signatures; computational Diffie-Hellman; average case complexity
UR - http://eudml.org/doc/11364
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.