Efficient signature schemes with tight reductions to the Diffie-Hellman problems (Q2463446)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5218304
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient signature schemes with tight reductions to the Diffie-Hellman problems |
scientific article; zbMATH DE number 5218304 |
Statements
Efficient signature schemes with tight reductions to the Diffie-Hellman problems (English)
0 references
6 December 2007
0 references
This paper presents an analysis of two efficient signature schemes whose security is tightly related to the Diffie-Hellman problems in the random oracle model. The technique is developed with sound theoretical details and it can be applied to a wide variety of settings to yield more efficient cryptographic schemes. No experiments are performed for illustration.
0 references
signature schemes
0 references
Diffie-Hellman assumption
0 references
discrete algorithm
0 references
efficient schemes
0 references
0.8527401089668274
0 references
0.8362016081809998
0 references
0.8308936953544617
0 references
0.8308395743370056
0 references
